Method and apparatus to facilitate transmission of an encrypted rolling code

Information

  • Patent Grant
  • 11799648
  • Patent Number
    11,799,648
  • Date Filed
    Monday, March 8, 2021
    3 years ago
  • Date Issued
    Tuesday, October 24, 2023
    7 months ago
Abstract
An encrypted rolling code, a plurality of differing data bit order patterns, and a plurality of differing data inversion patterns are provided. One then selects a particular one of each of these patterns and uses those selected patterns as transmission characteristics when transmitting at least part of the encrypted rolling code.
Description
TECHNICAL FIELD

This invention relates generally to encrypted rolling codes and more particularly to the transmission of encrypted rolling code information.


BACKGROUND

Rolling codes are known in the art. Rolling codes are often used, for example, in conjunction with movable barrier operators of various kinds (with movable barrier operators of various kinds also being known in the art and including operators that effect the selective control and movement of single panel and segmented garage doors, pivoting, rolling, and swinging gates, guard arms, rolling shutters, and various other movable barriers). In such an application setting, a wireless transmitter can send a code to a corresponding movable barrier operator to cause the latter to effect a desired movement or other action with respect to, for example, a corresponding movable barrier.


When using rolling codes, the code transmitted by the wireless transmitter will change (often with each transmission) in accordance with a predetermined plan or algorithm that is also known to the movable barrier operator. Such an approach can foil the use of an intercepted code by an unauthorized party because that intercepted code will not typically again, at least in the near term, be honored by that movable barrier operator should the unauthorized party attempt to themselves transmit that code. Without knowledge of the underlying scheme by which a next code is selected, the unauthorized party who gains access to a presently used code will still remain unable to leverage that knowledge in support of effecting unauthorized control over the movable barrier operator.


There may be instances, however, when additional security may be desired or appropriate. For example, a given rolling code instantiation may be open to brute force attacks or other weaknesses due to local and/or otherwise unique circumstances.





BRIEF DESCRIPTION OF THE DRAWINGS

The above needs are at least partially met through provision of the method and apparatus to facilitate transmission of an encrypted rolling code described in the following detailed description, particularly when studied in conjunction with the drawings, wherein:



FIG. 1 comprises a flow diagram as configured in accordance with various embodiments of the invention;



FIG. 2 comprises a flow diagram as configured in accordance with various embodiments of the invention;



FIG. 3 comprises a depiction of prior art ternary encoding;



FIG. 4 comprises a flow diagram as configured in accordance with various embodiments of the invention;



FIG. 5 comprises a flow diagram as configured in accordance with various embodiments of the invention;



FIG. 6 comprises a mapping table as configured in accordance with various embodiments of the invention;



FIG. 7 comprises a schematic view of bit processing and parsing in accordance with various embodiments of the invention;



FIG. 8 comprises a comprises a schematic joint message diagram as configured in accordance with various embodiments of the invention;



FIG. 9 comprises a schematic view of bit selection and parsing as configured in accordance with various embodiments of the invention;



FIG. 10 comprises an illustrative example of a lookup table as configured in accordance with various embodiments of the invention;



FIG. 11 comprises a schematic view of two joint messages as configured in accordance with various embodiments of the invention;



FIG. 12 comprises a schematic view of bit parsing as configured in accordance with various embodiments of the invention;



FIG. 13 comprises a schematic view of a joint message as configured in accordance with various embodiments of the invention;



FIG. 14 comprises an illustrative example of a lookup table as configured in accordance with various embodiments of the invention;



FIG. 15 comprises a schematic view of bit processing and parsing as configured in accordance with various embodiments of the invention;



FIG. 16 comprises a schematic view of a joint message as configured in accordance with various embodiments of the invention;



FIG. 17 comprises an illustrative example of a lookup table as configured in accordance with various embodiments of the invention; and



FIG. 18 comprises a block diagram as configured in accordance with various embodiments of the invention.





Skilled artisans will appreciate that elements in the figures are illustrated for simplicity and clarity and have not necessarily been drawn to scale. For example, the dimensions and/or relative positioning of some of the elements in the figures may be exaggerated relative to other elements to help to improve understanding of various embodiments of the present invention. Also, common but well-understood elements that are useful or necessary in a commercially feasible embodiment are often not depicted in order to facilitate a less obstructed view of these various embodiments of the present invention. It will also be understood that the terms and expressions used herein have the ordinary meaning as is accorded to such terms and expressions with respect to their corresponding respective areas of inquiry and study except where specific meanings have otherwise been set forth herein.


DETAILED DESCRIPTION

Generally speaking, pursuant to these various embodiments, an encrypted rolling code, a plurality of differing data bit order patterns, and a plurality of differing data inversion patterns are provided. One selects a particular one of each of the bit order patterns and the data inversion patterns to provide selected patterns and then uses those selected patterns as transmission characteristics when transmitting at least part of the encrypted rolling code.


By these teachings, for example, a wireless remote control transmitter can be provided with data to be transmitted, where that data comprises, at least in part, at least portions of an encrypted rolling code and where that data comports with a particular data bit order pattern and a particular data inversion pattern as a function of a given portion of that rolling code. That data can then be transmitted in combination with the given portion of the encrypted rolling code wherein that given portion of the rolling code is not transmitted with any of its bits reordered or inverted as a function of the given portion itself. Accordingly, a receiver that receives the data can then properly recover the re-ordered/inverted portions of the encrypted rolling code as a function of the given portion of the encrypted rolling code.


By one approach, if desired, the aforementioned data can comprise ternary data that is presented in a binary format. The use of ternary data can aid in facilitating compatible interaction with at least some movable barrier operators while also achieving an encryption effect at the same time as tending to ensure compatible use with binary peripheral platforms and the like. By one approach, this can comprise mapping each trit of the ternary data to a corresponding pair of binary bits. A pair of binary bits can represent 4 discrete information elements and by one approach, three of these discrete information elements can each correspond to one of the three trit states/levels while the fourth discrete information element (which otherwise comprises an illegal value) can serve a synchronization function.


If desired, in addition to the aforementioned encrypted rolling code, a fixed code can also be included in the transmission. By one approach, for example, both the aforementioned part of the encrypted rolling code and this fixed code can be transmitted using the above-described selected patterns as transmission characteristics.


These and other benefits may become clearer upon making a thorough review and study of the following detailed description. Referring now to the drawings, and in particular to FIG. 1, an illustrative process in this regard provides 11 an encrypted rolling code. As will be illustrated in more detail below, this can comprise, if desired, providing an encrypted rolling code as a plurality of bit pairs as correspond to a ternary data set.


If desired, this process will also optionally accommodate providing 12 a fixed code. This fixed code can vary with the needs, requirements, and/or opportunities of a given application setting, but can, for example, comprise a value that is substantially unique to a given transmitter and hence comprises a value that will serve to identify that given transmitter. Such an approach can be useful, for example, when used in conjunction with a remote control movable barrier operator transmitter.


This process also provides 13 a plurality of differing data bit order patterns. By one approach, for example, this can comprise data bit order patterns that each comprise a pattern for exactly three bits. As will be shown below, this can be particularly beneficial when used in conjunction with bit pairs that correlate to corresponding ternary data. Similarly, this process provides 14 a plurality of different data inversion patterns. As before, if desired, this can comprise providing patterns that each comprise a pattern for exactly three bits. The number of patterns provided in either case can vary as desired. By one approach, however, this can comprise providing at least nine different bit order patterns and nine different data inversion patterns. Illustrative examples in this regard are provided further herein.


This process then provides for selecting 15 a particular one of each of the data bit order patterns and the data inversion patterns to provide resultant corresponding selected patterns. There are various ways by which such selections can be made. By one approach, one may use a predetermined portion of the previously provided encrypted rolling code to inform the making of these selections. For example (and as will be illustrated in more detail herein), this can comprise using a predetermined four bit pairs of the encrypted rolling code as a basis for selecting the particular data bit order pattern and the particular data inversion pattern. As another example in this regard, in combination with the foregoing or in lieu thereof, this can comprise using a first predetermined portion of the encrypted rolling code to select a first particular data bit order pattern and a first data inversion pattern and using a second predetermined portion of the encrypted rolling code (that is, for example, discrete with respect to the first predetermined portion of the encrypted rolling code though this is not a fundamental requirement) to select a second particular data bit order pattern and a second data inversion pattern.


This process then provides for transmitting 16 at least a part of the encrypted rolling code itself (as well as at least a part of the above-described fixed code when present) using the aforementioned selected patterns as transmission characteristics. By one approach this can comprise making such a transmission using Manchester encoding as is known in the art.


So configured, these teachings are readily employed, for example, to facilitate the transmission of a remote control message. This can comprise, for example, providing a fixed message having at least a first part and a second part along with an encrypted rolling code that has a first through a fourth part. The first part of the encrypted rolling code can then be used to select a particular data bit order pattern and a data inversion pattern to use as a set of first selected patterns while the second part of the encrypted rolling code can be used to select a second set of patterns from amongst the available candidate patterns. One can then transmit the first part of the fixed message and the third part of the encrypted rolling code using the first selected patterns as transmission characteristics while transmitting the second part of the fixed message and the fourth art of the encrypted rolling code using the second selected patterns as transmission characteristics.


By one approach, in this illustrative example this can also comprise transmitting the first and second parts of the encrypted rolling code without using either the first or selected patterns as transmission characteristics. So configured, the first and second parts of the encrypted rolling code are then readily usable as recovery identifiers that can be used by a receiver to recover the first and second parts of the fixed message and the third and fourth parts of the encrypted rolling code.


To illustrate further in this regard, these first and second parts of the encrypted rolling code could each comprise four bit pairs as correspond to the aforementioned ternary data. In such a case, two of the bit pairs as comprise the first part of the encrypted rolling code can be used with a lookup table to correlate those two bit pairs to a corresponding data bit order pattern. In a similar manner the remaining bit pairs can be used with a second lookup table (which may, if desired, actually comprise a part of the first lookup table) to correlate these bit pairs with a corresponding data inversion pattern. In a similar fashion, two of the bit pairs of the four bit pairs as comprise the second part of the encrypted rolling code can be used with that first lookup table to identify another data bit order pattern while the remaining two bit pairs can be used with the second lookup table to identify a corresponding data inversion pattern.


In such a case, the aforementioned transmission can then comprise transmitting the second part of the fixed message and the fourth part of the encrypted rolling code using the second selected patterns as transmission characteristics only after not transmitting for at least a predetermined period of time following transmission of the first part of the fixed message and the third part of the encrypted rolling code using the first selected patterns as transmission characteristics. The duration of this predetermined period of time can vary with the needs and opportunities of a given application setting, but a duration of about 75 milliseconds will suffice for many expected purposes.


In addition to facilitating a transmission of an encrypted rolling code and other content that comprises, for example, information that is unique to a given transmitter (such as a unique identifier for that transmitter), these teachings will further readily accommodate the transmission of additional data that is not substantially unique to the transmitter. This can comprise, for example, providing a data payload (such as a remote control instruction such as OPEN, CLOSE, VACATION MODE, LIGHTS ON, LIGHTS OFF, and so forth) that is not substantially unique to a given transmitter and then transmitting the first part of the fixed message, the third part of the encrypted rolling code, and a first part of this data payload while using the first selected patterns as transmission characteristics and transmitting the second part of the fixed message, the fourth part of the encrypted rolling code, and a second (remaining) portion of the data payload using the second selected patterns as transmission characteristics. When the data payload comprises a relatively large quantity of data as compared to the fixed message and/or the encrypted rolling code, additional portions of the data payload as are not accommodated by the just-described process can then be supplementally transmitted using one of the already selected patterns (or other patterns, if desired) as transmission characteristics.


