Abstract:
A network system comprising a first network element and a second network element. The first network element is programmed to provide the step of first, communicating to the second network element a plurality of configuration parameter sets. Each configuration parameter set corresponds to a respective frame fragment and comprises a parameter value that differs in value from the parameter value in another configuration parameter set in the plurality of configuration parameter sets. The first network element also is programmed to provide the step of second, communicating a frame, to the second network element, in a plurality of frame fragments, wherein each frame fragment in the plurality of frame fragments is communicated according to a respective parameter value in the plurality of configuration parameter sets.

Description:
CROSS-REFERENCES TO RELATED APPLICATIONS 
       [0001]    Not Applicable. 
       STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT 
       [0002]    Not Applicable. 
       BACKGROUND OF THE INVENTION 
       [0003]    The preferred embodiments relate to network element communications and, more particularly, to improved security of such communications and to protect against third party security threats. 
         [0004]    Network elements (or nodes) are typically logical entities that communicate onto a telecommunication or computing system network, so as to communicate with at least one other network element, according to a common network management scheme that involves various layers of protocol. These various layers provide a conceptual model, where one well known example is the Open Systems Interconnection (OSI) model. In this and comparable models, each network layer has an associated protocol and, other than the lowermost physical layer, is served by a layer beneath it. In the OSI model, the highest layer, which interacts with an end user, is the application layer, and beneath it are several layers. The second lowest layer is the data link, which is sometimes called the Media Access Control or MAC layer, although a logical link control layer may also be a part of this layer. The MAC layer defines the frame as its protocol data unit and defines the communication over a link between two network elements and the flow control between them. The lowest layer is the physical layer, which is so named as it represents the electrical and physical connectivity of the data communication to/from the physical transmission medium (e.g., cable or wireless frequency) of the network, so as to transmit and receive bits over the medium that represent the frames received from the MAC layer. 
         [0005]    While network element communications according to the above principles are widely implemented, various forms of security also have been added so as to protect communications from potential nefarious actions by third parties. Such security may take various forms, such as authentication and encryption. Authentication typically confirms a network element&#39;s authority to connect to a network, usually at the commencement of communication (or a communication session). Encryption, however, continues to protect successive communications, for example by encrypting each data frame communicated between two network elements. In this regard, encryption may be implemented at any layer above PHY. In any event, under the encryption methodology, a transmitting network element uses a cryptographic key to encrypt a data frame, after which the encrypted frame is then transmitted and the intended destination receiving network element then decrypts the encrypted frame, with that receiving network element having knowledge of the original encryption key. 
         [0006]    Various types of encryption keys and processes exist, and what they have in common is the security is predicated on only the transmitting and receiving network elements having knowledge of the key for a session. In this regard, it is known in the art that nefarious third parties may seek to uncover or otherwise discover an encryption key and, if successful, the party may then intercept frames communicated between the intended proper network elements and, with the key, nefariously decrypt the frames between those elements. Toward this end, also known in the art is that such a wrongdoer may collect and store a number of frames into what is referred to as a “dictionary,” and from analyses on such a dictionary determine the encryption key used to encrypt the frames in the dictionary. Having this key, and as stated above, thereby permits unauthorized decryption by the third party of the captured frames. 
         [0007]    Recognizing the above, the prior art has developed additional methodologies to reduce the chance of illicit discovery of encryption keys. As a first example, during a communication session, the key may be periodically changed, where such an approach is sometimes referred to as re-keying. Thus, the wrongdoer is prevented from collecting a sufficient amount of frames that are encrypted per a single key, thereby reducing or eliminating the chance of the key being discovered. This approach, however, has various disadvantages, including higher network overhead, potentially having to rekey an entire network, and added complexity in the presence of “sleepy” devices needing to be re-keyed, while not readily accessible if in a sleep state. As a second example, unique session tokens can be generated for every session, whereby the token is further used as part of the encryption/decryption process. This approach also has various disadvantages, including session key maintenance overhead, and it also is susceptible to dictionary attack if a session and its token are maintained over a period of time sufficient to allow the wrongdoer enough information to get past both the encryption key and the accompanying token. 
         [0008]    Given the preceding, there arises a need to address certain security issues in network element communications and to improve on the prior art approaches, and the preferred embodiments are directed to such a need as further explored below. 
       BRIEF SUMMARY OF THE INVENTION 
       [0009]    In a preferred embodiment, there is a network system comprising a first network element and a second network element. The first network element is programmed to provide the steps of: (1) first, communicating to the second network element a plurality of configuration parameter sets, wherein each configuration parameter set corresponds to a respective frame fragment and comprises a parameter value that differs in value from the parameter value in another configuration parameter set; and (2) second, communicating a frame, to the second network element, in a plurality of frame fragments, wherein each frame fragment in the plurality of frame fragments is communicated according to a respective parameter value in the plurality of configuration parameter sets. 
         [0010]    Numerous other inventive aspects and preferred embodiments are also disclosed and claimed. 
     
    
     
       BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWING 
         [0011]      FIG. 1  illustrates an electrical block diagram of a network system  10 , according to a preferred embodiment. 
           [0012]      FIG. 2  illustrates the preferred embodiment frame sequencing of the network elements of  FIG. 1 . 
           [0013]      FIG. 3  details frame fragmenting per a preferred embodiment. 
           [0014]      FIG. 4  illustrates a flowchart of a preferred embodiment method of operation of communication between a transmitting and receiving network element. 
       
    
    
     DETAILED DESCRIPTION OF EMBODIMENTS 
       [0015]      FIG. 1  illustrates an electrical block diagram of a network system  10 , according to a preferred embodiment. System  10  includes various aspects known in the art which are first described here, followed by additional preferred embodiment aspects described in the remainder of this document. Looking first to the former, system  10  includes a local area network (LAN) shown generally above a horizontal dashed line in the Figure, and the LAN includes a number of well-known items. The LAN also is connected via an Internet Service Provider ISP to the Internet, which itself represents and/or is connected to a network of additional networks, including the elements connected to those networks. Returning to the LAN, it has a physical interface  12  such as a multi-conductor cable, to which are connected a number N of network elements shown as NE 1.1 , NE 1.2 , . . . , NE 1.N . As introduced earlier in the Background Of The Invention section of this document, each of these (and other) network elements referred to herein are logical entities that communicate onto a telecommunication or computing system network; such elements, therefore, may be computers, tablets, personal devices, as well as modules or the like that are anticipated to be prolific in the development of the Internet-of-Things (IoT). Such devices may be constructed of myriad forms of hardware and software (including firmware and the like), with at least the minimal functionality to communicate to another device in the LAN. Further, the network elements may include various other computational or feature functionality, including sensors and response, for example, in the case of network elements serving in an IoT environment. Also connected to physical interface  12  are a router  14 , which is further coupled to (or includes) a wireless adapter  16 . Wireless adapter  16  is operable to bi-directionally communicate wirelessly with a number M of network elements shown as NE 2.1 , NE 2.2 , . . . , NE 2.M . Router  14  controls the forwarding of data packets among the network elements in the LAN as well as between the LAN and the ISP. 
         [0016]    Looking to additional preferred embodiment aspects of system  10 , one or more, and preferably all, of its network elements NE 1.x  and NE 2.x  are further improved with security protocol programming, as may be implemented in either hardware, software, or a combination thereof, so as to reduce the possibility that encrypted frames communicated by those elements may be decrypted by a nefarious third party. In this regard,  FIG. 2  introduces the preferred embodiment frame sequencing of the network elements of  FIG. 1 , and  FIG. 3  details how frames of the sequence are fragmented, for improving security. Each of these aspects is described below. 
         [0017]      FIG. 2  illustrates a block diagram of frame sequencing according to a preferred embodiment. Generally, the illustration of  FIG. 2  alone is known in the art, although modifications beyond the illustration are contemplated and described, so one skilled in the art already will readily understand certain aspects. To the left in  FIG. 2  is shown a network layer reference model  20 , where the example shown is that provided by OSI. The OSI model  20  has seven layers, which are identified in  FIG. 2  by layer name and a reference of  20   v , where v is the layer number. One skilled in the art will readily recognize these layers and the art is replete with references describing each layer, so a detailed discussion of such aspects is not provided herein. In all events, each layer of model  20  generally has an associated protocol data unit (PDU). In this regard and with respect to a preferred embodiment,  FIG. 2  further illustrates that associated with the data link layer  20   2  the PDU is a frame. The layer  20   2  frame includes data and other information from higher layers than are encapsulated into a sequence of Q frames, shown in  FIG. 2  as communicated over time. Thus, each frame is communicated from data link layer  20   2  to the underlying physical layer  20   1 , at which point the data is, in the form of bits, communicated by physical layer  20   1  according to the corresponding media (i.e., wireleline, wireless, or both). 
         [0018]      FIG. 3  illustrates a block diagram of any of the Q frames from  FIG. 2 , so the single frame in  FIG. 3  is referenced as a frame FR y . As is common in the art, frame FR y  has three portions, a header HR, a data payload DP, and an error correction EC. Header HR is commonly a bit pattern that is distinct from the rest of the bits in frame FR y  and allows synchronization by delineating the start of frame FR y  from the rest of the frame (and from a preceding and possibly subsequent frame). A receiving network element therefore can detect this bit pattern and align the frame for purposes of decoding the remaining information therein. Data payload DP includes user data and also may include control information. The control information permits delivering the payload, and the user data is generally that data which was generated by the transmitting network element for use at the higher layers of the receiving network element. Lastly, error correction EC includes information so that the receiving network element can determine if it accurately received the information contained in the frame, that is, whether the bit values as decoded match that which were transmitted. A typical error correction EC approach is a cyclic redundancy check, and note that error correction EC may be considered its own portion of frame FR y  or some may view it as the ending portion of data payload DP. 
         [0019]    According to a preferred embodiment and as further shown in  FIG. 3  by vertical dashed lines, for communicating between a transmitting and receiving network element, frame FR y  is divided into an integer number Z of what are referred to herein as frame fragments, shown in  FIG. 3  as FFG( 1 ), FFG( 2 ), . . . , FFG(Z). More particularly, for a single ISO layer (e.g., data link  20   2 ), the bits of its PDU (e.g., frame) are logically divided into individual groups referred to as fragments, each of which is to be communicated according to a different set of what is now introduced as “configuration parameter set (CPS).” Thus, for sake of reference, the following Table 1 illustrates the  FIG. 3  frame fragments FFG(x), each with its own respective CPS: 
         [0000]                                TABLE 1                       Frame    Configuration            fragment   parameter set                           FFG(1)   CPS(1)           FFG(2)   CPS(2)           FFG(3)   CPS(3)           .   .           .   .           .   .           FFG(Z)   CPS(Z)                        
Each fragment FFG(x), therefore, represents a portion of the frame FR y . Moreover, given the fragmentation described herein, preferably each fragment includes not only a respective portion of frame FR y  as suggested by  FIG. 3 , but a preferred embodiment also adds a corresponding cyclic redundant check (CRC) or other error correction code solely for the data in the respective fragment, whereas such information was not represented in the original frame FR y . Moreover, the final fragment FFG(Z) will therefore include both this type of CRC for that specific fragment, as well as the error correction code (e.g., also CRC) for the entire frame FR y .
 
         [0020]    Given Table 1 and the above introduction, therefore, when a transmitting network element transmits a frame FR y  to a receiving network element, a first portion of frame FR y  is transmitted as frame fragment FFG( 1 ) according to a first set of parameter(s) specified in configuration parameter set CPS( 1 ), a second portion of frame FR y  is transmitted as frame fragment FFG( 2 ) according to a second set of parameter(s) specified in CPS( 2 ), and so forth until last portion of frame FR y  is transmitted as frame fragment FFG(Z) according to a last set of parameter(s) specified in CPS(Z). Moreover and as detailed below, the receiving network element is earlier informed of Table 1, so when it is to detect, receive, and decode each incoming frame fragment FFG(x), it does so according to the respective configuration parameter set CPS(x). As detailed below, the difference in respective configuration parameter sets may be a change in one or more parameters associated with each set, such as a change in frequency or PHY mode. Note also that in the preferred embodiment, fragmenting of a frame as shown in  FIG. 3  is preferably such that header HR is not fragmented, so that the first frame fragment FFG( 1 ) will include the entire header HR and also may include a portion of data payload DP, for reasons further detailed below. 
         [0021]      FIG. 4  illustrates a flowchart of a preferred embodiment method  30  of operation of communication between a transmitting and receiving network element. Method  30  commences with a discovery phase  32 , where each of the transmitting and receiving network element establish a connection, or a session, along the network medium and to one another. This discovery phase is followed by a step  34  authentication phase. 
         [0022]    In a preferred embodiment and as known in the art, in the step  34  authentication phase, a higher level of security, typically referred to as the Authentication and Key Exchange phase performed at higher levels, is applied as compared to that in subsequent payload data communications. This higher security level better protects information communicated between network elements during the authentication phase. Accordingly, such an increased security level is enforced in step  34 , and also per the art a key transfer is accomplished between the transmitting and receiving network element, the key being that by which the transmitting node is encrypting frames and from which the receiving network element can decrypt the encrypted frames it receives from the transmitting network element. In addition to the prior art authentication information transfer, the preferred embodiment also during step  34  communicates the CPS information (e.g., Table 1) from the transmitting network element to the receiving network element. Next, method  30  continues to step  36 . 
         [0023]    In step  36 , an index count value FFG C  is initiated to a value of one. Next, method  30  continues from step  36  to step  38 . 
         [0024]    In step  38 , the transmitting network element communicates the frame fragment FFG, at the current index of FFG C , according to the configuration parameter set CPS at the same index. Thus, in the first instance of step  38  being reached immediately after step  36 , then fragment FFG( 1 ) is communicated per the corresponding parameter(s) in set CPS( 1 ). As shown in  FIG. 3 , therefore, the entire header HR and a portion of data payload DP are thereby transmitted as FFG( 1 ), and since the header HR is not fragmented the likelihood of its successful receipt and decoding are improved, as compared to the alternative were the header permitted to be fragmented. Further, and by way of example, in one preferred embodiment and as introduced earlier, the CPS per fragment may differ from another by a change in transmission frequency. In such a case, in the first instance of step  38  being reached immediately after step  36 , then fragment FFG( 1 ) is transmitted by the transmitting network element at a set CPS( 1 ) that specifies a frequency value of freq( 1 ). Moreover, because Table 1 was previously communicated to the receiving network element (during step  34 ), then in the first instance of step  38  being reached immediately after step  36 , the receiving network element tunes to freq( 1 ) to detect the arrival (and to facilitate the decoding) of frame fragment FFG( 1 ). Next, method  30  continues from step  38  to step  40 . 
         [0025]    In step  40 , the transmitting network element determines if all frame fragments for the current frame have been communicated, which is accomplished in a preferred embodiment by comparing the current count of the index FFG C  to the total number Z, of frame fragments in a frame. If the count has not yet reached Z, then method  30  continues from step  40  to step  44 , whereas if the count has reached Z, then method  30  continues from step  40  to step  46 . 
         [0026]    In step  44 , the current count of the index FFG C  is incremented and the flow returns to step  38 . In such an instance, therefore, step  38  again communicates a frame fragment from the transmitting network element to the receiving network element, in this case at the increased index of FFG C . Hence, if the immediately preceding instance of step  38  communicated fragment FFG( 1 ) per the corresponding parameter(s) in CPS( 1 ), which again as an example could involve a transmission frequency freq( 1 ), then in this next instance of step  38  the transmitting network element transmits fragment FFG( 2 ) according to set CPS( 2 ), thereby transmitting it at a different frequency value of freq( 2 ). Method  30  then continues to another instance of step  40 , so that the methodology will repeat until all Z frame fragments have been communicated, each at a preferably different frequency value from the value of at least one (or all) of the frequencies used for other fragments of the frame. 
         [0027]    Once all Z frame fragments have been communicated, method  30  concludes with step  46 , where communication of the frame (and/or session) is ended. Given the preceding, therefore, one skilled in the art should appreciate that, where frequency is the change in CPS for each instance of step  38 , then in effect method  30  implements frequency hopping, not with respect to the context of the prior art which concerns itself with individual frames and channel interference, but instead with respect to separating frame fragments, according to one preferred embodiment. As a result, a third party attack is thwarted in that the chances of successfully capturing each of the frame fragments (e.g., into a “dictionary”) is greatly reduced, given the change in CPS (e.g., frequency) for each frame fragment. Indeed, for a protocol/hardware that already contemplates frequency hopping for entire frames, the preferred embodiments may be implemented further with respect to frame fragments, with relatively small additional complexity. Of course, the preferred embodiments also may be implemented in a system that did not originally contemplate frequency hopping, where the system may be readily modified by one skilled in the art so as to achieve the fragment/respective frequency change described above. In all events, therefore, with a relatively low overhead change, the preferred embodiment reduces the drawbacks of the prior art. 
         [0028]    In an alternative preferred embodiment, method  30  is again conducted, where instead of frequency differentiating one CPS from another, the change in parameter between successive CPS values is based on a change in PHY mode. Thus, Table 1 would be represented in this instance as shown in the following Table 2: 
         [0000]                                    TABLE 2                       Frame    Configuration    PHY            fragment   parameter set   mode                           FFG(1)   CPS(1)   PHY(1)           FFG(2)   CPS(2)   PHY(2)           FFG(3)   CPS(3)   PHY(3)           .   .   .           .   .   .           .   .   .           FFG(Z)   CPS(Z)   PHY(Z)                        