As another specific illustrative example in this regard, and referring now to FIG. 2, a wireless remote control transmitter (such as a movable barrier operator remote control) can be configured and arranged to provide 21 data to be transmitted. This data can comprise, at least in part, at least portions of an encrypted rolling code. In any event, this data will comport with a particular data bit order pattern and a particular data inversion pattern as a function of a given portion of the rolling code. By one approach, if desired, this process can further comprise, at least in part, storing 22 this data in a memory prior to transmitting the data. The duration of such storage can vary considerably depending upon the specifics of a given application setting.


This wireless remote control transmitter can then transmit 23 this data in combination with the given portion of the encrypted rolling code such that the given portion of the encrypted rolling code is not transmitted with any of its bits reordered or inverted as a function of the given portion of the encrypted rolling code. So configured, a receiver that receives this data can properly recover the modified portions of the encrypted rolling code as a function, at least in part, of the unmodified given portion of the encrypted rolling code.


As noted above, these teachings are readily applied in a context that makes use of ternary data. It may therefore be helpful to first describe in more detail a typical ternary data protocol as one finds often deployed in conjunction with many movable barrier operators. Pursuant to one approach, pulses of similar amplitude have one of three different durations. For example, and referring now to FIG. 3, a first pulse 31, having a shortest duration, can represent the data element “0.” A second pulse 32, having a medium length duration, can represent the data element or state “1.” And a third pulse 33, having a longest duration, can represent the data element or state “2.” Such a data mapping protocol serves well to effect a base three-based data exchange. The present teachings can accommodate use and leveraging of a ternary approach to effect relatively secure and compatible communications between a movable barrier operators and corresponding peripheral components of choice. These teachings are also compatible for use with an approach that eschews the specific ternary approach just described.


Referring now to FIG. 4, in general, these teachings will accommodate a process 40 that itself provides 41 ternary data as corresponds to a movable barrier operator and then converts 42 that ternary data to a binary format to provide resultant binary information. This binary information is then transmitted 43 from one platform to another. As will be shown below, this ternary-to-binary conversion process serves, at least in part, as a kind of encryption process which in turn aids in ensuring the authenticity and accuracy of the information being transmitted.


The ternary data itself can comprise, at least in part, bearer data. More particularly, and referring momentarily to FIG. 5, pursuant to one (optional) approach, provision of ternary data can comprise prior provision 51 of binary bits comprising information that corresponds to the movable barrier operator (for example, information sourced by, or intended for, a movable barrier operator). Such information can optionally comprise, for example, movable barrier operator fixed information 52 such as identifying information for a particular movable barrier operator, a particular peripheral component, or the like. Such information can also optionally comprise (in addition to or in lieu of fixed information 52) non-fixed information 53 such as the aforementioned data payload as again corresponds to the movable barrier operator. This non-fixed information 53 can comprise bearer data/information (such as, but not limited to, platform status information, commands, acknowledgments, and so forth). As already noted, this non-fixed information 53 can also comprise varying quantities of data if desired.


These binary bits are then converted 54 into the aforementioned ternary data. This could comprise, in an appropriate platform, a conversion of the binary data into ternary data such as that described above with respect to FIG. 3. In general, such an approach need not be used. Instead, the binary data can be converted into a binary-bit-based ternary format (with an illustrative example being provided further below).


By one approach, however, this does not comprise a simple reversal of the binary-to-ternary process just described. Instead, the ternary-to-binary conversion step can comprise mapping each trit of the ternary data to a corresponding pair of binary bits. To illustrate such a map 61, and referring momentarily to FIG. 6, the ternary data element “0” (which corresponds to the usual binary data element “0”) maps to the binary pair “00.” In similar fashion, ternary “1” (which corresponds to usual binary “1”) maps to the binary pair “01” and ternary “2” (which corresponds to usual binary “11”) maps to the binary pair “01.”


This leaves an otherwise unused binary pair “11.” Pursuant to a preferred approach, this otherwise illegal value can serve a synchronization function when facilitating communications as between a movable barrier operator and one or more peripheral components when using a binary format that otherwise has no synchronization mechanism built into its format (for example, a stream of binary bits such as:


011011111110100111011101101111111010011101110110111111101001110111


which format lacks a frame marker or other point of synchronization). To illustrate, a synchronization signal/marker comprising this “11” binary pair can be used to indicate, for example, the regular end and/or start of a frame or message as in the following example:


110110111111011110111011110110111111101111110111111101101111111011111