Per Table 2, therefore, as the count FFG C  is incremented, for each successive frame fragment FFG(FFG C ), a corresponding change in PHY mode PHY(FFG C ) is likewise implemented in the transmission, and receipt/detection/decode of the fragment. In this alternative, therefore, each frame fragment FFG(FFG C ) may be communicated at a same frequency and thus without frequency hopping, with instead a change in the PHY mode value for each fragment. One example of such a PHY mode change may be implemented by a change in the encoder polynomials, so that in this preferred embodiment a first encoder polynomial value is used to transmit (and receive) FFG( 1 ), a second encoder polynomial value for FFG( 2 ), and so forth for subsequent fragments. Another example of PHY mode change may be implemented by a change in the manner of scrambling bits, where the latter could be the manner in which bits are interleaved—thus, in this preferred embodiment a first interleaving pattern is used to transmit (and receive) FFG( 1 ), a second interleaving pattern for FFG( 2 ), and so forth. Again, therefore, a third party attack is thwarted in that the chances of successfully capturing each of the frame fragments is significantly reduced, as the security of the frame communication is enhanced by using a secure sequence of fragments, with each fragment being communicated along a time sequence of fragments but according to a change in at least one parameter for the communicated fragment.
 
         [0029]    Given the preceding, the preferred embodiments provide a network system with network element communications that improve on the prior art by reducing third party security threats. While various aspects have been described, substitutions, modifications or alterations can be made to the descriptions set forth above without departing from the inventive scope. For example, while a change in a single parameter among the configuration parameter sets has been shown, in an alternative preferred embodiment multiple parameters may be changed between such sets. As another example, while the changing parameters described above include frequency and PHY mode, others may be contemplated or ascertained by one skilled in the art, given the present inventive teachings. As still another example, various of the flowchart steps may be re-ordered or further modified (including adding additional steps). Still other examples will be ascertainable by one skilled in the art and are not intended as limiting to the inventive scope, which instead is defined by the following claims.