where the bold font “11” regularly spaced binary pairs serve as frame markers (and which, due to their synchronized regular spacing, are readily distinguishable from other “11” pairs as may occur for whatever reason (illustratively depicted in the above example with italic font).


Those skilled in the art will appreciate that this process of converting binary information into ternary information, followed by conversion of that ternary information into corresponding binary pairs, yields, in most cases, a different bit sequence (and even a different number of bits) as compared to the initial binary information. This difference serves, at least in part, as a non-key-based encryption technique and hence provides a way of effecting the provision of an encrypted rolling code.


Referring now to FIG. 7, a more detailed illustrative embodiment will be presented. In this first illustrative example, the only substantive content to be associated and transmitted with a 28 bit rolling code 71 comprises a 40 bit value that represents fixed information 72. This fixed information 72 may serve, for example, to uniquely identify the transmitter that will ultimately transmit this information as noted above.


In this particular illustrative embodiment, the bits comprising the rolling code 71 are encrypted 73 by mirroring the bits and then translating those mirrored bits into ternary values as suggested above to provide corresponding bit pairs (in this example, this would comprise 18 such bit pairs) to thereby provide a resultant encrypted rolling code 74. This mirroring can be applied to specific groupings of bits in the rolling code creating mirrored groups or can involve the entire value. In this illustrative example, the encrypted rolling code 74 is presented for further processing as four groups. In this example, these four groups comprise a roll group E 74A comprised of four binary bit pairs, a roll group F 74B comprised of five binary bit pairs, a roll group G 74C comprised of four binary bit pairs, and a roll group H 74D comprised of five binary bit pairs.


The 40 bit fixed information 72 is subdivided in a similar manner albeit sans encryption. This comprises, in this particular illustrative approach, forming four subgroups comprising a fixed group A 75A, a fixed group B 75B, a fixed group C 75C, and a fixed group D 75D, wherein each such group is comprised of 10 bits of the original 40 bit value.


These variously partitioned data groups can then be used as shown in FIG. 8 to effect a desired transmission. In this example, one or more joint messages 80 provide a primary vehicle by which to communicate the desired information (which includes both the encrypted rolling code and fixed information data as modified as a function of a given portion of the encrypted rolling code along with a recovery identifier that represents that given portion of the encrypted rolling code). This joint message 80 comprises, generally speaking, a first 20 bit portion 81 and a second 30 bit portion 82.


The first portion 81 comprises, in this embodiment, the following fields:

    • “0000”— these bits 81A serve to precharge the decoding process and effectively establish an operational threshold;
    • “1111”— these bits 81B comprise two bit pairs that present the illegal state “11” (“illegal” because this corresponds to a fourth unassigned state in the ternary context of these communications) and serve here as a basis for facilitating synchronization with a receiving platform;
    • “00”— this bit pair 81C identifies a type of payload being borne by the joint message (in this embodiment, “00” corresponds to no payload other than the fixed identifying information for the transmitter itself, “01” corresponds to a supplemental data payload, and “10” corresponds to a supplemental data-only payload—further explanation regarding these payload types appears further below);
    • “Xx”—this bit pair 81D presents a frame identifier that can be used by a receiver to determine whether all required joint messages 80 have been received and which can also be used to facilitate proper reconstruction of the transmitted data;
    • “B3, B2, B1, B0”— these two bit pairs 81E comprise an inversion pattern recovery identifier and are selected from the bits that comprise the encrypted rolling code 74 described above;
    • “B7, B6, B5, B4”— these two bit pairs 81F comprise a bit order pattern recovery identifier and are also selected from the bits that comprise the encrypted rolling code 74 described above.


There are various ways by which these recover identifier values can be selected. Referring momentarily to FIG. 9, by one approach, eight bits from the encrypted roll group 74 are selected to form a corresponding roll sub-group 91. These might comprise, for example, the first or the last eight bits of the encrypted roll group 74 (in a forward or reversed order). These might also comprise, for example, any eight consecutive bits beginning with any pre-selected bit position (such as, to illustrate, the seventh bit, the 21st bit, and so forth). Other possibilities also exist. For example, only even position bits or odd position bits could serve in this regard. It would also be possible, for example, to use preselected bits as comprise one or more of the previously described roll group sub-groups such as roll group E 74A or roll group G 74C.


It would also be possible to vary the selection mechanism from, for example, joint message to joint message. By one simple approach in this regard, for example, the first eight bits of the encrypted roll group 74 could be used to form the roll sub-group 91 with the last eight bits of the encrypted roll group 74 being used in a similar fashion in an alternating manner.


The eight bits that comprise this roll sub-group 91 are then further parsed to form the two recovery indicators 81E and 81F mentioned above. Again, there are numerous ways by which one may use the bits that comprise the roll sub-group 91 to form these recovery indicators 81E and 81F. By one simple approach, for example, the bits as comprise the roll sub-group 91 can be used in their existing (or reversed) order to form roll group 181E and roll group 281F. Using this approach, for example, bit B3 of roll group 181E would comprise bit seven from the roll sub-group 91 with bit B2 then corresponding to bit six and so forth.


By another approach, if desired, every other bit can be applied in this manner. So configured, for example, bit B3 could comprise bit six from the roll sub-group 91, bit B2 could comprise bit four from the roll sub-group 91, and so forth. In such a case, bit B7 would then comprise bit seven from the roll sub-group 91, bit B6 would comprise bit five from the roll sub-group 91, and so forth.


Referring again to FIG. 8, in this embodiment, the “B7, B6, B5, B4” values from the corresponding recovery indicator are used in conjunction with one or more lookup tables to determine a data bit order pattern to use with respect to formatting the data as comprises the second portion 82 of the joint message 80. Similarly, the “B3, B2, B1, B0” values are used in conjunction with a lookup table to determine a data bit order pattern to also use with that second portion 82 of the joint message 80.


Before providing further elaboration regarding an illustrative example of such lookup tables and their use, it will be helpful to first note that, in this example, the data in the second portion 82 of the joint message comprises 10 bits from roll group F (or H) and 10 bits each from fixed group A (or C) and fixed group B (or D) for a total of 30 bits. These bits are organized into triplets (shown in FIG. 8 in the form “(F, B, A)” and “(H, D, C)” to indicate that each such triplet includes one bit from a roll group F or H and one bit each from the two fixed groups B and A or D and C.


Those skilled in the art will note that, in this illustrative example, bits from roll group E 74A and roll group G 74C are not present in the second portion 82 of the joint message 80. This is because, in this example, it is presumed that the contents of these two roll groups are used to form the recovery indicators that appear in the first portion 81 of the joint message 80. Other accommodations can of course be made in this regard. In general, however, these teachings will accommodate not including those encrypted rolling code bits that are used as recovery indicators in the second portion 82 of the joint message 80.


In the example shown, the order of the bits in each triplet is “F, B, A” (or “H, D, C” as appropriate). This order is neither arbitrary nor static. Instead, for this particular joint message 80, this order of the bits in each triplet is dictated by the values B7, B6, B5, B4 noted above. In this case, and referring now to FIG. 10, a lookup table 101 serves to correlate various values for these two bit pairs with corresponding data bit order patterns. In this example, presuming that the values of these four bits happens to be “0000,” the corresponding order of bits for each triplet is established as “F/H, B/D, A/C” and hence the ordering of the bits depicted in FIG. 8.


Those skilled in the art will note that this lookup table 101 provides no patterns that would correlate to two bit pairs having the value “11.” This is because, in this embodiment, “11” as a bit pair value comprises an illegal value and hence is not expected to occur. Accordingly there are no bit order patterns presented to correlate with such values as “11XX,” “XXII,” or “1111.” This creates 9 possible selections for the order of bits and the inversion value. The number of possible unique order of three bits leads to only six different bit order patterns. This degree of diversity should suffice for most if not all purposes.


The aforementioned B3, B2, B1, B0 values 81F are employed in a similar fashion with this lookup table 101 to identify a particular inversion pattern to be employed with the data triplets of the second portion 82 of the joint message 80. For example, when these bits are “0000,” this lookup table provides for no inversion of any of the bits in each triplet. On the other hand, when these bits are “1010,” each bit of each triplet is to be inverted. In this case, up to eight different inversion patterns are possible.


To illustrate further, when a given data triplet happens to have the values “110” and the inversion indicator has the values “0100,” the lookup table will return a data inversion pattern of “normal invert invert.” As a result, this particular data triplet will instead have the values “101” because the second and third values in each triplet are now to be inverted in value.


So configured, a first portion of a joint message is seen to include a recovery indicator that itself comprises a selected portion of an encrypted rolling code. A second portion of that joint message, in turn, contains data triplets having bits that are arranged in a particular order and that observe a particular inversion pattern as a function of that joint indicator. Accordingly, it will not be sufficient for an unauthorized party to simply glean, in some fashion, the basis of the rolling code itself. Instead, now, this unauthorized party must also now understand how a particular portion of that rolling code is used to modify the transmission of other portions of that rolling code in addition to fixed information as may also accompany the rolling code.


In many application settings it may be desirable to present more than one such joint message to present a complete transmission. For example, and referring now to FIG. 11, it may be desirable to use two (or more) such joint messages 80A and 80B in order to present the complete rolling code and the complete fixed content and was described above. In such a case, for example, the first joint message 80A can present and use a first roll sub-group 91 as defined above as a recovery identifier (which comprises, in this illustrative example, roll group E 74A) while the second joint message 80B presents and uses a second, different roll sub-group B 91 (which comprises, in this illustrative example, roll group G 74C) for this purpose. These recovery identifiers can be used as just described to control modification of their corresponding data. So configured, in this illustrative example, 10 bits of roll group F 74B, 10 bits of fixed group A 75A, and 10 bits of fixed group B 75B have their bits ordered and inverted as a function of the bits of roll group E 74A while 10 bits of roll group H 74D, 10 bits of fixed group C 75C, and 10 bits of fixed group D 75D are similarly ordered/inverted as a function of the bits of roll group G 74C.


If desired, these joint messages 80A and 80B can be sent in a concatenated manner. By another approach, however, these joint messages can be separated by at least a minimal amount of silence (achieved, for example, by not transmitting during this period of time). For example, 75 milliseconds or so of blank time can be used for this purpose. So configured, a receiver that receives a second joint message prior to this period of blank time expiring can conclude that one or both of the received messages is somehow in error and should be avoided.


As noted above, in some cases it may be useful to transmit an additional amount of data or information than that specifically provided above. For example, it may be useful to transmit additional data that represents a particular instruction, status information, or the like. Such additional information can be readily accommodated by the teachings set forth above. To illustrate, and referring now to FIG. 12, 32 bits of such additional data can be subdivided into four corresponding data groups I and J 122A and 122B and K and L 122C and 122D where each such data group has eight bits.


Referring now to FIG. 13, the second portion 82 of each joint message 80 can now comprise 54 bits. By one approach, this can comprise 8 bits for a repeated presentation of the same rolling code group E or G as comprises the recovery identifier, 10 bits each for rolling code group F or H, fixed group A or C, and fixed group B or D, as well as 8 bits each for data group I or K and data group J or L as are described above. These various bits are again combined into data triplets using a group selection pattern such as that illustrated in FIG. 13. And, once again, the recovery identifier comprised of the roll group presented in the first portion 81 of the joint message 80 is used to select from a lookup table(s) the particular bit order and inversion patterns to employ with respect to these data triplets. In this case, and referring now to FIG. 14, the lookup table 141 can include specific bit order patterns that apply in different ways depending upon whether the data triplet includes the supplemental data.


In some cases, it may be necessary or appropriate to transmit even a larger quantity of data than can be accommodated by the processes and techniques described above. In such a case, if desired, additional supplemental joint messages can be used to present such supplemental data. With reference to FIG. 15, 32 bit value data elements 151 can be parsed using an application defined algorithm 152 of choice as corresponds to the data itself (or as may be otherwise provided or selected) into four ternary bit pairs 153 and three data groups of N bits each 154A-154C.


Referring now to FIG. 16, the recovery indicator can be reused from a previous related joint message and the second portion 82 of the joint message 80 can contain 3 to the Nth power bits as necessary to accommodate the full data payload. The three data groups A-C are then used to form corresponding data triplets. And, as before, the recovery identifier is used to extract from a corresponding lookup table (such as the lookup table 171 presented in FIG. 17) the particular bit order pattern and bit inversion pattern to employ with respect to the transmission of these data triplets.


Those skilled in the art will appreciate that the above-described processes are readily enabled using any of a wide variety of available and/or readily configured platforms, including partially or wholly programmable platforms as are known in the art or dedicated purpose platforms as may be desired for some applications. Referring now to FIG. 18, an illustrative approach to such a platform will now be provided.


In this illustrative embodiment, the apparatus 180 (which may comprise, for example, a wireless remote control transmitter) comprises a processor 181 that couples to a transmitter 182 (such as a wireless transmitter) of choice. Both of these components then also operably couple to a first memory 183, a second memory 184, a first lookup table 185, and a second lookup table 186. The first memory 183 can have a fixed value stored therein. This fixed value can comprise, for example, information that substantially uniquely identifies this particular apparatus 180. This first memory 183 may also, if desired, have a plurality of different fixed values contained therein. This would permit storing, for example, remote control signals that are not specific (i.e., unique) to the apparatus 180 itself.


The second memory 184 can have the aforementioned encrypted rolling code stored therein. By one approach, the processor 181 is configured and arranged to calculate the encrypted rolling code when needed and to temporarily buffer that value in the second memory 184 pending actual use of that information. By another approach, the encrypted rolling code information can be pre-provisioned using a derivation and storage approach of choice.


The lookup tables 185 and 186 are the lookup tables described above. For example, the first lookup table 185 can comprise the lookup table that correlates a first plurality of different encrypted rolling code values with corresponding differing data bit order patterns. Similarly, the second lookup table 186 can comprise the lookup table that correlates a second plurality of different encrypted rolling code values with corresponding different data inversion patterns.


The processor 181 itself is configured and arranged (via, for example, appropriate programming) to carry out selected teachings as have been presented above. So configured, for example, the processor 181 can be configured and arranged to use the encrypted rolling code to select ones of the particular data bit order patterns and data inversion patterns for the transmitter 182 to use as transmission characteristics when transmitting the fixed value and at least portions of the encrypted rolling code. In particular, if desired, the processor can use a first part of the encrypted rolling code to select a data bit order pattern and a data inversion pattern to use when transmitting a first part of the encrypted rolling code and the fixed value and a second, different part of the encrypted rolling code to select a data bit order pattern and a data inversion pattern to use when transmitting a second, different part of the encrypted rolling code and the fixed value.


Those skilled in the art will recognize and understand that such an apparatus 180 may be comprised of a plurality of physically distinct elements as is suggested by the illustration shown in FIG. 18. It is also possible, however, to view this illustration as comprising a logical view, in which case one or more of these elements can be enabled and realized via a shared platform and/or a more-widely-distributed platform. It will also be understood that such a shared platform may comprise a wholly or at least partially programmable platform as are known in the art.


So configured, those skilled in the art will recognize and appreciate that these teachings offer great flexibility and opportunity with respect to further protecting information during a wireless transmission of that information. These teachings have particular relevance to transmissions of rolling codes and offer particular advantages when also used in conjunction with the transmission of fixed information in addition to rolling code information. The particular transmission characteristics presented are largely compatible for use with a wide variety of wireless modulation techniques. Those skilled in the art will also appreciate that these teachings are highly compatible for use with binary-based representations of ternary data formats.


Those skilled in the art will recognize that a wide variety of modifications, alterations, and combinations can be made with respect to the above described embodiments without departing from the spirit and scope of the invention, and that such modifications, alterations, and combinations are to be viewed as being within the ambit of the inventive concept.

Claims
  • 1. An apparatus comprising: a processor configured to use a rolling code to: select a particular data bit order pattern from a plurality of potential data hit order patterns; andselect a particular data inversion pattern from a plurality of potential data inversion patterns;the processor further configured to provide a message comprising (i) at least a part of the rolling code and a fixed code; anda transmitter operably coupled to the processor and configured to transmit the message using the particular data hit order pattern and the particular data inversion pattern as transmission characteristics.
  • 2. The apparatus of claim 1. wherein the apparatus comprises a wireless remote control transmitter.
  • 3. The apparatus claim 2, wherein the wireless remote control transmitter is configured to communicate the message; and wherein the message is received by a movable barrier operator.
  • 4. The apparatus of claim 3, wherein the message received by the movable barrier operator effects an action by the movable harrier operator.
  • 5. The apparatus of claim 1. wherein the fixed code comprises a first fixed code part and a second fixed code part and the rolling code comprises a first rolling code part, a second rolling code part, a third rolling code part, and a fourth rolling code part, and wherein the processor is further configured to: use the first rolling code part to select the particular data bit order pattern and the particular data inversion pattern to use for transmission of the third rolling code part and the first fixed code part; anduse the second rolling code part to select a second data hit order pattern and a second data inversion pattern to use for transmission of the fourth rolling code part and the second fixed code part.
  • 6. The apparatus of claim 1, wherein the fixed code comprises a substantially unique identifier for the apparatus.
  • 7. The apparatus of claim 5, wherein the fixed code comprises both a substantially unique identifier for the apparatus and a remote control signal that is not specific to the apparatus.
  • 8. The apparatus of claim 1, wherein the rolling code is an encrypted rolling code.
  • 9. The apparatus of claim 5, wherein the processor is further configured to; use the first rolling code part and a first lookup table to select the particular data bit order pattern; anduse the second rolling code part and a second lookup table to select the second data inversion pattern.
  • 10. The apparatus of claim 1. wherein the apparatus comprises a wireless remote control transmitter configured to communicate the message with a garage door opener, and wherein the message is configured to cause the garage door opener to change a position of a garage door associated with the garage door opener.
  • 11. The apparatus of claim 1, wherein the rolling code is an encrypted rolling code; and wherein the processor is configured to: provide ternary data as corresponds to a movable barrier operator; andconvert the ternary data to a binary format to provide binary information as at least a part of the encrypted rolling code.
  • 12. An apparatus composing: a receiver configured to receive a message from a transmitter; anda processor operably coupled to the receiver, the processor configured to recover, from the message, at least a portion of a rolling code, the message comprising a part thereof that was transmitted using a plurality of selected patterns of transmission characteristics selected based at least in part on the rolling code, wherein a first one of the plurality of selected patterns of transmission characteristics comprises a selected particular one of a plurality of differing data hit order patterns, and wherein a second one of the plurality of selected patterns of transmission characteristics comprises a selected particular one of a plurality of differing data inversion patterns.
  • 13. The apparatus of claim 12, wherein the message further comprises, at least in part, a representation of the plurality of selected patterns of transmission characteristics.
  • 14. The apparatus of claim 12, wherein the rolling code is an encrypted rolling code and wherein the message further comprises a fixed value.
  • 15. The apparatus of claim 12, wherein the message further comprises: a fixed portion including a first, fixed part and a second fixed part;and wherein the rolling code includes a first rolling code part, a second rolling code part, a third rolling code part, and a fourth rolling code part;wherein the first rolling code part was used by the transmitter to select a particular one of each of the plurality of differing data bit order patterns and the plurality of differing data inversion patterns to provide first selected patterns;wherein the second rolling code part was used by the transmitter to select a particular one of each of the plurality of differing data bit order patterns and the plurality of differing data inversion patterns to provide second selected patterns: andwherein the apparatus is further configured to use the first rolling code part and the second rolling code part as recovery identifiers to recover the first fixed part and the second fixed part and the third rolling code part and fourth rolling code part.
  • 16. The apparatus of claim 15, wherein the transmitter is a wireless remote control transmitter and wherein the apparatus is a movable barrier operator.
  • 17. The apparatus of claim 16, wherein the message is transmitted from the wireless remote control transmitter and received by the movable barrier operator to effect an action by the movable barrier operator to change a position of a moveable barrier.
  • 18. A non-transitory computer readable medium comprising instructions which, when executed by a processor of an apparatus, cause the processor to perform operations comprising: selecting, using a rolling code, a particular data bit order pattern from a plurality of potential data bit order patterns;selecting, using the rolling code, a particular data inversion pattern from a plurality of potential data inversion patterns; providing a message comprising (i) at least a pan of the rolling code and (ii) a fixed code; andcausing the particular data bit order pattern and the particular data inversion pattern to be used as transmission characteristics for transmitting the message.
  • 19. The non-transitory computer readable medium of claim 18, wherein the fixed code comprises a first fixed code part and a second fixed code part and the rolling code comprises a first rolling code part, a second rolling code part, a third rolling code part, and a fourth rolling code part, and wherein the operations further comprise: using the first rolling code part to select the particular data bit order pattern and the particular data inversion pattern to use for transmission of the third rolling code part of the rolling code and the first fixed code part; andusing the second rolling code part to select a second data bit order pattern and a second data inversion pattern to use for transmission of the fourth rolling code part and the second fixed code part.
  • 20. The non-transitory computer readable medium of claim 18, wherein the fixed code comprises a substantially unique identifier for the apparatus.
  • 21. The non-transitory computer readable medium of claim 18, wherein the message is provided to a movable barrier operator to effect an action by the movable barrier operator to change a position of a moveable barrier.
RELATED APPLICATIONS

This application is a continuation of U.S. application Ser. No. 13/777,787, filed Feb. 26, 2013; which is a continuation of U.S. application Ser. No. 11/501,455 filed Aug. 9, 2006, which issued as U.S. Pat. No. 8,422,667, on Apr. 16, 2013; which is a continuation in part of: U.S. application Ser. No. 11/480,288 filed on Jun. 30, 2006, which issued as U.S. Pat. No. 7,561,075, on Jul. 14, 2009, which is a continuation of U.S. application Ser. No. 11/044,411, filed on Jan. 27, 2005, issued as U.S. Pat. No. 7,071,850, on Jul. 4, 2006; andU.S. application Ser. No. 11/172,525, filed Jun. 30, 2005, which issued as U.S. Pat. No. 9,148,409, on Sep. 29, 2015; the contents of each of which are fully incorporated herein by this reference.

US Referenced Citations (400)
Number Name Date Kind
29525 Sherman Aug 1860 A
30957 Campbell Dec 1860 A
35364 Cox May 1862 A
2405500 Gustav Aug 1946 A
3716865 Willmott Feb 1973 A
3735106 Hollaway May 1973 A
3792446 Mcfiggins Feb 1974 A
3798359 Feistel Mar 1974 A
3798360 Feistel Mar 1974 A
3798544 Norman Mar 1974 A
3798605 Feistel Mar 1974 A
3845277 Spetz Oct 1974 A
3890601 Pietrolewicz Jun 1975 A
3906348 Willmott Sep 1975 A
3938091 Atalla Feb 1976 A
4037201 Willmott Jul 1977 A
4064404 Willmott Dec 1977 A
RE29525 Willmott Jan 1978 E
4078152 Tuckerman Mar 1978 A
4097859 Looschen Jun 1978 A
4138735 Allocca Feb 1979 A
4178549 Ledenbach Dec 1979 A
4195196 Feistel Mar 1980 A
4195200 Feistel Mar 1980 A
4196310 Forman Apr 1980 A
4218738 Matyas Aug 1980 A
4243976 Warner Jan 1981 A
4255742 Gable Mar 1981 A
4304962 Fracassi Dec 1981 A
4305060 Apple Dec 1981 A
4316055 Feistel Feb 1982 A
4326098 Bouricius Apr 1982 A
4327444 Court Apr 1982 A
4328414 Atalla May 1982 A
4328540 Matsuoka May 1982 A
RE30957 Feistel Jun 1982 E
4380762 Capasso Apr 1983 A
4385296 Tsubaki May 1983 A
4387455 Schwartz Jun 1983 A
4387460 Boutmy Jun 1983 A
4393269 Konheim Jul 1983 A
4418333 Schwarzbach Nov 1983 A
4426637 Apple Jan 1984 A
4445712 Smagala-Romanoff May 1984 A
4447890 Duwel May 1984 A
4454509 Buennagel Jun 1984 A
4464651 Duhame Aug 1984 A
4468787 Keiper Aug 1984 A
4471493 Schober Sep 1984 A
4471593 Ragland Sep 1984 A
4491774 Schmitz Jan 1985 A
4509093 Stellberger Apr 1985 A
4529980 Liotine Jul 1985 A
4535333 Twardowski Aug 1985 A
4566044 Langdon Jan 1986 A
4574247 Jacob Mar 1986 A
4578530 Zeidler Mar 1986 A
4580111 Swanson Apr 1986 A
4581606 Mallory Apr 1986 A
4590470 Koenig May 1986 A
4593155 Hawkins Jun 1986 A
4596898 Pemmaraju Jun 1986 A
4596985 Bongard Jun 1986 A
4599489 Cargile Jul 1986 A
4602357 Yang Jul 1986 A
4611198 Levinson Sep 1986 A
4623887 Welles Nov 1986 A
4626848 Ehlers Dec 1986 A
4628315 Douglas Dec 1986 A
4630035 Stahl Dec 1986 A
4633247 Hegeler Dec 1986 A
4638433 Schindler Jan 1987 A
4646080 Genest Feb 1987 A
4652860 Weishaupt Mar 1987 A
4653076 Jerrim Mar 1987 A
4670746 Taniguchi Jun 1987 A
4677284 Genest Jun 1987 A
4686529 Kleefeldt Aug 1987 A
4695839 Barbu Sep 1987 A
4703359 Rumbolt Oct 1987 A
4710613 Shigenaga Dec 1987 A
4716301 Willmott Dec 1987 A
4720860 Weiss Jan 1988 A
4723121 Van Feb 1988 A
4731575 Sloan Mar 1988 A
4737770 Brunius Apr 1988 A
4740792 Sagey Apr 1988 A
4750118 Heitschel Jun 1988 A
4754255 Sanders Jun 1988 A
4755792 Pezzolo Jul 1988 A
4758835 Rathmann Jul 1988 A
4761808 Howard Aug 1988 A
4779090 Micznik Oct 1988 A
4794268 Nakano Dec 1988 A
4794622 Isaacman Dec 1988 A
4796181 Wiedemer Jan 1989 A
4799061 Abraham Jan 1989 A
4800590 Vaughan Jan 1989 A
4802114 Sogame Jan 1989 A
4804938 Rouse Feb 1989 A
4807052 Amano Feb 1989 A
4808995 Clark Feb 1989 A
4825200 Evans Apr 1989 A
4825210 Bachhuber Apr 1989 A
4829296 Clark May 1989 A
4831509 Jones May 1989 A
4835407 Kataoka May 1989 A
4845491 Fascenda Jul 1989 A
4847614 Keller Jul 1989 A
4850046 Philippe Jul 1989 A
4855713 Brunius Aug 1989 A
4856062 Weiss Aug 1989 A
4856081 Smith Aug 1989 A
4859990 Isaacman Aug 1989 A
4870400 Downs Sep 1989 A
4878052 Schulze Oct 1989 A
4881148 Lambropoulos Nov 1989 A
4885778 Weiss Dec 1989 A
4888575 De Vaulx Dec 1989 A
4890108 Drori Dec 1989 A
4893338 Pastor Jan 1990 A
4905279 Nishio Feb 1990 A
4910750 Fisher Mar 1990 A
4912463 Li Mar 1990 A
4914696 Dudczak Apr 1990 A
4918690 Markkula Apr 1990 A
4922168 Waggamon May 1990 A
4922533 Philippe May 1990 A
4928098 Dannhaeuser May 1990 A
4931789 Pinnow Jun 1990 A
4939792 Urbish Jul 1990 A
4942393 Waraksa Jul 1990 A
4951029 Severson Aug 1990 A
4963876 Sanders Oct 1990 A
4979832 Ritter Dec 1990 A
4980913 Skret Dec 1990 A
4988990 Warrior Jan 1991 A
4988992 Heitschel Jan 1991 A
4992783 Zdunek Feb 1991 A
4999622 Amano Mar 1991 A
5001332 Schrenk Mar 1991 A
5021776 Anderson Jun 1991 A
5023908 Weiss Jun 1991 A
5049867 Stouffer Sep 1991 A
5055701 Takeuchi Oct 1991 A
5058161 Weiss Oct 1991 A
5060263 Bosen Oct 1991 A
5091942 Dent Feb 1992 A
5103221 Memmola Apr 1992 A
5107258 Soum Apr 1992 A
5126959 Kurihara Jun 1992 A
5136548 Claar Aug 1992 A
5144667 Pogue Sep 1992 A
5146067 Sloan Sep 1992 A
5148159 Clark Sep 1992 A
5150464 Sidhu Sep 1992 A
5153581 Hazard Oct 1992 A
5159329 Lindmayer Oct 1992 A
5168520 Weiss Dec 1992 A
5193210 Nicholas Mar 1993 A
5197061 Halbert-Lassalle Mar 1993 A
5224163 Gasser Jun 1993 A
5237614 Weiss Aug 1993 A
5252960 Duhame Oct 1993 A
5278907 Snyder Jan 1994 A
5280527 Gullman Jan 1994 A
5331325 Miller Jul 1994 A
5361062 Weiss Nov 1994 A
5363448 Koopman Nov 1994 A
5365225 Bachhuber Nov 1994 A
5367572 Weiss Nov 1994 A
5369706 Latka Nov 1994 A
5412379 Waraksa May 1995 A
5414418 Andros May 1995 A
5420925 Michaels May 1995 A
5442340 Dykema Aug 1995 A
5442341 Lambropoulos Aug 1995 A
5444737 Cripps Aug 1995 A
5463376 Stoffer Oct 1995 A
5471668 Soenen Nov 1995 A
5473318 Martel Dec 1995 A
5479512 Weiss Dec 1995 A
5485519 Weiss Jan 1996 A
5517187 Bruwer May 1996 A
5528621 Heiman Jun 1996 A
5530697 Watanabe Jun 1996 A
5554977 Jablonski Sep 1996 A
RE35364 Heitschel Oct 1996 E
5563600 Miyake Oct 1996 A
5565812 Soenen Oct 1996 A
5566359 Corrigan Oct 1996 A
5576701 Heitschel Nov 1996 A
5578999 Matsuzawa Nov 1996 A
5594429 Nakahara Jan 1997 A
5598475 Soenen Jan 1997 A
5600653 Chitre Feb 1997 A
5608723 Felsenstein Mar 1997 A
5635913 Willmott Jun 1997 A
5657388 Weiss Aug 1997 A
5673017 Dery Sep 1997 A
5678213 Myer Oct 1997 A
5680131 Utz Oct 1997 A
5686904 Bruwer Nov 1997 A
5699065 Murray Dec 1997 A
5719619 Hattori et al. Feb 1998 A
5745068 Takahashi Apr 1998 A
5774065 Mabuchi Jun 1998 A
5778348 Manduley Jul 1998 A
5838747 Matsumoto Nov 1998 A
5872519 Issa Feb 1999 A
5898397 Murray Apr 1999 A
5923758 Khamharn Jul 1999 A
5936999 Keskitalo Aug 1999 A
5937065 Simon Aug 1999 A
5942985 Chin Aug 1999 A
5949349 Farris Sep 1999 A
6012144 Pickett Jan 2000 A
6049289 Waggamon Apr 2000 A
6052408 Trompower Apr 2000 A
6070154 Tavor May 2000 A
6094575 Anderson et al. Jul 2000 A
6154544 Farris Nov 2000 A
6157719 Wasilewski Dec 2000 A
6166650 Bruwer Dec 2000 A
6175312 Bruwer Jan 2001 B1
6181255 Crimmins Jan 2001 B1
6243000 Tsui Jun 2001 B1
6275519 Hendrickson Aug 2001 B1
6414587 Fitzgibbon Jul 2002 B1
6414986 Usui Jul 2002 B1
6456726 Yu Sep 2002 B1
6463538 Elteto Oct 2002 B1
6496477 Perkins Dec 2002 B1
6535544 Partyka Mar 2003 B1
6549949 Bowman-Amuah Apr 2003 B1
6640244 Bowman-Amuah Oct 2003 B1
6688518 Valencia Feb 2004 B1
6690796 Farris Feb 2004 B1
6697379 Jacquet Feb 2004 B1
6754266 Bahl Jun 2004 B2
6810123 Farris Oct 2004 B2
6829357 Alrabady Dec 2004 B1
6850910 Yu Feb 2005 B1
6930983 Perkins Aug 2005 B2
6956460 Tsui Oct 2005 B2
6963561 Lahat Nov 2005 B1
6980518 Sun Dec 2005 B1
6980655 Farris Dec 2005 B2
6988977 Gregori Feb 2006 B2
6998977 Gregori Feb 2006 B2
7002490 Lablans Feb 2006 B2
7039397 Chuey May 2006 B2
7039809 Wankmueller May 2006 B1
7042363 Katrak May 2006 B2
7050479 Kim May 2006 B1
7050794 Chuey et al. May 2006 B2
7057494 Fitzgibbon Jun 2006 B2
7057547 Olmsted Jun 2006 B2
7068181 Chuey Jun 2006 B2
7071850 Fitzgibbon Jul 2006 B1
7088218 Chuey Aug 2006 B2
7088706 Zhang et al. Aug 2006 B2
7139398 Candelore Nov 2006 B2
7161466 Chuey Jan 2007 B2
7298721 Atarashi et al. Nov 2007 B2
7301900 Laksono Nov 2007 B1
7332999 Fitzgibbon Feb 2008 B2
7333615 Jarboe Feb 2008 B1
7336787 Unger Feb 2008 B2
7346163 Pedlow Mar 2008 B2
7353499 De Jong Apr 2008 B2
7406553 Edirisooriya et al. Jul 2008 B2
7412056 Farris Aug 2008 B2
7415618 De Jong Aug 2008 B2
7429898 Akiyama Sep 2008 B2
7447498 Chuey et al. Nov 2008 B2
7489922 Chuey Feb 2009 B2
7492898 Farris et al. Feb 2009 B2
7492905 Fitzgibbon Feb 2009 B2
7516325 Willey Apr 2009 B2
7535926 Deshpande May 2009 B1
7545942 Cohen et al. Jun 2009 B2
7548153 Gravelle et al. Jun 2009 B2
7561075 Fitzgibbon Jul 2009 B2
7564827 Das et al. Jul 2009 B2
7598855 Scalisi et al. Oct 2009 B2
7623663 Farris Nov 2009 B2
7668125 Kadous Feb 2010 B2
7741951 Fitzgibbon Jun 2010 B2
7742501 Williams Jun 2010 B2
7757021 Wenzel Jul 2010 B2
7764613 Miyake et al. Jul 2010 B2
7786843 Witkowski Aug 2010 B2
7812739 Chuey Oct 2010 B2
7839851 Kozat Nov 2010 B2
7855633 Chuey Dec 2010 B2
7999656 Fisher Aug 2011 B2
8014377 Zhang et al. Sep 2011 B2
8130079 Mcquaide, Jr. et al. Mar 2012 B2
8194856 Farris Jun 2012 B2
8207818 Keller, Jr. Jun 2012 B2
8209550 Gehrmann Jun 2012 B2
8225094 Willey Jul 2012 B2
8233625 Farris Jul 2012 B2
8266442 Burke Sep 2012 B2
8276185 Messina et al. Sep 2012 B2
8284021 Farris et al. Oct 2012 B2
8290465 Ryu et al. Oct 2012 B2
8416054 Fitzgibbon Apr 2013 B2
8422667 Fitzgibbon Apr 2013 B2
8452267 Friman May 2013 B2
8463540 Hannah et al. Jun 2013 B2
8536977 Fitzgibbon Sep 2013 B2
8544523 Mays Oct 2013 B2
8581695 Carlson et al. Nov 2013 B2
8615562 Huang et al. Dec 2013 B1
8633797 Farris et al. Jan 2014 B2
8634777 Ekbatani et al. Jan 2014 B2
8645708 Labaton Feb 2014 B2
8661256 Willey Feb 2014 B2
8699704 Liu et al. Apr 2014 B2
8760267 Bos et al. Jun 2014 B2
8787823 Justice et al. Jul 2014 B2
8830925 Kim et al. Sep 2014 B2
8836469 Fitzgibbon et al. Sep 2014 B2
9082293 Wellman et al. Jul 2015 B2
9124424 Aldis Sep 2015 B2
9142064 Muetzel et al. Sep 2015 B2
9148409 Fitzgibbon Sep 2015 B2
9160408 Krohne et al. Oct 2015 B2
9280704 Lei et al. Mar 2016 B2
9317983 Ricci Apr 2016 B2
9336637 Neil et al. May 2016 B2
9396376 Narayanaswami Jul 2016 B1
9413453 Sugitani et al. Aug 2016 B2
9418326 Narayanaswami Aug 2016 B1
10862924 Fitzgibbon Dec 2020 B2
RE48433 Fitzgibbon Feb 2021 E
10944559 Fitzgibbon Mar 2021 B2
20010023483 Kiyomoto Sep 2001 A1
20020034303 Farris Mar 2002 A1
20020184504 Hughes Dec 2002 A1
20020191785 Mcbrearty Dec 2002 A1
20020191794 Farris Dec 2002 A1
20030056001 Mate Mar 2003 A1
20030070092 Hawkes Apr 2003 A1
20030072445 Kuhlman Apr 2003 A1
20030147536 Andivahis Aug 2003 A1
20030177237 Stebbings Sep 2003 A1
20030191949 Odagawa Oct 2003 A1
20030227370 Brookbank Dec 2003 A1
20040019783 Hawkes Jan 2004 A1
20040081075 Tsukakoshi Apr 2004 A1
20040174856 Brouet Sep 2004 A1
20040179485 Terrier Sep 2004 A1
20040181569 Attar Sep 2004 A1
20050053022 Zettwoch Mar 2005 A1
20050058153 Santhoff Mar 2005 A1
20050101314 Levi May 2005 A1
20050174242 Cohen Aug 2005 A1
20050285719 Stephens Dec 2005 A1
20060083187 Dekel Apr 2006 A1
20060109978 Farris May 2006 A1
20060176171 Fitzgibbon Aug 2006 A1
20070005806 Fitzgibbon Jan 2007 A1
20070006319 Fitzgibbon Jan 2007 A1
20070018861 Fitzgibbon Jan 2007 A1
20070058811 Fitzgibbon Mar 2007 A1
20070245147 Okeya Oct 2007 A1
20080229400 Burke Sep 2008 A1
20080297370 Farris Dec 2008 A1
20090016530 Farris Jan 2009 A1
20090021348 Farris Jan 2009 A1
20090096621 Ferlitsch Apr 2009 A1
20090176451 Yang et al. Jul 2009 A1
20090315672 Nantz et al. Dec 2009 A1
20100060413 Fitzgibbon et al. Mar 2010 A1
20100112979 Chen et al. May 2010 A1
20100125509 Kranzley et al. May 2010 A1
20100125516 Wankmueller et al. May 2010 A1
20100199092 Andrus et al. Aug 2010 A1
20100211779 Sundaram Aug 2010 A1
20110051927 Murray et al. Mar 2011 A1
20110296185 Kamarthy et al. Dec 2011 A1
20110316668 Laird Dec 2011 A1
20110316688 Ranjan Dec 2011 A1
20110317835 Laird Dec 2011 A1
20110320803 Hampel et al. Dec 2011 A1
20120054493 Bradley Mar 2012 A1
20120297681 Krupke et al. Nov 2012 A1
20130170639 Fitzgibbon Jul 2013 A1
20130268333 Ovick et al. Oct 2013 A1
20130272520 Noda et al. Oct 2013 A1
20140169247 Jafarian et al. Jun 2014 A1
20140289528 Baghdasaryan Sep 2014 A1
20150222517 Mclaughlin et al. Aug 2015 A1
20150358814 Roberts Dec 2015 A1
20160021140 Fitzgibbon Jan 2016 A1
20160198391 Orthmann et al. Jul 2016 A1
20160261572 Liu et al. Sep 2016 A1
Foreign Referenced Citations (91)
Number Date Country
645228 Feb 1992 AU
710682 Nov 1996 AU
2006200340 Aug 2006 AU
2007203558 Feb 2008 AU
2008202369 Jan 2009 AU
2011202656 Jan 2012 AU
2011218848 Sep 2012 AU
2087722 Jul 1998 CA
2193846 Feb 2004 CA
2177410 Apr 2008 CA
2443452 Jul 2008 CA
2684658 Oct 2008 CA
2708000 Dec 2010 CA
2456680 Feb 2011 CA
2742018 Dec 2011 CA
2565505 Sep 2012 CA
2631076 Sep 2013 CA
2790940 Jun 2014 CA
2596188 Jul 2016 CA
101399825 Apr 2009 CN
3234538 Mar 1984 DE
3234539 Mar 1984 DE
3244049 Sep 1984 DE
3309802 Sep 1984 DE
3309802 Sep 1984 DE
3320721 Dec 1984 DE
3332721 Mar 1985 DE
3407436 Aug 1985 DE
3407469 Sep 1985 DE
3532156 Mar 1987 DE
3636822 Oct 1987 DE
4204463 Aug 1992 DE
0043270 Jan 1982 EP
0103790 Mar 1984 EP
0154019 Sep 1985 EP
0155378 Sep 1985 EP
0244322 Nov 1987 EP
0244332 Nov 1987 EP
0311112 Apr 1989 EP
0335912 Oct 1989 EP
0372285 Jun 1990 EP
0265935 May 1991 EP
0459781 Dec 1991 EP
0857842 Aug 1998 EP
0937845 Aug 1999 EP
1024626 Aug 2000 EP
1223700 Jul 2002 EP
1313260 May 2003 EP
1421728 May 2004 EP
1625560 Feb 2006 EP
1760985 Mar 2007 EP
0771498 May 2007 EP
1865656 Dec 2007 EP
2293478 Mar 2011 EP
2149103 Dec 2011 EP
2437212 Apr 2012 EP
1875333 Jan 2013 EP
2290872 Jun 2014 EP
2800403 Nov 2014 EP
2606232 May 1988 FR
2607544 Jun 1988 FR
2685520 Jun 1993 FR
2737373 Jan 1997 FR
218774 Jul 1924 GB
1156279 Jun 1969 GB
2023899 Jan 1980 GB
2051442 Jan 1981 GB
2099195 Dec 1982 GB
2118614 Nov 1983 GB
2131992 Jun 1984 GB
2133073 Jul 1984 GB
2184774 Jul 1987 GB
2254461 Oct 1992 GB
2265482 Sep 1993 GB
2288261 Oct 1995 GB
2430115 Mar 2007 GB
2440816 Feb 2008 GB
2453383 Apr 2009 GB
H6205474 Jul 1994 JP
09322274 Dec 1997 JP
9300137 Jan 1993 WO
9301140 Jan 1993 WO
9320538 Oct 1993 WO
9400147 Jan 1994 WO
9411829 May 1994 WO
9418036 Aug 1994 WO
0010301 Feb 2000 WO
0010302 Feb 2000 WO
03010656 Feb 2003 WO
03079607 Sep 2003 WO
8908225 Oct 1991 ZA
Non-Patent Literature Citations (226)
Entry
‘Access Transmitters-Access Security System’, pp. 1-2, Dated Jul. 16, 1997. http://www.webercreations.com/access/security.html.
Abrams, and Podell, ‘Tutorial Computer and Network Security,’ District of Columbia: IEEE, 1987. pp. 1075-1081.
Abramson, Norman. ‘The Aloha System-Another alternative for computer communications,’ pp. 281-285, University of Hawaii, 1970.
Adams, Russ, Classified, data-scrambling program for Apple II, Info-World, vol. 5, No. 3; Jan. 31, 1988.
Alexi, Werner, et al. ‘RSA and Rabin Functions: Certain Parts Are as Hard as the Whole’, pp. 194-209, Siam Computing, vol. 14, No. 2, Apr. 1988.
Allianz: Allianz-Zentrum for Technik GmbH-Detailed Requirements for Fulfilling the Specification Profile for Electronically Coded OEM Immobilizers, Issue 22, (Jun. 1994 (Translation Jul. 5, 1994).
Anderson, Ross. ‘Searching for the Optium Correlation Attack’, pp. 137-143, Computer Laboratory, Pembroke Street, Cambridge CB2 3QG, Copyright 1995.
Arazi, Benjamin, Vehicular Implementations of Public Key Cryptographic Techniques, IEEE Transactions on Vehicular Technology, vol. 40, No. 3, Aug. 1991, 646-653.
Australian Examiners First Report on Patent Application No. 2006202850 dated Feb. 25, 2010.
Australian Patent Application No. 2017265017; First Examination Report dated Oct. 8, 2018; 4 pages.
Baran, P. Distribution Communications, vol. 9, ‘Security Secrecy and Tamper-free Communications’, Rand Corporation, 1964.
Barbaroux, Paul. ‘Uniform Results in. Polynomial-Time Security’, pp. 297-306, Advances in Cryptology-Eurocrypt 92, 1992.
Barlow, Mike, ‘A Mathematical Word Block Cipher,’ 12 Cryptologia 256-264 (1988).
Bellovin, S.M. ‘Security Problems in the TCPIIP Protocol Suite’, pp. 32-49, Computer Communication Review, New Jersey, Reprinted from Computer Communication Review, vol. 19, No. 2, pp. 32-48, Apr. 1989.
Beutelspacher, Albrecht. Advances in Cryptology—Eurocrypt 87: ‘Perfect and Essentially Perfect Authentication Schemes’ (Extended Abstract), pp. 167-170, Federal Republic of Germany, believed to be publicly available prior to Jun. 30, 2004.
Bloch, Gilbert. Enigma Before Ultra Polish Work and the French Contribution, pp. 142-155, Cryptologia 11(3), (Jul. 1987).
Bosworth, Bruce, ‘Codes, Ciphers, and Computers: An Introduction to Information Security’ Hayden Book Company, Inc. 1982, pp. 30-54.
Brickell, Ernest F. and Stinson, Doug. ‘Authentication Codes With Multiple Arbiters’, pp. 51-55, Proceedings of Eurocrypt 88, 1988.
British Application No. GB1110709.1; Combined Search and Examination Report Under Sections 17 and 18(3); dated Sep. 29, 2011.
British Combined Search and Examination Report Under Sections 17 and 18(3); British Patent Application No. GB1000541.1; dated Jan. 28, 2010.
British Combined Search and Examination Report Under Sections 17 and 18(3); British Patent Application No. GB1104752.9; dated Apr. 11, 2011.
British Examination Report Under Section 17(5); British Application No. GB0715089.9 dated Nov. 28, 2007.
British Examination Report Under Section 18(3); British Patent Application No. GB0601795.8; dated Apr. 22, 2009.
British Examination Report Under Section 18(3); British Patent Application No. GB0613068.6; dated Nov. 26, 2010.
British Examination Report Under Section 18(3); British Patent Application No. GB0613068.6; dated May 6, 2010.
British Patent Application No. GB1110710.9; Combined Search and Examination Report Under Sections 17 and 18(3); Search dated Sep. 30, 2011.
British Search Report Under Section 17; British Patent Application No. GB0601795.8; Search dated May 22, 2006.
British Search Report Under Section 17; British Patent Application No. GB0613068.6; Search dated Aug. 23, 2006.
British Search Report Under Section 17; British Patent Application No. GB0715089.9; Search dated May 9, 2008.
British Search Report Under Section 17(5); British Patent Application No. GB0613068.6; Search dated Oct. 12, 2006.
British Search Report Under Section 18(3); British Patent Application No. GB0613068.6; dated Oct. 12, 2006.
Bruwer, Frederick J. ‘Die Toepassing Van Gekombineerde Konvolusiekodering en Modulasie op HF-Datakommunikasie,’ District of Pretoria in South Africa Jul. 1998.
Burger, Chris R., Secure Learning RKE Systems Using KeeLoq.RTM. Encoders, TB001, 1996 Microchip Technology, Inc., 1-7.
Burmeister, Mike. A Remark on the Effiency of Identification Schemes, pp. 493-495, Advances in Cryptology-Eurocrypt 90, (1990).
Canadian Patent Application No. 2,551,295; Office Action dated May 6, 2013.
Canadian Patent Application No. 2,926,281, Canadian Office Action dated Dec. 27, 2017.
Canadian Patent Application No. 2,926,281, Canadian Office Action dated Dec. 29, 2016.
Canadian Patent Application No. 2,926,281, Canadian Office Action dated Nov. 19, 2018.
Canadian Patent Application No. 3,074,762, Canadian Office Action dated May 10, 2021.
Cattermole, K.W., ‘Principles of Pulse Code Modulation’ Iliffe Books Ltd., 1969, pp. 30-381.
Cerf, Vinton a ‘Issues in Packet-Network Interconnection’, pp. 1386-1408, Proceedings of the IEEE, 66(11), Nov. 1978.
Cerf, Vinton G. and Kahn, Robert E. ‘A Protocol for Packet Network Intercommunication’, pp. 637-648, Transactions on Communications, vol. Com-22, No. 5, May 1974.
Charles Watts, How to Program the HiSec(TM) Remote Keyless Entry Rolling Code Generator, National Semiconductor, Oct. 1994, 1-4.
Combined Search and Examination Reports Under Sections 17 and 18(3); British Patent Application No. GB0920612.9; Search dated Dec. 16, 2009.
Computer Arithmetic by Henry Jacobowitz; Library of Congress Catalog Card No. 62-13396; Copyright Mar. 1962 by John F. Rider Publisher, Inc.
Conner, Doug, Cryptographic Techniques—Secure Your Wireless Designs, EDN (Design Feature), Jan. 18, 1996, 57-68.
Coppersmith, Don. ‘Fast Evalution of Logarithms in Fields of Characteristic Two’, IT-30(4): pp. 587-594, IEEE Transactions on Information Theory, Jul. 1984.
Daniels, George, ‘Pushbutton Controls for Garage Doors’ Popular Science (Aug. 1959), pp. 156-160.
Davies, D.W. and Price, W.C. ‘Security for Computer Networks,’ John Wiley and Sons, 1984. Chapter 7, pp. 175-176.
Davies, Donald W., ‘Tutorial: The Security of Data in Networks,’ pp. 13-17, New York: IEEE, 1981.
Davis, Ben and De Long, Ron. Combined Remote Key Conrol and Immobilization System for Vehicle Security, pp. 125-132, Power Electronics in Transportation, IEEE Catalogue No. 96TH8184, (Oct. 24, 1996).
Davis, Gregory and Palmer, Morris. Self-Programming, Rolling-Code Technology Creates Nearly Unbreakable RF Security, Technological Horizons, Texas Instruments, Inc. (ECN), (Oct. 1996).
Deavours, C. A. and Reeds, James. The Enigma, Part 1, Historical Perspectives, pp. 381-391, Cryptologia, 1(4), (Oct. 1977).
Deavours, C.A. and Kruh, L. ‘The Swedish HC-9 Ciphering Machine’, 251-285, Cryptologia, 13(3): Jul. 1989.
Deavours, Cipher A., et al. ‘Analysis of the Hebern cryptograph Using Isomorphs’, pp. 246-261, Cryptology: Yesterday, Today and Tomorrow, vol. 1, No. 2, Apr. 1977.
Denning, Dorothy E. ‘Cryptographic Techniques’, pp. 135-154, Cryptography and Data Security, 1982. Chapter 3.
Denning, Dorothy E. A Lattice Model of Secure Information Flow, pp. 236-238, 240, 242, Communications of the ACM, vol. 19, No. 5, (May 1976).
Diffie and Hellman, Exhaustive Cryptanalysis of the NB.S Data Encryption Standard, pp. 74-84, Computer, Jun. 1977.
Diffie, Whitfield and Hellman, Martin E. New Directions in Cryptography, pp. 644-654, IEEE Transactions on Information Theory, vol. IT-22, No. 6, (Nov. 1976).
Diffie, Whitfield and Hellman, Marfin E. Privacy and Authentication: An Introduction to Cryptography, pp. 397-427, Proceedings of the IEEE, vol. 67, No. 3 (Mar. 1979).
Diffie, Whitfield and Hellman, Martin, E. ‘An RSA Laboratories Technical Note’, Version 1.4, Revised Nov. 1, 1993.
Dijkstra, E. W. Co-Operating Sequential Processses, pp. 43-112, Programming Languages, F. Genuys. NY, believed to be publicly available prior to Jun. 30, 2004.
Dijkstra, E.W. ‘Hierarchical Ordering of Sequential Processes’, pp. 115-138, Acta Informatica 1: 115-138, Springer-Verlag (1971).
Documents Having Confidential Information Cited by Third Party as Relevant to the Subject Matter (Obtained from Notice Pursuant to 35 U.S.C. .sctn.282, Mar. 4, 2011(NPL22)).
ElGamal, Taher. A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms, pp. 469-472, IEEE, Transactions on Information Theory, vol. IT-31, No. 4, (Jul. 1985).
ElGamal, Taher. A Subexponential Time Algorithm for Computing Discrete Logarithms, pp. 473-481, IEEE, Transactions on Information Theory, vol. IT-31, No. 4, (Jul. 1985).
Examination Report Under Section 18(3) for GB0502236.3 dated May 23, 2005.
Examination Report Under Section 18(3) From British Patent Application No. GB0601795.8; Search dated Jan. 28, 2010.
Examination Report Under Section 18(3) From British Patent Application No. GB0601795.8; Search dated Sep. 25, 2009.
Examination Report Under Section 18(3) From British Patent Application No. GB0613068.6; Search dated Jan. 31, 2011.
Examination Report Under Section 18(3) from British Patent Application No. GB0715089.9 dated Apr. 11, 2011.
Examination Report Under Section 18(3) From British Patent Application No. GB0715089.9; Search dated Sep. 30, 2010.
Examination Report Under Section 18(3) From British Patent Application No. GB0920612.9; Search dated Jan. 28, 2010.
Feistel, Horst, Notz, Wm. A. and Smith, J. Lynn. Some Cryptographic Techniques for Machine-to-Machine Data Communications, pp. 1545-1554, Proceedings of the IEEE, vol. 63, No. 11, (Nov. 1975).
Feistel, Horst. ‘Cryptography and Computer Privacy’, pp. 15-23, Scientific American, vol. 228, No. 5, May 1973.
Fenzl, H. and Kliner, A. Electronic Lock System: Convenient and Safe, pp. 150-153, Siemens Components XXI, No. 4, (1987).
First Examination Report, from Australian Application No. 2019240615, dated Aug. 13, 2020; 4 pages.
Fischer, Elliot. Uncaging the Hagelin Cryptograph, pp. 89-92, Cryptologia, vol. 7, No. 1, (Jan. 1983).
Fragano, Maurizio. Solid State Key/Lock Security System, pp. 604-607, IEEE Transactions on Consumer Electronics, vol. CE-30, No. 4, (Nov. 1984).
G. Davis, Marcstar.TM. TRC1300 and TRC1315 Remote Control Transmitter/Receiver, Texas Instruments, Sep. 12, 1994. 1-24.
German Patent Application No. 10 2006 003 808.3; Official Action dated May 16, 2018; 6 pages.
German Patent Application No. 10 2006 003 808.8; Official Action dated Feb. 14, 2019 (with translation of relevant parts); 6 pages.
German Patent Application No. 10 2006 003 808.8; Official Action dated Oct. 9, 2018 (with translation of relevant parts); 7 pages.
German Patent Application No. 10 2006 063 085.8; Official Action dated Nov. 7, 2019 (with translation of relevant parts); 14 pages.
German Patent Application No. 10 2007 036 647.9; Official Communication dated Jul. 4, 2019, 4 pages.
Godlewski, Ph. and Camion P. ‘Manipulations and Errors, Delection and Localization,’ pp. 97-106, Proceedings of Eurocrypt 88, 1988.
Gordon, Professor J., Police Scientific Development Branch, Designing Codes for Vehicle Remote Security Systems, (Oct. 1994), pp. 1-20.
Gordon, Professor J., Police Scientific Development Branch, Designing Rolling Codes for Vehicle Remote Security Systems, (Aug. 1993), pp. 1-19.
Greenlee, B.M., Requirements for Key Management Protocols in the Wholesale Financial Services Industry, pp. 22 28, IEEE Communications Magazine , Sep. 1985.
Guillou, Louis C. and Quisquater, Jean-Jacques. ‘A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory’, pp. 123-128, Advances in Cryptology-Eurocrypt 88, 1988.
Guillou, Louis C. Smart Cards and Conditional Access, pp. 481-489, Proceedings of Eurocrypt, (1984).
Habermann, A. Nico, Synchronization of Communicating Processes, pp. 171 176, Communications, Mar. 1972.
Hagelin C-35/C-36 (The), (1 page) Sep. 3, 1998. http://hem.passagen.se/tan01/C035.HTML.
Haykin, Simon, “An Introduction to Analog and Digital Communications” 213, 215 (1989).
IEEE 100; The Authoritative Dictionary of IEEE Standards Terms, Seventh Ediciton, Published by Standards Information Network, IEEE Press, Copyright 2000.
International Search Report for PCT/US03/25308 dated Mar. 25, 2004.
ISO 8732: 1988(E): Banking Key Management (Wholesale) Annex D: Windows and Windows Management, Nov. 1988.
ITC Tutorial; Investigation No. 337-TA-417; (TCG024374-24434); Dated: Jul. 7, 1999.
Jones, Anita K. Protection Mechanisms and the Enforcement of Security Policies, pp. 228-251, Carnegie-Mellon University, Pittsburgh, PA, (1978).
Jueneman, R.R. et al. ‘Message Authentication’, pp. 29-40, IEEE Communications Magazine, vol. 23, No. 9, Sep. 1985.
Kahn, Robert E. The Organization of Computer Resources Into a Packet Radio Network, pp. 177-186, National Computer Conference, (1975).
Keeloq.RTM. Code Hopping Decoder, HCS500, 1997 Microchip Technology, Inc., 1-25.
Keeloq.RTM. Code Hopping Encoder, HCS300, 1996 Microchip Technology, Inc., 1-20.
Keeloq.RTM. NTQ 105 Code Hopping Encoder, pp. 1-8, Nanoteq (Pty.) Ltd., (Jul. 1993).
Keeloq.RTM. NTQ 125D Code Hopping Decoder, pp. 1-9, Nanoteq (pty.) Ltd., (Jul. 1993).
Kent, Stephen T. A Comparison of Some Aspects of Public-Key and Conventional Cryptosystems, pp. 4.3.1-5, ICC '79 Int. Conf. on Communications, Boston, MA, (Jun. 1979).
Kent, Stephen T. Comments on ‘Security Problems in the TCP/IP Protocol Suite’, pp. 10-19, Computer Communication Review, vol. 19, Part 3, (Jul. 1989).
Kent, Stephen T. Encryption-Based Protection Protocols for Interactive User-Computer Communication, pp. 1-121, (May 1976). (See pp. 50-53).
Kent, Stephen T. Protocol Design Consideration for Network Security, pp. 239-259, Proc. NATO Advanced Study Institute on Interlinking of Computer Networks, (1979).
Kent, Stephen T. Security Requirements and Protocols for a Broadcast Scenario, pp. 778-786, IEEE Transactions on Communications, vol. com-29, No. 6, (Jun. 1981).
Kent, Stephen T., et al. Personal Authorization System for Access Control to the Defense Data Network, pp. 89-93, Conf. Record of Eascon 82 15.sup.th Ann Electronics & Aerospace Systems Conf., Washington, D.C. (Sep. 1982).
Konheim, A.G. Cryptography: A Primer, pp. 285-347, New York, (John Wiley, 1981).
Koren, Israel, “Computer Arithmetic Algorithms” Prentice Hall, 1978, pp. 1-15.
Kruh, Louis. Device anc Machines: The Hagelin Cryptographer, Type C-52, pp. 78-82, Cryptologia, vol. 3, No. 2, (Apr. 1979).
Kruh, Louis. How to Use the German Enigma Cipher Machine: A photographic Essay, pp. 291-296, Cryptologia, vol. No. 7, No. 4 (Oct. 1983).
Kuhn, G.J., et al. A Versatile High-Speed Encryption Chip, INFOSEC '90 SYMPOSIUM, Pretoria, (Mar. 16, 1990).
Kuhn. G.J. Algorithms for Self-Synchronizing Ciphers, pp. 159-164, Comsig 88, University of Pretoria, Pretoria, (1988).
Lamport, Leslie. The Synchronization of Independent Processes, pp. 15-34, Acta Informatica, vol. 7, (1976).
Lear Corporation's Memorandum of Law in Support of Its Motion for Summary Judgment; May 22, 2008.
Linn, John and Kent, Stephen T. Electronic Mail Privacy Enhancement, pp. 40-43, American Institute of Aeronautics and Astronautics, Inc. (1986).
Lloyd, Sheelagh. Counting Functions Satisfying a Higher Order Strict Avalanche Criterion, pp. 63-74, (1990).
Marneweck, Kobus. Guidelines for KeeLoq.RTM. Secure Learning Implementation, TB007, pp. 1-5, 1987 Microchip Technology, Inc.
Massey, James L. The Difficulty with Difficulty, pp. 1-4, Jul. 17, 1996. http://www.iacr.org/conferences/ec96/massey/html/framemassey.html.
McIvor, Robert. Smart Cards, pp. 152-159, Scientific American, vol. 253, No. 5, (Nov. 1985).
Meier, Willi. Fast Correlations Attacks on Stream Ciphers (Extended Abstract), pp. 301-314, Eurocrypt 88, IEEE, (1988).
Meyer, Carl H. and Matyas Stephen H. Cryptography: A New Dimension in Computer Data Security, pp. 237-249 (1982).
Michener, J.R. The ‘Generalized Rotor’ Cryptographic Operator and Some of Its Applications, pp. 97-113, Cryptologia, vol. 9, No. 2, (Apr. 1985).
Microchip Technology, Inc., Enhanced Flash Microcontrollers with 10-Bit A/D and nano Watt Technology, PIC18F2525/2620/4525/4620 Data Sheet, 28/40/44-Pin, .COPYRGT.2008.
Microchip v. The Chamberlain Group, Inc., (TCG019794-019873); Deposition of J. Fitzgibbon; Partially redacted; Dated: Jan. 7, 1999.
Microchip v. The Chamberlain Group, Inc., (TCG019874-019918); Deposition of J. Fitzgibbon; Dated: Mar. 16, 1999.
Microchip v. The Chamberlain Group, Inc., Civil Action No. 98-C-6138; (TCG024334-24357); Declaration of V. Thomas Rhyne; Dated: Feb. 22, 1999.
MM57HS01 HiSeC.TM. Fixed and Rolling Code Decoder, National Semiconductor, Nov. 11, 1994, 1-8.
Morris, Robert. The Hagelin Cipher Machine (M-209): Reconstruction of the Internal Settings, pp. 267-289, Cryptologia, 2(3), (Jul. 1978).
Newman, David B., Jr., et al. ‘Public Key Management for Network Security’, pp. 11-16, IEE Network Magazine, 1987.
Nickels, Hamilton, ‘Secrets of Making and Breading Codes’ Paladin Press, 1990, pp. 11-29.
Niederreiter, Harald. Keystream Sequences with a Good Linear Complexity Profile for Every Starting Point, pp. 523-532, Proceedings of Eurocrypt 89, (1989).
NM95HSO1/NM95HSO2 HiSeC.TM. (High Security Code) Generator, pp. 1-19, National Semiconductor, (Jan. 1995).
Otway, Dave and Rees, Owen. Efficient and timely mutual authentication, ACM SIGOPS Operating Systems Review, vol. 21, Issue 1, Jan. 8-10, 1987.
Peebles, Jr., Peyton Z. and Giuma, Tayeb A.; “Principles of Electrical Engineering” McGraw Hill, Inc., 1991, pp. 562-597.
Peyret, Patrice, et al. Smart Cards Provide Very High Security and Flexibility in Subscribers Management, pp. 744-752, IEE Transactions on Consumer Electronics, 36(3), (Aug. 1990).
Postel, J. ed. ‘DOD Standard Transmission Control Protocol’, pp. 52-133, Jan. 1980.
Postel, Jonathon B., et al. The ARPA Internet Protocol, pp. 261-271, (1981).
Reed, David P. and Kanodia, Rajendra K. Synchronization with Eventcounts and Sequencers, pp. 115-123, Communications of the ACM, vol. 22, No. 2, (Feb. 1979).
Reynolds, J. and Postel, J. Official ARPA-Internet Protocols, Network Working Groups, (Apr. 1985).
Roden, Martin S., “Analog and Digital Communication Systems,” Third Edition, Prentice Hall, 1979, pp. 282-460.
Ruffell, J. Battery Low Indicator, p. 15-165, Eleckton Electronics, (Mar. 1989). (See p. 59).
Saab Anti-Theft System: ‘Saab's Engine Immobilizing Anti-Theft System is a Road-Block for ‘Code-Grabbing’ Thieves’, pp. 1-2, Aug. 1996; http://www.saabusa.com/news/newsindex/alarm.html.
Savage. J.E. Some Simple Self-Synchronizing Digital Data Scramblers, pp. 449-498, The Bell System Tech. Journal, (Feb. 1967).
Search Report Under Section 17 From British Patent Application No. GB0601795.8; Search dated Apr. 22, 2009.
Search Report Under Section 17, Application No. GB0715089.9; Search dated Nov. 27, 2007.
Seberry, J. and Pieprzyk, Cryptography—An Introduction to Computer Security, Prentice Hall of Australia, YTY Ltd, 1989, pp. 134-136.
Second Examination Report, from Australian Application No. 2019240615, dated Apr. 28, 2021; 2 pages.
Secure Terminal Interface Module for Smart Card Application, pp. 1488-1489, IBM: Technical Disclosure Bulletin, vol. 28, No. 4, (Sep. 1985).
Shamir, Adi. ‘Embedding Cryptographic Trapdoors in Arbitrary Knapsack Systems’, pp. 77-79, Information Processing Letters, 1983.
Shamir, Adi. Embedding cryptographic Trapdoors in Arbitrary Knapsak Systems, pp. 81-85, IEEE Transactions on Computers, vol. C-34, No. 1, (Jan. 1985).
Siegenthaler, T. Decrypting a Class of Stream Ciphers Using Ciphertext Only, pp. 81-85, IEEE Transactions on Computers, vol. C-34, No. 1, (Jan. 1985).
Simmons, Gustavus, J. Message Authentication with Arbitration of Transmitter/Receiver Disputes, pp. 151-165 (1987).
Smith, J.L., et al. An Experimental Application of Crptography to a Remotely Accessed Data System, pp. 282-297, Proceedings of hte ACM, (Aug. 1972).
Smith, Jack, ‘Modem Communication Circuits.’ McGraw-Hill Book Company, 1986, Chapter 11, pp. 420-454.
Smith, Jack, ‘Modem Communication Circuits’ McGraw-Hill Book Company, 1986, Chapter 7, pp. 231-294.
Smith. J.L. The Design of Lucifer: a Cryptographic Device for Data Communications, pp. 1-65, (Apr. 15, 1971).
Soete, M. Some constructions for authentication—secrecy codes, Advances in Cryptology-Eurocrypt '88, Lecture Notes in Computer Science 303 (1988), 57-75.
Steven Dawson, Keelog.RTM. Code Hopping Decoder Using Secure Learn, AN662, 1997 Microchip Technology, Inc., 1-16.
Svigals, J. Limiting Access to Data in an Indentification Card Having a Micro-Processor, pp. 580-581, IBM: Technical Disclosre Bulletin, vol. 27, No. 1B, (Jun. 1984).
Thatcham: The Motor Insurance Repair Research Centre, The British Insurance Industry's Criteria for Vehicle Security (Jan. 1993) (Lear 18968-19027), pp. 1-36.
Transaction Completion Code Based on Digital Signatures, pp. 1109-1122, IBM: Technical Disclosure Bulletin, vol. 28, No. 3, (Aug. 1985).
Turn, Rein. Privacy Transformations for Databank Systems, pp. 589-601, National Computer Conference, (1973).
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-C-3449, Declaration of Robert Louis Stevenson, Jr., Jun. 26, 2009.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-C-3449, JCI's Local Rule 56.1 Statement of Undisputed Facts in Support of Their Motion for Summary Judgment of Infringement of the '056 Patent; Jul. 6, 2009.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-C-3449, JCI's Local Rule 56.1 Statement of Undisputed Facts in Support of Their Motion for Summary Judgment of Infringement of the '544 Patent; Jul. 6, 2009.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-C-3449, JCI's Memorandum of Law in Support of its Motion for Summary Judgment of Infringement of the '056 Patent, Jul. 6, 2009.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-C-3449, JCI's Memorandum of Law in Support of its Motion for Summary Judgment of Infringement of the '544 Patent, Jul. 6, 2009.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-C-3449, Memorandum Opinion and Order, Nov. 24, 2010.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Defendant Lear Corporation's Answer to Plaintiffs' Second Amended Complaint, Defenses, and Counterclaim; Sep. 8, 2008.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Defendant Lear Corporation's Reply Memorandum in Support of Its Motion to Stay Effectiveness of Any Preliminary Injunction; Apr. 17, 2007.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Lear Corporation Memorandum of Law in Support of Its Motion for Summary Judgment of U.S. Pat. No. 7,412,056; Dec. 8, 2008.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Lear Corporation's Answer, Affirmative Defenses and Counterclaims to Plaintiffs' Amended Complaint; Oct. 24, 2005.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Lear Corporation's Memorandum of Law in Support of Its Emergency Motion to Stay the Effectiveness of the Preliminary Injunction Memorandum Opinion and Order Entered Mar. 30, 2007.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Lear Corporation's Memorandum of Law in Support of Its Motion for Summary Judgment, May 22, 2008.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Lear Corporation's Motion for Reconsideration of the Court's Sep. 11, 2006 Memorandum Opinion and Order Regarding Claim Construction.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Lear Corporation's Post-Markman Brief; Dated Jun. 15, 2006.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Memorandum Opinion and Order, Apr. 25, 2007.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Memorandum Opinion and Order, Feb. 20, 2007.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Memorandum Opinion and Order, Sep. 11, 2006.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Memorandum Opinion and Order; Mar. 30, 2007.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Notice of Motion and Motion for Leave to File Defendant Lear Corporation's Sur-Reply to Chamberlain's and JCI's Reply Memorandum in Support of Motion for Preliminary Injunction; Mar. 30, 2006.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Plaintiffs' Opposition to Lear Corporation's Motion to Stay the Effectiveness of the Preliminary Injunction Memorandum Opinion and Order Entered Mar. 30, 2007.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Plaintiffs' Response to Lear's Mar. 2, 2007 Supplemental Memorandum.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Plaintiffs' Response to Lear's Motion for Reconsideration of the Court's Sep. 11, 2006 Ruling Regarding Claim Construction; Oct. 4, 2006.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Plaintiffs' Surreply Memorandum in Opposition to Lear's Motion to Stay the Preliminary Injunction, Apr. 24, 2007.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Plaintiffs' Surreply Memorandum in Support of Motion for Preliminary Injunction.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Reply Brief in Support of Lear's Motion for Reconsideration of the Court's Sep. 11, 2006 Ruling Regarding Claim Construction.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Supplemental Memorandum in Support of Defendant Lear Corporation's Opposition to Plaintiffs' Motion for Preliminary Injunction; Mar. 2, 2007.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Transcript of Deposition of Bradford L. Farris, Jan. 12, 2006.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Transcript of Deposition of Hubert E. Dunsmore, Jan. 12, 2006.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Transcript of Proceedings Before the Honorable James B. Moran, May 31, 2005.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Transcript of Proceedings Before the Honorable James B. Moran, May 31, 2006.
United States Court of Appeals for the Federal Circuit, Appeal from the United States District Court for the Northern District of Illinois in Case No. 05-CV-3449, Brief of Defendant—Appellant Lear Corporation.
United States Court of Appeals for the Federal Circuit, Appeal from the United States District Court for the Northern District of Illinois in Case No. 05-CV-3449, Brief of the Chamberlain Group, Inc. and Johnson Controls Interiors LLC; Aug. 8, 2007.
United States Court of Appeals for the Federal Circuit, Appeal from the United States District Court for the Northern District of Illinois in Case No. 05-CV-3449, Combined Petition for Panel Rehearing and Rehearing En Banc of Chamberlain Group, Inc.and Johnson Controls Interiors LLC; Dated Mar. 19, 2008.
United States Court of Appeals for the Federal Circuit, Appeal from the United States District Court for the Northern District of Illinois in Case No. 05-CV-3449, Reply Brief of Defendant—Appellant Lear Corporation, Aug. 29, 2007.
United States Court of Appeals for the Federal Circuit, Appeal from the United States District Court, Northern District of Illinois in Case No. 05-CV-3449, Appellate Decision, Feb. 19, 2008.
United States Court, Northern District of Illinois, Eastern Division, Civil Action 05 C 3449, Notice Pursuant to 35 U.S.C. 282, Mar. 4, 2011.
United States International Trade Commission in the Matter of Certain Code Hopping Remote Control Systems, Including Components and Integrated Circuits Used Therein; Investigation No. 337-TA-417; Expert Report of Dr. V. Thomas Rhyne; (TCG019919-19959); Partially redacted; Dated Jul. 7, 1999.
United States International Trade Commission, Washington, D., Investigation No. 337-TA-417; Respondents'Answer to Complaint and Notice of Investigation, Jan. 26, 1999.
U.S. Appl. No. 13/777,787; Notice of Allowance dated Sep. 11, 2020; (pp. 1-5).
U.S. Appl. No. 13/777,787; Notice of Allowance dated Oct. 16, 2020; (pp. 1-5).
U.S. Appl. No. 14/867,633; Corrected Notice of Allowability dated Oct. 27, 2020; (pp. 1-2).
U.S. Appl. No. 14/867,633; Notice of Allowance dated Aug. 10, 2020; (pp. 1-8).
U.S. Appl. No. 15/674,069; Notice of Allowance dated Sep. 30, 2020; (pp. 1-12).
U.S. Appl. No. 14/867,633; Notice of Allowance dated Apr. 1, 2020; (pp. 1-8).
U.S. Appl. No. 11/172,524; Office Action dated Apr. 9, 2009, (pp. 1-13).
U.S. Appl. No. 11/172,525; Office Action dated Apr. 9, 2009; (17 pages).
U.S. Appl. No. 11/172,525; Office Action dated Mar. 21, 2011; (42 pages).
U.S. Appl. No. 14/857,633; Office Action dated Jul. 19, 2018, (22 pages).
U.S. Appl. No. 14/867,633; Office Action dated Sep. 17, 2019; (pp. 1-25).
U.S. Appl. No. 15/674,069; Office Action dated May 8, 2020, (pp. 1-9).
Voydock, Victor L. and Kent, Stephen T. ‘Security in High-Level Network Protocols’, IEEE Communications Magazine, pp. 12-25, vol. 23, No. 7, Jul. 1985.
Voydock, Victor L. and Kent, Stephen T. ‘Security Mechanisms in High-Level Network Protocols’, Computing Surveys, pp. 135-171, vol. 15, No. 2, Jun. 1983.
Voydock, Victor L. and Kent, Stephen T. Security Mechanisms in a Transport Layer Protocol, pp. 325-341, Computers & Security, (1985).
Watts, Charles and Harper John. How to Design a HiSec.TM. Transmitter, pp. 1-4, National Semiconductor, (Oct. 1994).
Weinstein, S.B. Smart Credit Cards: The Answer to Cashless Shopping, pp. 43-49, IEEE Spectrum, (Feb. 1984).
Weissman, C. Securtiy Controls in the ADEPT-50 Time-Sharing Syustem, pp. 119-133, AFIPS Full Joint Compuer Conference, (1969).
Welsh, Dominic, Codes and Cryptography, pp. 7.0-7.1, (Clarendon Press, 1988).
Wolfe, James Raymond, “Secret Writing—The Craft of the Cryptographer” McGraw-Hill Book Company 1970, pp. 111-122, Chapter 10.
First Examination Report from Australian Application No. 2021277691, dated Jan. 16, 2023, 3 pages.
Related Publications (1)
Number Date Country
20210281405 A1 Sep 2021 US
Continuations (3)
Number Date Country
Parent 13777787 Feb 2013 US
Child 17194923 US
Parent 11501455 Aug 2006 US
Child 13777787 US
Parent 11044411 Jan 2005 US
Child 11480288 US
Continuation in Parts (2)
Number Date Country
Parent 11480288 Jun 2006 US
Child 11501455 US
Parent 11172525 Jun 2005 US
Child 11501455 Aug 2006 US