Security system for a moveable barrier operator

Information

  • Patent Grant
  • 11778464
  • Patent Number
    11,778,464
  • Date Filed
    Wednesday, August 18, 2021
    3 years ago
  • Date Issued
    Tuesday, October 3, 2023
    a year ago
Abstract
Electronic systems are provided for secure actuation of a remote device such as a moveable barrier operator. The systems address the “man in the middle” problem of persons intercepting and duplicating radio frequency signals from a control device by introducing timing parameters into a bidirectional communication sequence between at least two devices.
Description
FIELD

The invention relates in general to security systems that allow operation upon the receipt of a properly coded signal. More particularly, the invention relates to a security system or to a barrier operator system, such as a garage door operator, employing a transmitter and a receiver that communicate via codes having at least a portion thereof that changes with operations of the transmitter.


BACKGROUND

It is well known in the art to provide garage door operators or other barrier operators that include an electric motor connectable through a transmission to a door or other movable barrier that is to be opened and closed. Because many of these systems are associated with residences, as well as with garages, it is important that opening of the barrier be permitted only by one who is authorized to obtain entry to the area protected by the barrier. Some garage door operator systems have in the past employed mechanical lock and key arrangements associated with electrical switches mounted on the outside of the garage. While these systems enjoy a relatively high level of security against tampering, they are inconvenient to use and may present safety concerns by requiring the user to exit their vehicle to open the garage door.


It is also well known to provide radio-controlled garage door operators, which include a garage door operator unit having a radio receiver and a motor connected to the garage door. The radio receiver is adapted to receive radio frequency signals or other electromagnetic signals having particular signal characteristics that, when received, cause the door to be opened. Such systems can include radio transmitters employing coded transmissions of multiple or three-valued digits, also known as “trinary bits” or other serial coded transmission techniques. Among these systems are U.S. Pat. No. 3,906,348 to Willmott, which employs a transmitter and receiver system wherein a plurality of mechanical switches may be used to set a stored authorization code.


U.S. Pat. No. 4,529,980 to Liotine et al. discloses a transmitter and receiver combination for use in a device such as a garage door operator wherein the transmitter stores an authorization code which is to be transmitted to and received by the receiver via a radio frequency link. In order to alter or update the authorization code contained within the transmitter, the receiver is equipped with a programming signal transmitter or light emitting diode which can send a digitized optical signal back to the transmitter where it is stored. Other systems also employing encoded transmissions are U.S. Pat. Nos. 4,037,201, 4,535,333, 4,638,433, 4,750,118 and 4,988,992.


While security systems have become more sophisticated, persons wishing to gain unauthorized access to commit property or person-related crimes have become more sophisticated as well. It is known in the security industry today that devices are being made available that can intercept or steal rolling code.


Systems are known that comprise code hopping encoders generate serial codes having fixed portions (i.e., which do not change with repeated actuation of the encoding portion) and rolling code portions which alter with each actuation of the encoding portion of the chip. In order to avoid inadvertent activation of a transmitter when out of range of the receiver causing the transmitter rolling code to be permanently out of sync with, and therefore not recognized by, a receiver, these code hopping encoders provide a window forward system, that is they are operable with systems having code receivers which recognize as a valid code not a single rolling code, but a plurality of rolling codes within a certain code window or window of values which are the values which would be generated on a relatively small number of switch closures as compared to the total number of rolling codes available. Examples include Keeloq Model NTQ105, NTQ115, NTQ125D and NTQ129 code hopping encoders by TransEquatorial Technology, Inc. and Texas Instruments Mark Star TRC1300 and TRC1315 remote control transmitter/receiver combinations. Nevertheless, if a user is away and inadvertently causes codes to be transmitted exceeding the number of codes normally allowed within the valid forward code window, the code will not be recognized by the receiver and the user must circumvent the system, possibly causing damage to the system or requiring an engineer.


More recently, many movable barrier operators, for example, garage door operators, use activation codes that change after each transmission. Such varying codes, called rolling access codes, are created by the transmitter and acted on by the receiver, both of which operate in accordance with the same method to predict a next rolling access code to be sent and received. One such rolling type access code includes four portions, a fixed transmitter identification portion, a rolling code portion, a fixed transmitter type identification portion, and a fixed switch identification portion. In this example, the fixed transmitter identification is a unique transmitter identification number. The rolling code portion is a number that changes every transmission to confirm that the transmission is not a recorded transmission. The fixed transmitter type identification is used to notify the movable barrier operator of the type and features of the transmitter. The switch identification is used to identify which switch on the transmitter is being pressed, because there are systems where the function performed is different depending on which switch is pressed.


Methods also exist for pairing remote control devices with a barrier operator so that a user may purchase additional control devices for use with a single barrier operator or utilize a control device integrated into a vehicle. When a movable barrier operator is installed, the homeowner typically receives at least one handheld transmitter that is already trained into the operator. To operate the door from a new learning transceiver, there is generally a two-step learning procedure for training the new learning transceiver. The first step is to teach the learning transceiver the type and potentially the code of the owner's handheld transmitter. While holding the handheld transmitter a few inches from the learning transceiver, the owner presses and holds the handheld transmitter's button at the same time as pressing a button on the learning transceiver to teach the access code type and frequency to the learning transceiver. The second step of the learning process is to train the learning transceiver to the operator. To do this, the learn button on the barrier operator has to be pressed, and within a given time period the learning transceiver should be activated. In another prior approach, these two steps are combined into a single step or done simultaneously. In one example, a pre-trained transmitter transmits a code to both an operator and a learning transceiver, which both save the code. Next, within a predetermined amount of time, the button is pressed on the learning transceiver to transmit a second rolling access code, which is received by the operator and compared with the first rolling type access code saved in the operator. If a predetermined correlation exists between the first rolling type access code and the second rolling type access code, the operator stores the representation of the second rolling type access code from the learning transceiver. Requiring that a user physically possess a pre-trained transmitter to train a learning transceiver to a movable barrier operator according to this approach ensures that the user is authorized to access the garage. Some systems even allow a universal transceiver to learn a credential from a movable barrier operator by establishing a bidirectional communication between the transceiver and the movable barrier operator, upon the occurrence of a predetermined event, without the use of a preprogrammed transmitter.


Yet there remains a desire for economical encoding systems that provide heightened security by using a changing or rolling code in combination with additional measures that prevent or minimize interception and copying of the code during use or pairing of devices.


SUMMARY

The invention relates in general to an electronic system for providing security for actuation of a particular device. The system may be useful, for instance, in a barrier operator system such as a garage door operator by allowing the garage door to be opened and closed in a relatively secure fashion while preventing persons who may be intercepting the radio frequency signals from being able to access the garage without authorization.


In some forms, systems and methods are provided that address the known “man in the middle” problem of persons intercepting and duplicating radio frequency signals from an authorized device, such as by use of a “code grabber,” by introducing timing parameters into a bidirectional communication sequence between at least two devices. The timing parameters may be, for instance, a time delay or time window of a specified magnitude or duration. If the first device communicates with the second device and a response from the second device is sent outside of the time parameter, the response will be considered invalid or ignored by the first device. In this way, an intercepted transmission will be useless outside of (i.e. before and after) the specified time window, which may be on the order of tens or hundreds of milliseconds. By setting the devices to determine the time window based on a variable portion of the related transmission, or a portion or derivative thereof, the time window will vary from operation to operation and further increase the level of security.


In some embodiments, the system may include a first device configured to trigger a communication event and subsequent response by another device. The first device may be, for instance, a handheld or vehicle mounted transceiver, and may be user-operated or triggered by a geofence, proximity detection, or other variables. The first device may in some forms be generally configured for developing and transmitting via wireless signals a first encrypted message comprising a fixed code and a changing or variable code (such as a rolling code). The changing or variable code is changed with each actuation of the transceiver. The fixed code is static and remains the same for each actuation of the transceiver. A second device, for example an operator such as a motorized garage door opener, receives the encrypted message, validates the message by comparing the fixed code and the changing or variable code to stored values, which are preferably stored in a computer memory physically incorporated into the second device, and upon validation sends a response signal including at least a second encrypted message having a second fixed code and a second changing code. The first device then receives and attempts to validate the second encrypted message, and in some embodiments, is configured to transmit a third encrypted message to the operator device, the third encrypted message including the first fixed code and a changed version of the second changing code. This third encrypted message is configured to effect performance of an action by the operator device, such as lifting or lowering a moveable barrier structure.


In some forms, a system of secure communication between a first device and a second device is provided to effect an action by the second device. In some embodiments, the first device comprises a controller circuit; a transmitter in operative communication with the controller circuit; a receiver in operative communication with the controller circuit; and a user input device in operative communication with the controller circuit. The controller circuit of the first device may be configured to, in response to detecting an input at the user input device, control the transmitter to transmit a first encrypted message that includes at least a first fixed code and a first changing code; receive through the receiver a response from the second device, wherein the response comprises a second encrypted message including a second fixed code and a second changing code; validate the response by comparing the second fixed code and the second changing code to second stored code values; and in response to validating the response, control the transmitter to transmit a third encrypted message including at least the first fixed code and a changed version of the second changing code, wherein the third encrypted message is configured to effect performance of an action by the second device. The second device may in some embodiments comprise a controller circuit; a transmitter in operative communication with the controller circuit; a receiver in operative communication with the controller circuit; and a timer circuit in operative communication with the controller circuit. The controller circuit of the second device may be configured to enable receiving the first encrypted message by the second device's receiver; validate the first encrypted message by comparing the first fixed code and the first changing code to stored code values; determine when to transmit a response; in response to validating the first encrypted message, control transmitting the response from the second device's transmitter; enable the second device's receiver to receive the third encrypted message; validate the third encrypted message by comparing the first fixed code and the changed version of the second changing code to stored code values; and effect performance of an action in response to validating the third encrypted message.


In some embodiments, at least one time window is associated with one or more encrypted messages and provides an additional layer of security and minimize the opportunity for third parties to intercept transmissions and utilize the fixed and changing codes without the device owner's consent. Determination of the time window may be made relative to specific actions (such as activation of the first device, receipt of a transmission by the second device, etc.), or alternatively may be based on an absolute time measurement (e.g. by referencing a clock to determine the beginning and end of the window). If absolute time measurements are used, the first device and devices with which it is in communication should be synchronized so that their absolute time measurements are essentially the same. In some such embodiments, the first and second device each contain timers in operative communication with their respective controller circuits, and upon actuation the first device determines a time window in which to expect to receive a response in addition to transmitting a first encrypted message including at least a first fixed code and a first changing code. In some embodiments, the time window may be determined based on one or more code portions used to create the first encrypted message (such as the changing code portion of the message or one or more portions thereof) or based on the encrypted form of the message or one or more portions thereof. The second device receives and decrypts the first encrypted message and validates the message by comparing the fixed code and the changing or variable code thereof to stored values. The second device also determines a second time window in which to transmit a response to the user-operated transceiver based on the encrypted message. The second time window may be the same as or within the time window determined by the first device and may or may not be determined using the same portion of the encrypted message. The second time window may be a discrete point in time that lies within the first time window.


In some embodiments, after the second device validates the first encrypted message, the second device sends a response signal to the first device within the second time window. The response signal includes at least a second encrypted message created from a second fixed code and a second changing code, wherein the second changing code may be, but is not necessarily, independent from the first changing code. If the second encrypted message is received by the first device within the first time window, the first device will attempt to validate the second encrypted message by comparing the second encrypted message's fixed code and changing or variable code to a second set of stored code values. In some embodiments, the first device may compare the time of receipt of the second encrypted message to the first time window, only proceeding to analyze signals or messages that are received within the first time window. Alternatively, to conserve power, the first device may turn on and enable a receiver element at the beginning of the time window and shut off the receiver element at the end of the time window so that the first device is only able to receive transmissions from the second device within the first time window. In such embodiments, the second encrypted message will be entirely ignored if sent and received outside of the first time window. Upon validating the response from the second device, the first device in some embodiments may be configured to transmit a third encrypted message including the first fixed code and a changed version of the second changing code. This third encrypted message is configured to effect performance of an action by the second device, such as lifting or lowering a moveable barrier.


The fixed and variable codes may be of any selected length and may be adapted or altered in various ways in order to add additional layers of security. In some examples, the transmitter may be configured to produce a frame of a specified number of bits comprising a fixed portion of the code and a second frame comprising a variable portion of the code. In some embodiments, the variable portion of the code, which may be a rolling code, may then be mirrored to provide a mirrored rolling code. The mirrored rolling code may then have its most significant bit “deleted” by setting it to zero. The transmitter may then convert the fixed code and the mirrored rolling code to a three-valued or trinary bit fixed code and a three-valued or trinary bit rolling code. To provide even further security, in some embodiments the fixed code and the rolling codes may be shuffled or interleaved so that alternating bits are comprised of a fixed code bit and a rolling code bit. A single synchronization and/or identification pulse may proceed the first and second frames to indicate the start of the frame and whether it is the first frame or the second frame.


Additionally, or alternatively, in some embodiments encryption may include providing a variable code and a plurality of differing data bit order patterns, providing a plurality of differing data inversion patterns, selecting a particular one of each of the data bit order patterns and the data inversion patterns to provide selected patterns, and transmitting at least a part of the encrypted variable code using the selected patterns as transmission characteristics. In some forms, selecting a particular one of each of the data bit order patterns and the data inversion patterns to provide selected patterns comprises using the variable code to select the particular data bit order pattern and data inversion pattern to provide the selected patterns.


Also provided is a method of pairing a first device and a second device to establish secure communication between the first device and the second device to effect an action by the second device. A first device transmits to a second device a first encrypted message that includes at least a first fixed code and a first changing code. The first device optionally also determines a time window in which to expect a response from the second device, and the time window may be based on at least a portion of the first encrypted message. In some embodiments, the first device may enable a first device receiver during the time window to receive the response from the second device, or alternatively the first device receiver may remain in an on state and compare a timestamp of the response to the time window. The second device receives the first encrypted message while the second device is in a “learn” mode in which it is waiting for signals from a transmitter without information regarding the current version of the changing code of the first device. While in learn mode the second device stores the first encrypted message, and determines a time window in which to transmit a response to the first encrypted message. In some embodiments, the second device may have been placed in learn mode manually by a user, such as by pressing a button, switch, or lever on the second device, and thus in some embodiments may require simultaneous manual activation of both the first and second device. The time window as determined by the second device may depend on one or more portions of the first encrypted message. The second device transmits its response, which comprises a second encrypted message including at least a second fixed code, to the first device within the time window determined by the second device. When the responsive second encrypted message is received by the first device within the time window determined by the first device, the response is stored and the first device transmits to the second device a third encrypted message including at least the first fixed code and a changed version of the first changing code back. The second device receives and validates the third encrypted message by comparing the first fixed code and the changed versions of the first changing code to stored code values from the first encrypted message (first fixed code and first changing code), and upon validation (by confirming that the changed version of the first changing code is one change forward of the changing code from the first encrypted message) the second device then transmits a fourth encrypted message including the second fixed code and a second changing code (which may be independent of the first changing code). The first device receives the fourth encrypted message, validates the fourth encrypted message by comparing the second fixed code and the second changing code to the response stored by the first device, and stores the second fixed code and the second changing code in response to validating the fourth encrypted message.


The present system provides advantages over previous garage door operator systems and previous rolling code systems. Some systems according to the invention provide enhanced security through bidirectional communication in which first and second devices both transmit and receive independent codes to validate a transaction between devices both on the user end and operator end. Some embodiments provide enhanced security by linking information relating to timing of subsequent transmissions to the encrypted transmissions, and require receipt of responsive transmissions within a specified time window as a prerequisite for code validation. These enhanced security measures may also be used in methods of pairing and/or synchronizing devices.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a perspective view of an example moveable barrier operator system that receives control signals from a user-operated transceiver;



FIG. 2 is a block diagram of an example of the user-operated transceiver of FIG. 1;



FIG. 3 is a block diagram of an example of the moveable barrier operator of the system of FIG. 1;



FIGS. 4A-C are flow diagrams showing an example communication flow between a first device and a second device during normal operation;



FIGS. 5A-C are flow diagrams showing an example communication flow between a first device and a second device during a learning or pairing sequence;



FIG. 6 is a timing diagram of examples of signals generated by a portion of a transmitter of one of the first and second devices;



FIGS. 7A-C are flow diagrams showing examples of operation of the transmitter;



FIGS. 8A-F are flow charts showing examples of operation of a receiver of one of the first and second devices;



FIG. 8G is a schematic view of one example of bit processing for use in encrypting a message;



FIG. 8H is an example message diagram in accordance with one example of an encrypted message.



FIGS. 9A-C are flow diagrams showing another example communication flow between a first device and a second device during normal operation; and



FIGS. 10A-C are flow diagrams showing another example communication flow between a first device and a second device during a learning or pairing sequence.





Skilled artisans will appreciate that elements in the figures are illustrated for simplicity and clarity and have not necessarily been drawn to scale. Common but well-understood elements that are useful or necessary in a commercially feasible embodiment may be omitted for simplicity and/or clarity. It will further be appreciated that certain actions and/or steps may be described or depicted in a particular order of occurrence while those skilled in the art will understand that such specificity with respect to sequence is not actually required.


DETAILED DESCRIPTION

The systems and methods described herein include a user-actuated first device, for instance a handheld or vehicle mounted transceiver, generally configured for developing a first encrypted message comprising a fixed code and a changing or variable code (such as a rolling code). The changing or variable code is changed with each actuation of the transceiver according to a set sequence or protocol accessible by the first device and a second device with which it communicates. The fixed code remains the same for each actuation of the first device. The second device includes an operator mechanism, such as a motorized garage door opener, to induce one or more actions when commanded by the first device. The first and second device may be configured to communicate with one another by various techniques, for example a wired communication path, radio frequencies, or any variety of proprietary wireless platforms.


In some embodiments, the second device receives the encrypted message from the first device, validates the message by comparing the fixed code and changing or variable code to stored values and, upon validation, sends a response signal including at least a second encrypted message having a second fixed code and a second changing code that is independent from the first changing code. The stored values may represent, for instance, fixed and changing values from prior operations with a sequence or algorithm associated with the changing code to determine changing code values. In some embodiments, the second device may recognize a plurality of changing code values as valid in order to account for accidental or otherwise ineffective actuation of the first device (such as when outside of the range of the second device or when interference prevents normal communication with the second device).


The first device receives and attempts to validate the second encrypted message, and in some embodiments, is configured to transmit a third encrypted message to the second device, the third encrypted message including the first fixed code and a changed version of the second changing code. This third encrypted message is configured to effect performance of an action by the second device, such as lifting or lowering a moveable barrier. Thus, communication between the devices may involve bidirectional validation of messages wherein each of two devices are configured to both transmit and receive messages and compare them to stored values, such as values from prior communications between devices. The communication between the devices may, in some embodiments, involve additional exchanges of messages in order to further improve security, for instance transmission and validation of fourth and fifth encrypted messages containing fixed codes and changing codes.


In some embodiments, at least one time window is associated with the encrypted messages to provide an additional layer of security and minimize the opportunity for third parties to intercept transmissions and utilize the fixed and changing codes without the device owner's consent. In some such embodiments, upon actuation, the first device also determines a time window in which to expect to receive a response as it transmits the first encrypted message including at least a first fixed code and a first changing code. In some embodiments, the time window may be determined at least in part based on one or more portions of the encrypted message, so that the time window itself acts as an additional layer of encryption. For instance, specific lengths of time may be associated with specific values or digits in the fixed code portion of the message so that a specific time window is linked to the first device or associated with specific values or digits in the changing code portion of a message so that the time window varies with each actuation of the first device. The second device receives the encrypted message and validates the message by comparing the fixed code and changing or variable code to stored values. The second device then determines a second time window in which to transmit a response to the user-operated transceiver based on the encrypted message, with the second time window being the same as or within the time window determined by the first device and may or may not be determined using the same portion of the encrypted message. In some embodiments, the second time window may be a discrete point in time, with or without a margin of error, that lies within the first time window.


When the second device validates the encrypted message, the second device sends a response signal within the second time window. The response signal includes a second encrypted message, which may be, for instance, a message comprising a second fixed code and a second changing code that is independent from the first changing code. The first device may be configured to ignore responses received by the first device outside of the first time window but validate responses received within the time window calculated by the first device, thus allowing timing of response signals from the second device to act as an additional layer of security verifying that the devices are authorized to communicate with one another. If the second encrypted message is received by the first device within the first time window, the user-operated device will validate the second encrypted message by comparing its fixed code and changing or variable code to a set of stored code values. The first device may compare the time of receipt of the second encrypted message to the first time window, only proceeding to analyze signals which area received within the first time window. Alternatively, in order to conserve power the first device transceiver may turn on and enable a receiver portion to receive transmissions only within the first time window so that the second encrypted message will be entirely ignored if sent and received outside of the first time window. In some embodiments, the time window is less than about 360 milliseconds, and in some embodiments, begins tens or hundreds of milliseconds after it is determined by the first device. The time window is preferably short enough so that there is no noticeable delay to the user between actuating the transmitter device and causing the requested action.


Upon validating the response from the second device, the first device may be configured to transmit a third encrypted message, for instance one including the first fixed code and a changed version of the second changing code. This third encrypted message is configured to effect performance of an action by the operator device, such as lifting or lowering a moveable barrier structure. In some embodiments, the third message may also be associated with a time window and recognized by the second device only when received within a calculated time window. The devices may also be configured to require validation of additional messages before effecting an action by the second device.


Referring now to the drawings and especially to FIG. 1, a movable barrier operator system 10 is provided that includes moveable barrier operator 12 mounted within a garage 14 and a handheld transceiver 30. The operator 12 is mounted to the ceiling 16 of the garage 14 and includes a rail 18 extending therefrom with a releasable trolley 20 attached having an arm 22 extending to a multiple paneled garage door 24 positioned for movement along a pair of door rails 26 and 28. The handheld transceiver unit 30 is adapted to send signals to and receive signals from the operator 12. An antenna 32 may be positioned on the operator 12 and coupled to a receiver as discussed hereinafter in order to receive transmissions from the handheld transceiver 30. An external control pad 34 may also be positioned on the outside of the garage 14 having a plurality of buttons thereon and communicate via radio frequency transmission with the antenna 32 of the operator 12. An optical emitter 42 may be connected via a power and signal line 44 to the operator 12 with an optical detector 46 connected via a wire 48 to the operator 12 in order to prevent closing of the door 24 on a person or object inadvertently in the door's path. A switch 300 may be provided for switching between modes, such as operating mode and learn mode.


Referring now to FIG. 2, a block diagram of the transceiver 30 is provided. The transceiver 30 includes both a transmitter 206 and receiver 207 (which may be combined into a single mechanism) in operative communication with antennas 220 and 221, respectively. The antennas may be positioned in, on, or extending from the user operated transceiver 30, wherein the transmitter 206 and receiver 207 are configured for wirelessly transmitting and receiving transmission signals to and from the movable barrier operator 12, including transmission signals that contain a first rolling access code with a fixed code portion and a rolling code portion. In some embodiments, both the transmitter and receiver may communicate with a single antenna or multiple antennas, and in some embodiments both device may be configured to be a single transceiver device in communication with a single antenna. The user-operated transceiver 30 also includes a controller 202 in operative communication with the transmitter 206 and a memory 204 and is configured for processing data and carrying out commands. The memory may be, for instance, a non-transitory computer readable medium, and may have stored thereon instructions that when executed by a controller circuit cause the controller circuit to perform operations. A power source 205 is coupled to the controller 202 and/or other components, and may be routed in some embodiments so that a switch 31 couples/decouples the power source to other components so that power is supplied only upon activation of the switch 31 or a specified time thereafter. The controller 202 is configured to generate and cause the transmitter 206 to transmit a first rolling access code, including at least one fixed code portion and at least one changing or rolling code portion for the transmission signal, and the receiver 207 is configured to receive responsive transmissions. A timer 230 in communication with the controller 202 provides a way to determine the time of incoming and outgoing signal transmissions, and provides reference for the controller 202 to enable and disable the transmitter 206 and/or receiver 207 of the device. The memory 204 is connected for operative communication with the controller 202 and is configured to store codes and in some embodiments other information for outgoing transmissions. The memory 204 is further configured to store fixed and/or changing or variable code values for comparison to incoming transmissions. The switch 31 may include one or more user-operable switches for inputting commands to the transceiver 30, for example to issue a barrier movement command or a learning command. The switch 31 may be associated with a button, lever, or other device to be actuated, for example by a user's hand or other actions, events, or conditions. As other examples, the switch 31 may be voice operated or operated by a user contacting a touch-sensitive screen as the location of an object displayed on the screen.


Referring now to FIG. 3, in one example, the operator 12 includes a controller 302 in communication with a memory 304 and is configured for storing and retrieving data to and from the memory 304 as well as processing data and carrying out commands. A power source 305, such as an AC power conduit, battery, or other known source, supplies electricity to the controller 302 in order to allow operation. The operator 12 also includes a wireless transmitter 306 and receiver 307 (or combination device) in operative communication with the controller 302. As shown, the transmitter 306 communicates with a first antenna 320 and the receiver communicates with a second antenna 321, but both devices may communicate with a single antenna or multiple antennas, and in some embodiments the device may be configured to have a single transceiver device in communication with a single antenna. The antennas may be positioned in, on, or extending from the movable barrier operator 12. In this regard, signals, such as radio frequency or other wireless transmission carriers, may be sent to and received from the user-actuated transceiver 30 according to a variety of frequencies or modulations. Signals may be modulated in a number of different ways; thus, the transceiver 30 and movable barrier operator 12 may be configured to communicate with one another via a variety of techniques. The controller 302 of the operator device 12 is also in communication with a motor 340 in order to carry out an operation such as lifting or lowering a garage door; sliding, swinging, or rotating a gate; or otherwise moving or repositioning a barrier structure. One or more switches 331 may be provided to override the controller 302 or place the controller in and out of a learning mode in which the operator 12 may be paired with a user-operated device by exchanging and storing messages.


The term controller refers broadly to any microcontroller, computer, or processor-based device with processor, memory, and programmable input/output peripherals, which is generally designed to govern the operation of other components and devices. It is further understood to include common accompanying accessory devices. The controller can be implemented through one or more processors, microprocessors, central processing units, logic, local digital storage, firmware, software, and/or other control hardware and/or software, and may be used to execute or assist in executing the steps of the processes, methods, functionality, and techniques described herein. Furthermore, in some implementations the controller may provide multiprocessor functionality. These architectural options are well known and understood in the art and require no further description here. The controllers may be configured (for example, by using corresponding programming stored in a memory as will be well understood by those skilled in the art) to carry out one or more of the steps, actions, and/or functions described herein.


Generally, the controllers 202 and 302 may be configured similarly or independently, and each can include fixed-purpose hard-wired platforms or can comprise a partially or wholly programmable platform. These architectural options are well known and understood in the art and require no further description here. The controller can be configured (for example, by using corresponding programming as will be well understood by those skilled in the art) to carry out one or more of the steps, actions, and/or functions described herein, and can store instructions, code, and the like that is implemented by the controller and/or processors to implement intended functionality. In some applications, the controller and/or memory may be distributed over a communications network (e.g. LAN, WAN, Internet) providing distributed and/or redundant processing and functionality. In some implementations, the controller can comprise a processor and a memory module integrated together, such as in a microcontroller. One or more power sources may provide power to each controller, and may be of any known type.


When a user actuates the switch 31 of the user-operated transceiver 30, such as by pressing a button designated as performing a particular action, the controller 202 activates the transmitter 206 to transmit through antenna 220 a message based on information stored in the memory component 204. The message is received by the receiver 307 of the operator device 12, and communicated to the operator's controller 302. In some embodiments, the controller 302 verifies the message by comparing it to stored information from the operator's memory module 304, and upon verification the controller 302 is configured to cause transmission of a response signal from the transmitter 306 through antenna 320. If the message from the user-actuated transceiver 30 includes information relating to timing parameters for a response, the operator's controller 302 receives time information from a timer 330 in order to determine when to transmit the response in order to comply with timing parameters of the user-actuated transceiver 30.


The user-actuated transceiver 30 may be configured to verify that the response from the operator 12 complies with transmitted timing requirements in any number of ways. In some embodiments, the controller 202 may compare a time stamp or other timing information relating to the operator's response to the transmitted time parameter using timer 230. In some embodiments, receiver 207 is generally inactive, but switched on by controller 202 only for a short time period consistent with the transmitted timing parameter. For instance, controller 202 may switch on receiver 207 for a window of time matching a time window transmitted in an outgoing message through transmitter 206, and upon expiration of the time window according to timer 230, controller 202 switches receiver 207 off again. Timing information may be either relative, for instance a specified number of seconds, milliseconds, or nanoseconds after transmission of an outgoing signal or other event, or may be absolute such as standard date and time information for a specific time zone.


Upon receiving the response of the operator 12 through receiver 207 at an appropriate time consistent with the specified timing parameter, the user-actuated transceiver 30 may validate the response by comparing it to stored information in its memory module 204. Upon validation of the response, the user-actuated device 30 may transmit another message through transmitter 206 to the operator 12. This third message is configured to cause the operator's controller 302 to activate a motor 340 in order to carry out a function associated with activation of the user-actuated device. The transceiver 30 may include multiple buttons, levers, switches, displays, microphone(s), speaker(s), or other inputs associated with different tasks to be carried out by the operator 12.


In another example, pairing of the moveable barrier operator 12 to a user-actuated transceiver may be performed. The receiver 307 of the operator 12 is configured to receive an authorization signal indicating that it is authorized to communicate with the user-actuated transceiver 30 and to provide an indication that it received the authorization signal to the controller 302. One or more switches 331 may be provided in order to turn on and/or otherwise permit the receiver 307 to receive the authorization signal. In response to receiving the authorization signal, the controller 302 is configured to generate a first rolling access code and to store a representation of the first rolling access code in the memory device 304. The controller 302 is configured with the transmitter 306 to transmit a transmission signal including the first rolling access code to the user-actuated device 30. The receiver 307 also receives a transmission signal from the user-actuated transceiver 30 including a second rolling access code, as described further below. In this example, the receiver 307 provides the transmission signal to the controller 302, which compares the second rolling access code with the representation of the first rolling access code stored in the memory device 304.



FIGS. 4A, 4B, and 4C are interconnected flow charts that demonstrate steps of one example of a process in which signals are exchanged between first and second devices to verify authorization and carry out an activity. Steps to the left of the central dashed line relate to a first device, such as a user-operated remote device, while steps to the right relate to a second device, such as a moveable barrier operator. For example, the first and second devices may be the transceiver 30 and the operator 12 discussed previously. In this example, a previous operation such as a pairing procedure or an operation sequence has been performed at an earlier time so that each of the first and second device have stored information received from the other device; a first-time operation of the device in the form of a pairing or synchronization sequence will be explained further below in connection with FIGS. 5A-5C.


Initially, the first and second devices both have stored in their memories a first fixed code and first variable code from the immediately previous operation involving the first device, as well as a second fixed code and second rolling code from the immediately previous operation involving the second device. The first device assesses 401 whether it has been activated in a manner intended to cause an action by the second device. For instance, a user pressing a button on the first device may complete an electrical circuit or effect a measurable change in at least one component of the first device. When the first device has not been activated, it continues to await activation. Once activated, the first device transmits 403 a first message that includes at least a first fixed code and a first changing or variable code that represents a modification from the first changing code in the immediately previous operation. The first fixed code and/or first variable code are now stored within the memory of the first device, and may be encrypted using one or more encryption methods. The encryption methods are not particularly limiting, and may include one or more types of public key or private key encryption, block ciphers, stream ciphers, and other techniques. In some embodiments, encryption may comprise using a predetermined number of bits of the changing code as a basis for selecting a particular data bit order pattern and particular data inversion pattern. The first device also calculates 405 a time window in which it expects to receive a response, and this calculation may take place before or after transmission of the message by the first device. In some embodiments, the time window is calculated from at least a portion of the first encrypted message or from at least a portion of the unencrypted variable code, or both.


Meanwhile, the second device has been placed in operation mode and awaits 402 a signal to effect an action, and upon receiving 404 the first message from the first device, decrypts the message to obtain the first fixed code and first variable code. The second device then stores the first fixed code and first variable code, and validates the first fixed code and first variable code by comparing 406 them to stored code values. In this step, the first fixed code and first variable code from the encrypted message are compared to the first fixed and variable code from the previous operation. If the fixed codes match and the first variable code from the encrypted message matches the previous variable code as modified according to a set of established rules for the variable code (e.g. matches a subsequent value from a predetermined sequence or algorithm), the first encrypted message will be considered validated. If the decrypted code values do not match the stored code values, the second device ignores the first message and waits 402 for further signals. On the other hand, if the code values are valid in 407, the second device calculates 408 a response time window, such as a specific window or point in time, based on the first encrypted message. The response time may or may not be identical to the response window calculated 405 by the first device, and may or may not use the same portion or portions of the first encrypted message and/or first variable code. For instance, the second device may use the same portions of the first fixed and/or first variable code to calculate the same time window calculated by the first device, or may be configured to read one or more portions of the first fixed or changing code to determine a response time that is entirely within the window calculated by the first device.


In response to validating the first encrypted message, and after determining the response time window, the second device transmits a response 410 within the time window calculated in 408. The response comprises a second encrypted message including a second fixed code and a second changing/variable code that is, in the depicted embodiment, independent from the first changing code and represents a modified version of a variable code from the immediately previous operation. The second fixed and modified second variable code values are stored in the second device's memory, so that at this stage the second device memory contains the first fixed and variable code from the previous operation, the second fixed and variable code from the previous operation, the first fixed and variable code from the first encrypted message from the first device, and the second fixed and variable code from the encrypted response.


The first device enables 409 a receiver during the time window calculated by the first device so that it is able to receive the encrypted response from the second device. If the second device sends the response outside of the time window calculated by the first device the signal will simply not be received because the first device receiver is shut off. However, if the response is sent by the second device during the calculated time window in which the first device receiver is active, the first device will receive 411 and decrypt the second encrypted message, which includes the second fixed code and second changing/variable code. The second fixed and changed variable code are stored in the first device's memory, along with the second fixed and variable code from the previous operation and the first fixed and variable code from the first encrypted message. The first codes from the previous operation are no longer needed, and may be deleted from the memory.


The first device then compares 412 the second fixed code and second variable/changing code with fixed and variable codes from the previous operation stored in the memory of the first device. If the second fixed code matches the fixed code from the prior operation and the second variable code matches the prior changing code as modified according to a set of established rules for the changing code, the response message is validated. If the second fixed and variable codes are determined 413 valid, the first device transmits 414 a third encrypted message including at least the first fixed code and a changed version of the second changing code. If the first device is unable to validate the response from the second device, the process ends and the first device returns to awaiting 401 subsequent activation.


When the second device receives 415 the third encrypted message, the second device decrypts 415 the message to determine the first fixed code and the changed version of the second variable code. The values are stored in the second device memory, which now contains the first fixed and variable codes from the previous operation, the first fixed and variable code from the first encrypted transmission, the second fixed and variable codes from the previous operation, the second fixed and variable code from the second encrypted (response) transmission, and first fixed code and changed second variable code from the third encrypted message. The second device then compares 416 the first fixed code and the changed versions of the second variable code to stored code values comprising the first fixed code and unmodified second variable code in order validate 417 the third encrypted message. While the validation step may have a forward window of values that are acceptable (validation occurs when the received version of the changing code is any one of the next several (e.g. 12) values expected in the sequence), security may be increased by reducing the size of—or completely eliminating—this forward window. Therefore, in some embodiments the third encrypted message is validated only if it contains the next variable code value in the sequence. If the third message is validated, the second device performs 418 the requested action associated with activation of the first device. If the second device is unable to validate the third message, the second device ends the process without performing the requested action and returns to awaiting 402 signals from the first device.


Turning now to FIGS. 5A-C, a flow diagram illustrates an example method of pairing a first device to a second device so that, for example, a user-actuated device and an operator device are synchronized in order to recognize and validate signals shared between the devices. The first device may be the transceiver 30 and the second device may be the operator 12 discussed previously. The method involves at least one of the devices learning a changing code sequence from the other device, and in some embodiments, may involve bi-directional learning so that each device receives and stores a series of fixed and changing code values from the other device. In some embodiments, the devices may be configured so that the method of pairing entails a button or other actuator being manipulated on each device, such as pressing a button on a garage door operator to set the device in learn mode and then pressing a button on the remote control device to initiate the pairing process.


In one form, the pairing method begins when a first device is activated 451 by a user while a second device has been placed 452 in “learn” mode, such as by pressing a button or switching a lever on or associated with the second device. To begin, the first device contains within its memory a first fixed code and a first variable code, and the second device contains a second fixed code and a second variable code. When the first device is activated, it transmits 453 from the first device a first encrypted message that includes at least a first fixed code and a first changing or variable code, and determines 455 based on at least a portion of the first encrypted message a time window in which to expect a response from the second device. A first device receiver is enabled 456 during the time window to receive the response from the second device. The second device, meanwhile, receives 454 the first encrypted message while the second device is in the learn mode and stores 457 in the second device's memory the decrypted first fixed and first variable codes from the first encrypted message or portions thereof. The second device determines 458 a time window, based on the first encrypted message, in which to transmit a response. The second device then transmits 459 the response within the time window, the response comprising a second encrypted message including a second fixed code from the second device. If the second encrypted message is received 460 by the first device within the time period calculated for response by the first device, the second message is decrypted and the first device stores 461 the second fixed code. If the response from the first device is not received within the time window, the message is ignored and the pairing process ceases.


After receiving within the time window the response from the second device and storing associated values, the first device then transmits 462 a third encrypted message including at least the first fixed code and a changed version of the first variable code. The first device also enables 463 a receiver of the first device in anticipation of receiving further communications from the second device. In some embodiments, this step of enabling 463 reception in the first device may include an associated time window derived from the third message.


When the second device receives 464 and decrypts the third encrypted message, the second device validates the message by comparing 465 the first fixed code and the changed versions of the first variable code to stored code values from the first encrypted message. If the second device determines 466 that the comparison is valid, the second device then transmits 467 in response to validating the third encrypted message a fourth encrypted message including the second fixed code and a second changing code from the memory of the second device.


The first device receives 468 the fourth encrypted message and validates the fourth message by comparing 469 the second fixed code and the second changing code to the response stored by the first device. If the fourth message is determined 470 to be valid, the first device stores 471 the second fixed code and the second changed version of the second variable code in response to validating the fourth encrypted message.


The variable or changing codes transmitted by the first and second devices may be selected from those known in the art, such as rolling code systems in which the changing code is modified based on a preset algorithm and/or a predefined list or sequence of numbers. When a device validates a changing code by comparison with stored values, the device will ordinarily compare the received code value to a number expected subsequent values in order to account for activations of one device that are out of range of the other device or otherwise do not result in communication with the other device. For instance, in some embodiments a device will compare a received changing code to at least twelve stored values, and in some embodiments at least 24, 48, 96, 128, or 256 stored values.


A variety of methods and/or algorithms may be used to encrypt and/or decrypt the fixed and changing codes of each message transmitted between devices. In some forms, a first device transmits an encrypted signal by generating a radio frequency oscillatory signal, generating variable binary code, generating a three-valued/trinary code responsive to the variable binary code, and modulating the radio frequency oscillatory signal with the trinary code to produce a modulated trinary coded variable radio frequency signal for operation or control of a second device. To provide even further security, in some embodiments the fixed code and the rolling codes may be shuffled or interleaved so that alternating trinary bits are comprised of a fixed code bit and a rolling code bit to yield, for example, a total of 40 trinary bits. The 40 trinary bits may then be packaged in a first 20-trinary bit frame and a second 20-trinary bit frame. A single synchronization and/or identification pulse may proceed the first and second frames to indicate the start of the frame and whether it is the first frame or the second frame. Signals may be configured to comply with local laws and regulations; for instance, immediately following each of the frames, the first device may be placed into a quieting condition to maintain the average power of the transmitter over a typical 100 millisecond interval and within local regulations (e.g. within legal limits promulgated by the United States Federal Communications Commission). The first trinary frame and the second trinary frame may be used to modulate a radio frequency carrier, for instance via amplitude modulation, to produce an amplitude modulated encrypted signal. The amplitude modulated encrypted signal may then be transmitted and may be received by the second device.


In some embodiments, the second device receives the amplitude modulated encrypted signal and demodulates it to produce a pair of trinary bit encoded frames. The trinary bits in each of the frames may be converted substantially in real-time to 2-bit or half nibbles indicative of the values of the trinary bits which ultimately may be used to form two 16-bit fixed code words and two 16-bit variable code words. The two 16-bit fixed code words may be used as a pointer to identify the location of a previously stored variable code value within the operator. The two 16-bit rolling code words may be concatenated by taking the 16-bit words having the more significant bits, multiplying it by 310 and then adding the result to the second of the words to produce a 32-bit encrypted variable code. The 32-bit encrypted code may then be compared via a binary subtraction with the stored variable code. If the 32-bit code is within a window or fixed count, the microprocessor of the second device may produce an authorization signal which may then be responded to by other portions of the second device's circuit to cause the garage door to open or close as commanded. In the event that the code is greater than the stored rolling code, plus the fixed count, indicative of a relatively large number of incrementations, a user may be allowed to provide further signals or indicia to the receiver to establish authorization, instead of being locked out, without any significant degradation of the security. This process may be accomplished by the receiver entering an alternate mode using two or more successive valid codes to be received, rather than just one. If the two or more successive valid codes are received in this example, the operator will be actuated and the garage door will open. However, in such an embodiment, to prevent a person who has previously or recently recorded a recent valid code from being able to obtain access to the garage, a trailing window is compared to the received code. If the received code is within this trailing window, the response of the system simply is to take no further action, nor to provide authorization during that code cycle due to indications that the code has been purloined.



FIGS. 6-8 demonstrate one potential encryption/decryption scheme. FIG. 6 is an example of trinary code which is actually used to modify the radio frequency oscillator signal. In the depicted example, the bit timing for a 0 is 1.5 milliseconds down time and 0.5 millisecond up time, for a 1, 1 millisecond down and 1 millisecond up, and for a 2, 0.5 millisecond down and 1.5 millisecond up. The up time is actually the active time when carrier is being generated. The down time is inactive when the carrier is cut off. The codes are assembled in two frames, each of 20 trinary bits, with the first frame being identified by a 0.5 millisecond sync bit and the second frame being identified by a 1.5 millisecond sync bit.


Referring now to FIGS. 7A through 7C, the flow chart set forth therein describes one form of generating a rolling code encrypted message from a first device to be transmitted to a second device. A rolling code is incremented by three in a step 500, followed by the rolling code being stored 502 for the next transmission from the device when a button is pushed. The order of the binary digits in the rolling code is inverted or mirrored in a step 504, following which in a step 506, the most significant digit is converted to zero effectively truncating the binary rolling code. The rolling code is then changed to a trinary code having values 0, 1 and 2 and the initial trinary rolling code bit is set to 0. In some forms, the trinary code is actually used to modify the radio frequency oscillator signal, and an example of trinary code is shown in FIG. 6. It may be noted that the bit timing in FIG. 6 for a 0 is 1.5 milliseconds down time and 0.5 millisecond up time, for a 1, 1 millisecond down and 1 millisecond up and for a 2, 0.5 millisecond down and 1.5 milliseconds up. The up time is actually the active time when carrier is being generated or transmitted. The down time is inactive when the carrier is cut off. The codes are assembled in two frames, each of 20 trinary bits, with the first frame being identified by a 0.5 millisecond sync bit and the second frame being identified by a 1.5 millisecond sync bit.


In a step 510, the next highest power of 3 is subtracted from the rolling code and a test is made in a step 512 to determine if the result is greater than zero. If it is, the next most significant digit of the binary rolling code is incremented in a step 514, following which the method returns to the step 510. If the result is not greater than 0, the next highest power of 3 is added to the rolling code in step 516. In step 518, another highest power of 3 is incremented and in a step 518, another highest power of 3 is incremented and in a step 520, a test is determined as to whether the rolling code is completed. If not, control is transferred back to step 510. If the rolling code is complete, step 522 clears the bit counter. In a step 524, a blank timer is tested to determine whether it is active or not. If not, the bit counter is incremented in step 532. However, if the blank timer is active, a test is made in step 526 to determine whether the blank timer has expired. If the blank timer has not expired, control is transferred to a step 528 in which the bit counter is incremented, following which control is transferred back to the decision step 524. If the blank timer has expired as measured in decision step 526, the blank timer is stopped in a step 530 and the bit counter is incremented in a step 532. The bit counter is then tested for odd or even in a step 534. If the bit counter is not even, control is transferred to a step 536 where the output bit of the bit counter divided by 2 is fixed. If the bit counter is even, the output bit counter divided by 2 is rolling in a step 538. The bit counter is tested to determine whether it is set to equal to 80 in a step 540—if yes, the blank timer is started in a step 542, but if not, the bit counter is tested for whether it is equal to 40 in a step 544. If it is, the blank timer is tested and is started in a step 546. If the bit counter is not equal to 40, control is transferred back to step 522.


Referring now to FIGS. 8A through 8F and, in particular, to FIG. 8A, one example of processing of an encrypted message by a second device from a first device is set forth therein. In a step 700, an interrupt is detected and acted upon. The time difference between the last edge is determined and the radio inactive timer is cleared in step 702. A determination is made as to whether this is an active time or inactive time in a step 704, i.e., whether the signal is being sent with carrier or not. If it is an inactive time, indicating the absence of carrier, control is transferred to a step 706 to store the inactive time in the memory and the routine is exited in a step 708. In the event that it is an active time, the active time is stored in memory in a step 710 and the bit counter is tested in a step 712. If the bit counter is zero, control is transferred to a step 714, as may best be seen in FIG. 8B and a test is made to determine whether the inactive time is between 20 milliseconds and 55 milliseconds. If it is not, the bit counter is cleared as well as the rolling code register and the fixed code register in step 716 and the routine is exited in step 718.


In the event that the inactive time is between 20 milliseconds and 55 milliseconds, a test is made in a step 720 to determine whether the active time is greater than 1 millisecond, as shown in FIC. 8C. If it is not, a test is made in a step 722 to determine whether the inactive time is less than 0.35 millisecond. If it is, a frame 1 flag is set in a step 728 identifying the incoming information as being associated with frame 1 and the interrupt routine is exited in a step 730. In the event that the active time test in step 722 is not less than 0.35 millisecond, in the step 724, the bit counter is cleared as well as the rolling code register and the fixed register, and the return is exited in the step 726. If the active time is greater than 1 millisecond as tested in step 720, a test is made in a step 732 to determine whether the active time is greater than 2.0 milliseconds, and if not the frame 2 flag is set in a step 734 and the routine is exited in step 730. If the active time is greater than 2 milliseconds, the bit counter rolling code register and fixed code register are cleared in step 724 and the routine is exited in step 726.


In the event that the bit counter test in step 712 indicates that the bit counter is not 0, control is transferred to setup 736, as shown in FIG. 8A. Both the active and inactive periods are tested to determine whether they are less than 4.5 milliseconds. If either period is not less than 4.5 milliseconds, the bit counter is cleared as well as the rolling code register and the fixed code registers. If both are equal to or greater than 4.5 milliseconds, the bit counter is incremented and the active time is subtracted from the inactive time in the step 738, as shown in FIG. 8D. In the step 740, the results of the subtraction are determined as to whether they are less than 0.38 milliseconds. If they are the bit value is set equal to zero in step 742 and control is transferred to a decision step 743. If the results are not less than 0.38 milliseconds, a test is made in a step 744 to determine if the difference between the active time and inactive time is greater than 0.38 milliseconds and control is then transferred to a step 746 setting the bit value equal to 2. Both of the bit values being set in steps 742 and 746 relate to a translation from the three-level trinary bits 0, 1 and 2 to a binary number.


If the result of the step 744 is in the negative, the bit value is set equal to 1 in step 748. Control is then transferred to the step 743 to test whether the bit counter is set to an odd or an even number. If it is set to an odd number, control is transferred to a step 750 where the fixed code, indicative of the fact that the bit is an odd numbered bit in the frame sequence, rather an even number bit, which would imply that it is one of the interleaved rolling code bits, is multiplied by three and then the bit value added in.


If the bit counter indicates that an odd number trinary bit is being processed, the existing rolling code registers are multiplied by three and then the trinary bit value obtained from steps 742, 746 and 748 is added in. Whether step 750 or 752 occurs, the bit counter value is then tested in the step 754, as shown in FIG. 8E. If the bit counter value is greater than 21, the bit counter rolling code register and fixed code register are cleared in the step 758 and the routine is exited. If the bit counter value is less than 21, there is a return from the interrupt sequence in a step 756. If the bit counter value is equal to 21, indicating that a sink bit plus trinary data bits have been received, a test is made in a step 760 to determine whether the sink bit was indicative of a first or second frame, if it was indicative of a first frame, the bit counter is cleared and set up is done for the second frame following which there is a return from the routine in the step 762. In the event that the second frame is indicated as being received by the decision of step 760, the two frames have their rolling contributions added together to form the complete inverted rolling code. The rolling code is then inverted or mirrored to recover the rolling code counter value in the step 764. A test is made in the step 766 to determine whether the program mode has been set. If it has been set, control is transferred to a step 768 where the code is compared to the last code received. If there is no match, then another code will be read until two successive codes match or the program mode is terminated. In a step 770, the codes are tested such that the fixed codes are tested for a match with a fixed code non-volatile memory. If there is a match, the rolling portion is stored in the memory. If there is not, the rolling portion is stored in the non-volatile memory. Control is then transferred to step 772, the program indicator is switched off, the program mode is exited and there is a return from the interrupt. In the event that the test of step 766 indicates that the program mode has not been set, the program indicator is switched on in a step 774, as shown in FIG. 8F. The codes are tested to determine whether there is a match for the fixed portion of the code in the step 776. If there is no match, the program indicator is switched off and the routine is exited in step 778. If there is a match, the counter which is indicative of the rolling code is tested to determine whether its value is greater than the stored rolling code by a factor or difference of less than 3,000 indicating an interval of 1,000 button pushes for the first device. If it is not, a test is made in the step 786 to determine whether the last transmission from the same first device is with a rolling code that is two to four less than the reception and, if true, is the memory value minus the received rolling code counter value greater than 1,000. If it is, control is transferred to a step 782 switching off the program indicator and setting the operation command word causing a commanded signal to operate the garage door operator. The reception time out timer is cleared and the counter value for the rolling code is stored in non-volatile memory, following which the routine is exited in the step 784. In the event that the difference is not greater than 1,000, in step 786 there is an immediate return from the interrupt in the step 784. In the event that the counter test in the step 780 is positive, steps 782 and 784 are then executed thereafter.



FIGS. 8G and 8H are schematic views of bit processing and parsing (FIG. 8G) and an example message diagram (FIG. 8H) configured in accordance with one example of forming an encrypted message. This provides one example in which a fixed code portion and variable (e.g. rolling) code portion may be used to form an encrypted message. Referring now to FIG. 8G, one illustrative embodiment of bit processing and parsing will be presented. In this example, the only substantive content to be associated and transmitted with a 28 bit rolling code 790 comprises a 40 bit value that represents fixed information 791. This fixed information 791 may serve, for example, to uniquely identify the transmitter that will ultimately transmit this information. In this embodiment, the bits comprising the rolling code 790 are encrypted 792 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 793. 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 793 is presented for further processing as four groups. In this example, these four groups comprise a roll group E 793A comprised of four binary bit pairs, a roll group F 793B comprised of five binary bit pairs, a roll group G 793C comprised of four binary bit pairs, and a roll group H 793D comprised of five binary bit pairs.


The 40 bit fixed information 791 is subdivided in a similar manner albeit, in this embodiment, sans encryption. This comprises, in this particular illustrative approach, forming four subgroups comprising a fixed group A 794A, a fixed group B 794B, a fixed group C 794C, and a fixed group D 794D, 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. 8H to effect a desired transmission. In this example, one or more joint messages 795 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 795 comprises, generally speaking, a first 20 bit portion 796 and a second 30 bit portion 797.


The first portion 796 comprises, in this embodiment, the following fields: “0000”—these bits 796A serve to precharge the decoding process and effectively establish an operational threshold; “1111”—these bits 796B 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 796C 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 796D presents a frame identifier that can be used by a receiver to determine whether all required joint messages 795 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 796E comprise an inversion pattern recovery identifier and are selected from the bits that comprise the encrypted rolling code 793 described above; “B7, B6, B5, B4”—these two bit pairs 796F comprise a bit order pattern recovery identifier and are also selected from the bits that comprise the encrypted rolling code 793 described above.


There are various ways by which these recover identifier values can be selected. By one approach, a specified number of bits from the encrypted roll group can be selected to form a corresponding roll sub-group. These might comprise, for example, the first or the last eight bits of the encrypted roll group (in a forward or reversed order). These might also comprise, for example, any eight consecutive bits beginning with any pre-selected bit position. 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.


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 793 could be used to form the roll sub-group with the last eight bits of the encrypted roll group 793 being used in a similar fashion in an alternating manner. The bits that comprise this roll sub-group may then be further parsed to form two recovery indicators. These recovery indicators may be 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 a portion of the joint message. In some embodiments, roll groups used to form the recovery indicators do not appear in the joint message.



FIGS. 9A, 9B, and 9C are interconnected flow charts that demonstrate a more specific example of the process discussed above with respect to FIGS. 4A-C. In this example, a first device (such as a handheld or vehicle mounted transceiver) commands a second device (such as a garage door operator) to take an action through encrypted transmissions of rolling codes. Throughout FIGS. 9A-C, “1F” refers to a first fixed code, “1R” refers to a first rolling code, “2F” refers to a second fixed code unrelated to 1F, and “2R” refers to a second rolling code unrelated to 1R. “1A,” “2A,” and “3A” each refer to an “adder” that represents a value added to the rolling code or one or more rolls of the rolling code. 1A, 2A, and 3A may be the same or different.


Initially, the first and second devices both have stored in their memories a first fixed code and first variable code from the immediately previous operation involving the first device, as well as a second fixed code and second rolling code from the immediately previous operation involving the second device. When the first device is activated by a user in a manner intended to cause an action by the second device, such as by pressing an activation button (step 801), the first device creates a first message that includes a first fixed code corresponding to the first device (1F) and a first changed version of the first rolling code (1R+1A) representing the rolling code value from the previous operation as modified by a first change protocol (i.e. an algorithm that cycles through a specified number of codes in a sequence or calculates a new value from the initial rolling code value). The changed code (1F 1R+1A) is stored in the memory of the first device, and is also encrypted using one or more encryption methods for transmittal to the second device (step 803). At this point, the initial value of the rolling code (1R) may be optionally deleted from the device memory. The first device also determines 805 a time window (W) or delay in which it expects to receive a response. The time window (W) may be determined from one or both of the rolling code values (1R and/or 1R+1A) or a portion thereof, or from the encrypted message or a portion thereof. For instance, the 1R+1A may include a time within a specific portion of its sequence or the first device may apply an algorithm to 1R+1A or one or more portions thereof in order to calculate a time value for W. For instance, the transmissional characteristics of recovery identifiers (e.g. 796E and/or 796F in FIG. 8H), a portion of the encrypted changing code portion (e.g. part of 797 in FIG. 8H), and/or a portion of the decrypted changing code value may determine the beginning and end of the time window. The time window W may represent a relative time period (e.g. beginning and end points at specific time intervals from a specific action such as the initial button press or the transmission of the first encrypted signal) or an absolute time period (e.g. based on time values according to a time device of the first device (or in communication with the first device) that is synchronized with a time device of the second device (or in communication with the second device)).


The second device, which is in operation mode and awaiting signals (step 802), receives the first encrypted message from the first device, decrypts the message to obtain the first fixed code and first variable code (1F 1R+1A), and stores the new value in its memory (step 804). The second device then compares the first fixed code and first variable code received from the first device (1F 1R+1A) to expected values based on stored code values (e.g. by applying the same algorithm used by the first device to previous first device values stored in the second device's memory (1F 1R)) (step 806). When comparing the received values with stored values, the second device will perform a validation step 807. If the fixed codes match and the received first rolling code (1R+1A) matches an expected value based on the stored rolling code (1R), the second device will continue to communicate with the first device. In order to account for accidental triggering of the first and/or second devices, use of multiple first devices with the second device, or other situations in which the rolling code received from the first device may not exactly match the expected value, this validation step preferably compares the received rolling code (1R+1A) to a set number of values from a series of values that fall within a sequence before and/or after the expected value (i.e. within a window of specified size around the expected value), and consider the message from the first device valid if the received rolling code matches any value within the series. In this way, activation of one device when not in range of the other will not completely desynchronize the two devices and render communication impossible. If the decrypted code values do not match the stored code values, the second device ignores the first message and returns to step 802.


If the received message is validated, the second device calculates 808 a response time window. As depicted in FIG. 9A, the second device calculates the same time window (W) in the same manner calculated by the first device at step 805. In other embodiments, the window or delay calculated at step 808 may be different, such as a shorter time window within W, or a single point in time that falls with W, and may even be calculated or determined from different portions of 1R, 1R+1A, and/or the encrypted message.


In response to validating the first encrypted message, and after determining the response time window, the second device transmits 810 a response within the calculated response time window. The response comprises a second encrypted message derived from a second fixed code (2F) corresponding to the second device and a second rolling code (2R+2A) that is independent from the first changing code and represents a modified version of the second changing code from the immediately previous operation (2R). These values are stored in the second device's memory, so that at this stage the second device memory contains the first fixed and variable code from the previous operation (1F 1R), the second fixed and variable code from the previous operation (2F 2R), the first fixed and variable code from the first encrypted message sent by the first device (1F 1R+1A), and the second fixed and variable code from the encrypted response (2F 2R+2A).


The first device enables a receiver during the time window determined by the first device (step 809) so that it is able to receive the encrypted response from the second device if the response reaches the first device within the determined time window (W). If the response is sent outside of W or for some other reason arrives at the first device outside of W, the response will be ignored because the first device receiver is inactive or programmed to ignore incoming signals. Assuming the response is received by the first device within W, the first device will decrypt the second encrypted message to determine the second fixed code and second rolling code (2F, 2R+2A) (step 811). These values (2, 2R+2A) are stored in the first device's memory, along with the second fixed and variable code from the previous operation (2F 2R) and the first fixed and variable code from the first encrypted message (1F 1R+1A).


The first device then compares the second fixed code and second rolling code (2F 2R+2A) with fixed and variable codes from a previous operation (2F 2R) stored in the memory of the first device (step 812). The first device will then perform a validation step (step 813) similar to the validation step performed by the second device at step 807. If the second fixed code matches the fixed code from the prior operation and the second variable code (2R+2A) matches the prior changing code as modified according to a set of established rules for the changing code, taking into account a predetermined accepted amount of error (e.g. forward-looking window), the response message is considered validated. If the second fixed and variable codes (2F 2R+2A) are determined valid (step 813), the first device generates a message including at least the first fixed code and a changed version of the second rolling code (1F 2R+3A) by applying an algorithm (which may be the same or different as the algorithm used at step 803 and/or step 810) to the rolling code value received from the second device (2R+2A), encrypts the message to create a third encrypted message, stores the new values in its memory, and transmits the third encrypted message to the second device (step 814). If the first device is unable to validate the response from the second device, the process ends and the first device returns to awaiting subsequent activation (801).


The second device receives and decrypts 815 the third encrypted message to determine the first fixed code and the changed version of the second variable code (1F 2R+3A). The second device then compares the fixed codes from the first and third encrypted transmissions to confirm that they were transmitted by the same first device, and the rolling code from the third encrypted message to an expected value based on the last stored second rolling code value (2R+2A from the second encrypted message) (step 816). In a validation step similar to those discussed above, the second device then determines 817 if the third encrypted message is valid. If the third message is validated, the second device performs 818 the requested action associated with activation of the first device. If the second device is unable to validate the third message, it ends the process without performing the requested action and returns to step 802 awaiting signals from the first device.



FIGS. 10A-C illustrate one example of a specific method of pairing a first device to a second device corresponding to the more general method illustrated in FIGS. 5A-C. In this example, a first device (e.g. a user-actuated device) and a second device (e.g. an operator device for carrying out a specific action) are synchronized in order to recognize and validate signals shared between the devices on both ends. Throughout FIGS. 10A-C, “1F” refers to a first fixed code, “1R” refers to a first rolling code, “2F” refers to a second fixed code unrelated to 1F, “2R” refers to a second rolling code unrelated to 1R. “1A,” “2A,” and “3A” each refer to an “adder” that represents a value added to the rolling code or one or more rolls of the rolling code. 1A, 2A, 3A may be the same or different. Each of these values are not necessarily the same as those in FIGS. 9A-C.


The pairing process begins when the first device is activated (such as by a user pressing a button on the device) (step 851) while a second device has been placed in “learn” mode (step 852) (e.g. by pressing a button or switching a lever associated with the second device). To begin, the first device contains within its memory a first fixed (1F) and first variable code (in this case rolling code 1R) that represent initial values or values from previous operation of the first device, and the second device contains a second fixed code (2F) and second variable code (in this case rolling code 2R) that represent initial values or values from previous operation. The fixed codes are each associated with and identify their respective devices, while the rolling codes are independent from one another. When the first device is activated, it generates a first encrypted message from the first fixed code and a modified version of the first rolling code (1F 1R+1A) (step 853), and determines based on at least a portion of the first rolling code or the first encrypted message a time window (W) in which to expect a response from the second device (step 855). The time window may be defined by values within the first rolling code or first encrypted message, or may be calculated therefrom based on an algorithm. A first device receiver is enabled during the time window to receive the response from the second device (step 856).


Meanwhile, the second device receives the first encrypted message while the second device is in the learn mode (step 854) and stores in the second device's memory the decrypted first fixed and first variable codes (1F 1R+1A) from the first encrypted message (step 857) or portions thereof. The second device determines a time window, based on the first encrypted message and/or first rolling code, in which to transmit a response (step 858). The time window determined by the second device may be the same as or within W determined by the first device at step 855, and may be determined in the same or a different manner. The second device then transmits a response comprising an encrypted version of the second fixed code (2F) and a second rolling code (2R) within the determined time window (step 859). Optionally a second rolling code that is independent from the first rolling code may be included in the second encrypted message. The second rolling code may, for instance, begin with a minimum value (such as 00). If the second encrypted message is received by the first device within the time period W calculated for response by the first device, the second message is decrypted (step 860) and the first device stores the second fixed code (and optional second variable code if sent) (step 861). If the response from the first device is not received within the time window, the message is ignored and the pairing process ceases, with the first and second devices returning to steps 851 and 852, respectively.


After receiving within the time window W the response from the second device and storing associated values, and either being set to learn mode by activation of a switch or receipt of a learning indicator from the second device, the first device then transmits a third encrypted message including at least the first fixed code (1F) and a changed version of the first changing code (1R+2A) (step 862). The first device also enables a receiver of the first device in anticipation of receiving further communications from the second device. In some embodiments, this step of enabling reception in the first device (step 863) may include an associated time window derived from the third message.


When the second device receives and decrypts the third encrypted message (step 864), it validates the message by comparing (step 865) the first fixed code and the changed versions of the first changing code (1F 1R+2A) to expected values from stored code values from the first encrypted message (1F 1R+1A) (step 866). If the second device determines that the codes from the third encrypted message (1F 1R+2A) are valid (step 866), the second device then transmits in response to validating the third encrypted message a fourth encrypted message including the second fixed code and a second changing code (2F 2R) (step 867).


The first device receives the fourth encrypted message (step 868) and validates the fourth message by comparing the fixed code of the fourth message to the previously-received fixed code (step 869). If the fixed codes are the same, indicating that both came from the second device, and the fourth message is determined to be valid (step 870), the first device stores the second fixed code and the second rolling code (2F 2R) (step 871). The first and second devices now have stored in their respective memories matching first fixed/rolling and second fixed/rolling code pairs (1F 1R+2A and 2F 2R) that may be used as initial values (1F 1R and 2F 2R) in an operation such as that shown in FIGS. 9A-9C.


Learn mode may operate on the same frequency as operation mode, and may operate on multiple frequencies. In some embodiments the first device and the second device communicate wirelessly in the operation mode and/or the learn mode via one or more frequencies, channels, bands, and radio physical layers or protocols including but not limited to, for example, 300 MHz-400 MHz, 900 MHz, 2.4 GHz, Wi-Fi/WiLAN, Bluetooth, Bluetooth Low Energy (BLE), 3GPP GSM, UMTS, LTE, LTE-A, 5G NR, proprietary radio, and others. In other embodiments, the first device and the second device communicate in the operation mode and/or the learn mode via a wired connection and various protocols including but not limited to two (or more) wire serial communication, Universal Serial Bus (USB), Inter-integrated Circuit (I2C) protocol, Ethernet, control area network (CAN) vehicle bus, proprietary protocol, and others. In some embodiments, the maximum distance between the first device and second device may vary between learn mode and operation mode, while in other modes the maximum range will be the same in both modes due to variation in range from interference.


While there has been illustrated and described particular embodiments of the present invention, 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 examples without departing from the 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. A method of pairing a first device and a second device to effect secure communication between the first device and the second device, the method comprising: transmitting, from the first device, a first encrypted message including a first fixed code and a first changing code;receiving, by the second device, the first encrypted message while the second device is in a learn mode;decrypting, by the second device, the first encrypted message;based on the decrypting of the first encrypted message determining, by the second device, the first fixed code and the first changing code;storing by the second device the first fixed code and the first changing code;transmitting a response from the second device, the response comprising a second encrypted message including a second fixed code;receiving, by the first device, the response comprising the second encrypted message; decrypting, by the first device, the second encrypted message;based on the decrypting of the second encrypted message, determining, by the first device, the second fixed code;storing, by the first device, the second fixed code;transmitting, from the first device, a third encrypted message including the first fixed code and a changed version of the first changing code;receiving, by the second device, and the third encrypted message;decrypting, by the second device, the third encrypted message;based on the decrypting of the third encrypted message; determining, by the second device, the first fixed code and the changed version of the first changing code;validating, by the second device, the third encrypted message;storing, by the second device, the changed version of the first changing code;in response to validating the fourth encrypted message, transmitting, from the second device, a fourth encrypted message including the second fixed code and a second changing code;receiving, by the first device, the fourth encrypted message;decrypting, by the first device, the fourth encrypted message;based on the decrypting of the fourth encrypted message, determining, by the first device, the second fixed code and the second changing code;validating, by the first device, the fourth encrypted message; andin response to validating the fourth encrypted message, storing, by the first device, the second changing code determined from the fourth encrypted message.
  • 2. The method of claim 1, wherein validating the third encrypted message by the second device comprises: comparing the first fixed code and the changed version of the first changing code determined from the third encrypted message to stored values of the first fixed code and the first changing code determined from the first encrypted message; and determining that the first fixed code matches the stored first fixed code and that the changed version of the first changing code matches an expected value based on the stored first changing code.
  • 3. The method of claim 1, wherein validating the fourth encrypted message by the first device comprises comparing the second fixed code determined from the fourth encrypted message to the stored second fixed code determined from the response; and determining that the second fixed code determined from the fourth encrypted message matches the stored second fixed code determined from the response.
  • 4. The method of claim 1, wherein the second device further stores the first fixed code determined from the third encrypted message when storing the changed version of the first changing code, and wherein the first device further stores the second fixed code determined from the fourth encrypted message when storing the second changing code.
  • 5. The method of claim 1, wherein the first device is an in-vehicle transmitter; and wherein the second device is a movable barrier operator.
  • 6. The method of claim 1, wherein the second device is set in the learn mode by actuation of a button of the second device.
  • 7. The method of claim 1, wherein the first fixed code uniquely identifies the first device and the second fixed code uniquely identifies the second device.
  • 8. The method of claim 1, wherein the first encrypted message is transmitted using Bluetooth® or Bluetooth® Low Energy.
  • 9. The method of claim 1, further comprising: based at least on the first encrypted message, determining, by the first device, a time window in which to expect the response from the second device; and determining, by the second device a time to transmit the response based on the first encrypted message, the time being within the time window.
  • 10. A method of pairing a first device and a second device to effect secure communication between the first device and the second device, the method comprising: transmitting, from the first device, a first encrypted message, the first encrypted message including a first fixed code and a first changing code;receiving, by the first device, a response from the second device based on the transmitted first encrypted message;decrypting, by the first device, the response; based on the decrypting of the response, determining, by the first device, a second fixed code associated with the second device;storing, by the first device, the second fixed code in a memory of the first device;transmitting, by the first device, a third encrypted message including the first fixed code and a changed version of the first changing code;based on the transmitted third encrypted message, receiving, at the first device, a fourth encrypted message from the second device; decrypting, by the first device, the fourth encrypted message: based on the decrypting of the fourth encrypted message, determining, by the first device, the second fixed code and a second changing code;validating, by the first device, the fourth encrypted message by confirming that the second fixed code determined from the response and stored in the memory of the first device matches the second fixed code determined from the fourth encrypted message; andstoring, by the first device, the second changing code in the memory of the first device based on validating the fourth encrypted message.
  • 11. The method of claim 10, wherein the first device is an in-vehicle transmitter.
  • 12. The method of claim 10, wherein the first encrypted message is transmitted using Bluetooth® or Bluetooth® Low Energy.
  • 13. The method of claim 10 further comprising storing, by the first device, the second fixed code determined from the fourth encrypted message in the memory of the first device.
  • 14. The method of claim 10, further comprising determining, by the first device, a time window in which to expect the response from the second device.
  • 15. A method of pairing a first device and a second device to effect secure communication between the first device and the second device, the method comprising: receiving, at the second device, while the second device is in a learn mode, a first encrypted message sent from the first device; decrypting, by the second device, the first encrypted message; based on the decrypting of the first encrypted message, determining by the second device, a first fixed code and a first changing code;storing, by the second device, the first fixed code and the first changing code in a memory of the second device;based at least on the first fixed code and the first changing code, transmitting, by the second device, a response including a second fixed code;based on the transmitted response, receiving, by the second device, a third encrypted message from the first device; decrypting, by the second device, the third encrypted message; based on the decrypting of the third encrypted message, determining, by the second device, the first fixed code and a changed version of the first changing code;validating, by the second device, the third encrypted message by confirming the first fixed code determined from the third encrypted message matches the stored first fixed code and the changed version of the first changing code determined from the third encrypted message matches an expected value of the stored first changing code;storing, by the second device, the changed version of the first changing code in the memory of the second device based on validating the third encrypted message; andin response to validating the third encrypted message, transmitting from the second device a fourth encrypted message including the second fixed code and a second changing code.
  • 16. The method of claim 15, wherein the method further comprises deleting the first changing code from the memory upon storing the changed version of the first changing code in the memory of the second device.
  • 17. The method of claim 15, wherein the second device further stores the first fixed code determined from the third encrypted message upon storing the changed version of the first changing code.
  • 18. The method of claim 15, wherein the second device comprises a movable barrier operator.
  • 19. The method of claim 15, further comprising detecting actuation of a button to set the second device in the learn mode.
  • 20. The method of claim 15 wherein the response is transmitted using Bluetooth® or Bluetooth® Low Energy.
  • 21. The method of claim 15, further comprising determining, by the second device, a time window in which to transmit the response based on the first encrypted message.
  • 22. A first device configured to be paired to a second device to effect secure communication between the first device and the second device, the first device comprising: a controller circuit;a transmitter in operative communication with the controller circuit;a receiver in operative communication with the controller circuit; anda memory;wherein the controller circuit is configured to: cause the transmitter to transmit a first encrypted message including a first fixed code and a first changing code;cause the receiver to receive a response from the second device in response to the transmitted first encrypted message;decrypt the response received by the receiver;determine a second fixed code based on the decryption of the response;cause the second fixed code to be stored in the memory;cause the transmitter to transmit a third encrypted message including the first fixed code and a changed version of the first changing code;cause the receiver to receive a fourth encrypted message from the second device in response to the transmitted third encrypted message;decrypt the fourth encrypted message received by the receiver;determine the second fixed code and a second changing code based on the decryption of the fourth encrypted message;validate the fourth encrypted message by confirming that the second fixed code determined from the response and stored in the memory matches the second fixed code determined from the fourth encrypted message; andstore the second changing code in the memory based on validating the fourth encrypted message.
  • 23. The first device of claim 22, wherein the first device is configured to transmit and receive encrypted messages using Bluetooth® or Bluetooth® Low Energy.
  • 24. The first device of claim 22, wherein the controller circuit is further configured to store, in addition to the second changing code, the second fixed code determined from the fourth encrypted message.
  • 25. The first device of claim 22, wherein the controller circuit is further configured to determine a time window in which to expect the response from the second device.
  • 26. A second device configured to be paired to a first device to effect secure communication between the first device and the second device, the second device comprising: a controller circuit;a transmitter in operative communication with the controller circuit;a receiver in operative communication with the controller circuit; anda memory;wherein, when the second device is set to a learn mode, the controller circuit is configured to: cause the receiver to receive a first encrypted message from the first device,decrypt the first encrypted message received by the receiver; based on the decryption of the first encrypted message, determine a first fixed code and a first changing code;store the first fixed code and the first changing code in the memory;cause the transmitter to transmit a response including a second fixed code;cause the receiver to receive a third encrypted message from the first device in response to the transmitted response;decrypt the third encrypted message received by the receiver to; based on the decryption of the third encrypted message, determine the first fixed code and a changed version of the first changing code;validate the third encrypted message by confirming the first fixed code determined from the third encrypted message matches the stored first fixed code and the changed version of the first changing code determined from the third encrypted message matches an expected value of the stored first changing code;store the changed version of the first changing code in the memory based on validating the third encrypted message; andcause the transmitter to transmit a fourth encrypted message that is receivable by the first device, the fourth encrypted message including the second fixed code and a second changing code in response to validating the third encrypted message.
  • 27. The second device of claim 26, wherein the controller circuit is further configured to delete the first changing code from the memory upon storing the changed version of the first changing code.
  • 28. The second device of claim 26, wherein the controller circuit is further configured to store the first fixed code determined from the third encrypted message upon storing the changed version of the first changing code.
  • 29. The second device of claim 26, wherein the second device comprises a movable barrier operator.
  • 30. The second device of claim 26, wherein the receiver and the transmitter are configured to receive and transmit encrypted messages using Bluetooth® or Bluetooth® Low Energy.
  • 31. The method of claim 1, further comprising: in response to validating the fourth encrypted message, pairing the first device and the second device to effect the secure communication between the first device and the second device.
  • 32. The method of 31, further comprising:
  • 33. The method of claim 32, wherein the action is one of the following: lifting a moveable harrier structure, lowering the moveable barrier structure, repositioning the moveable barrier structure, sliding the moveable barrier structure, swinging the moveable barrier structure, or rotating the moveable barrier structure.
  • 34. The method of claim 10, further comprising, in response to validating the fourth encrypted message, pairing the first device and the second device to effect the secure communication between the first device and the second device.
  • 35. The method of claim 34, further comprising, upon pairing the first device and the second device, transmitting, by the first device, a request causing the second device to perform one of the following: lifting a moveable barrier structure, lowering the moveable barrier structure, repositioning the moveable barrier structure, sliding the moveable barrier structure, swinging the Moveable barrier structure, or rotating the moveable barrier structure.
  • 36. The method of claim 15, wherein transmitting the fourth encrypted message including the second fixed code and the second changing code facilitates the pairing of the first device and the second device.
  • 37. The method of claim 36, further comprising: upon the pairing the first device and the second device, receiving, from the first device, a request to perform an action, the action comprising one of the following: lifting a moveable barrier structure, lowering the moveable barrier structure, repositioning the moveable barrier structure, sliding the moveable barrier structure, swinging the moveable barrier structure, or rotating the moveable barrier structure; andbased on the request, the action is performed by the second device.
  • 38. The first device of claim 22, wherein the controller circuit is configured to, in response to validating the fourth encrypted message, pair the first device and the second device to effect the secure communication between the first device and the second device.
  • 39. The first device of claim 38, wherein the controller circuit is further configured to, upon pairing the first device and the second device, cause the transmitter to transmit a request received by the second device, the request causing the second device to perform one of the following: lifting a moveable barrier structure, lowering the moveable barrier structure, repositioning the moveable barrier structure, sliding the moveable barrier structure, swinging the moveable barrier structure, or rotating the moveable barrier structure.
  • 40. The second device of claim 26, wherein transmitting the fourth encrypted message including the second fixed code and the second changing code facilitates the pairing of the first device and the second device.
  • 41. The second device of claim 40, wherein the controller circuit is further configured to; upon the pairing of the first device and the second device, receive, from the first device, a request to perform an action, the action comprising one of the following: lifting a nameable barrier structure, lowering the moveable barrier structure, repositioning the moveable barrier structure, sliding the moveable barrier structure, swinging the moveable barrier structure, or rotating the moveable barrier structure; andbased on the request, perform the action by the second device.
CROSS REFERENCE TO RELATED APPLICATION

This is a continuation of U.S. patent application Ser. No. 16/843,119, filed Apr. 8, 2020, entitled SECURITY SYSTEM FOR A MOVEABLE BARRIER OPERATOR, which is a continuation of U.S. patent application Ser. No. 16/226,066, filed Dec. 19, 2018, entitled SECURITY SYSTEM FORA MOVEABLE BARRIER OPERATOR, which claims the benefit of U.S. Provisional Patent Application No. 62/608,977, filed Dec. 21, 2017, each of which are hereby incorporated by reference in their entireties.

US Referenced Citations (651)
Number Name Date Kind
29525 Sherman Aug 1860 A
30957 Campbell Dec 1860 A
35364 Cox May 1862 A
803047 Browne Oct 1905 A
2405500 Gustav Aug 1946 A
2963270 Magarian Dec 1960 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
5220263 Onishi Jun 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
5596317 Brinkmeyer Jan 1997 A
5598475 Soenen Jan 1997 A
5600653 Chitre Feb 1997 A
5608723 Felsenstein Mar 1997 A
5614891 Zeinstra Mar 1997 A
5635913 Willmott Jun 1997 A
5657388 Weiss Aug 1997 A
5673017 Dery Sep 1997 A
5675622 Hewitt Oct 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
5872513 Fitzgibbon Feb 1999 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
5969637 Doppelt Oct 1999 A
6012144 Pickett Jan 2000 A
6037858 Seki Mar 2000 A
6049289 Waggamon Apr 2000 A
6052408 Trompower Apr 2000 A
6070154 Tavor May 2000 A
6094575 Anderson et al. Jul 2000 A
6130602 O'Toole Oct 2000 A
6137421 Dykema Oct 2000 A
6140938 Flick Oct 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
6229434 Knapp May 2001 B1
6243000 Tsui Jun 2001 B1
6275519 Hendrickson Aug 2001 B1
6366051 Nantz Apr 2002 B1
6396446 Walstra May 2002 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
6609796 Maki et al. Aug 2003 B2
6640244 Bowman-Amuah Oct 2003 B1
6658328 Alrabady Dec 2003 B1
6688518 Valencia Feb 2004 B1
6690796 Farris Feb 2004 B1
6697379 Jacquet Feb 2004 B1
6703941 Blaker Mar 2004 B1
6754266 Bahl Jun 2004 B2
6778064 Yamasaki Aug 2004 B1
6810123 Farris Oct 2004 B2
6829357 Alrabady Dec 2004 B1
6842106 Hughes Jan 2005 B2
6850910 Yu Feb 2005 B1
6861942 Knapp Mar 2005 B1
6917801 Witte Jul 2005 B2
6930983 Perkins Aug 2005 B2
6956460 Tsui Oct 2005 B2
6963270 Gallagher, III Nov 2005 B1
6963561 Lahat Nov 2005 B1
6978126 Blaker Dec 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
7088265 Tsui Aug 2006 B2
7088706 Zhang et al. Aug 2006 B2
7139398 Candelore Nov 2006 B2
7161466 Chuey Jan 2007 B2
7205908 Tsui Apr 2007 B2
7221256 Skekloff May 2007 B2
7257426 Witkowski Aug 2007 B1
7266344 Rodriquez Sep 2007 B2
7289014 Mullet Oct 2007 B2
7290886 Cheng Nov 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
7346374 Witkowski Mar 2008 B2
7349722 Witkowski 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
7469129 Blaker Dec 2008 B2
7489922 Chuey Feb 2009 B2
7492898 Farris et al. Feb 2009 B2
7492905 Fitzgibbon Feb 2009 B2
7493140 Michmerhuizen Feb 2009 B2
7516325 Willey Apr 2009 B2
7532965 Robillard May 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
7839263 Shearer Nov 2010 B2
7839851 Kozat Nov 2010 B2
7855633 Chuey Dec 2010 B2
7864070 Witkowski Jan 2011 B2
7889050 Witkowski Feb 2011 B2
7911358 Bos Mar 2011 B2
7920601 Andrus Apr 2011 B2
7970446 Witkowski Jun 2011 B2
7973678 Petricoin, Jr. Jul 2011 B2
7979173 Breed Jul 2011 B2
7999656 Fisher Aug 2011 B2
8000667 Witkowski Aug 2011 B2
8014377 Zhang et al. Sep 2011 B2
8031047 Skekloff Oct 2011 B2
8049595 Olson Nov 2011 B2
8103655 Srinivasan Jan 2012 B2
8111179 Turnbull Feb 2012 B2
8130079 Mcquaide, Jr. et al. Mar 2012 B2
8138883 Shearer Mar 2012 B2
8174357 Geerlings May 2012 B2
8194856 Farris Jun 2012 B2
8200214 Chutorash Jun 2012 B2
8207818 Keller, Jr. Jun 2012 B2
8208888 Chutorash Jun 2012 B2
8209550 Gehrmann Jun 2012 B2
8225094 Willey Jul 2012 B2
8233625 Farris Jul 2012 B2
8253528 Blaker Aug 2012 B2
8264333 Blaker Sep 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
8311490 Witkowski Nov 2012 B2
8330569 Blaker Dec 2012 B2
8384513 Witkowski Feb 2013 B2
8384580 Witkowski Feb 2013 B2
8416054 Fitzgibbon Apr 2013 B2
8422667 Fitzgibbon Apr 2013 B2
8452267 Friman May 2013 B2
8463540 Hannah et al. Jun 2013 B2
8494547 Nigon Jul 2013 B2
8531266 Shearer Sep 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
8634888 Witkowski Jan 2014 B2
8643465 Fitzgibbon Feb 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
8837608 Witkowski Sep 2014 B2
8843066 Chutorash Sep 2014 B2
8878646 Chutorash Nov 2014 B2
8918244 Brzezinski Dec 2014 B2
8981898 Sims Mar 2015 B2
9007168 Bos Apr 2015 B2
9024801 Witkowski May 2015 B2
9082293 Wellman et al. Jul 2015 B2
9122254 Cate Sep 2015 B2
9124424 Aldis Sep 2015 B2
9142064 Muetzel et al. Sep 2015 B2
9160408 Krohne et al. Oct 2015 B2
9189952 Chutorash Nov 2015 B2
9229905 Penilla Jan 2016 B1
9230378 Chutorash Jan 2016 B2
9264085 Pilat Feb 2016 B2
9280704 Lei et al. Mar 2016 B2
9317983 Ricci Apr 2016 B2
9318017 Witkowski Apr 2016 B2
9324230 Chutorash Apr 2016 B2
9336637 Neil et al. May 2016 B2
9367978 Sullivan Jun 2016 B2
9370041 Witkowski Jun 2016 B2
9396376 Narayanaswami Jul 2016 B1
9396598 Daniel-Wayman Jul 2016 B2
9413453 Sugitani et al. Aug 2016 B2
9418326 Narayanaswami Aug 2016 B1
9430939 Shearer Aug 2016 B2
9443422 Pilat Sep 2016 B2
9449449 Evans Sep 2016 B2
9539930 Geerlings Jan 2017 B2
9552723 Witkowski Jan 2017 B2
9576408 Hendricks Feb 2017 B2
9614565 Pilat Apr 2017 B2
9620005 Geerlings Apr 2017 B2
9640005 Geerlings May 2017 B2
9652907 Geerlings May 2017 B2
9652978 Wright May 2017 B2
9679471 Geerlings Jun 2017 B2
9691271 Geerlings Jun 2017 B2
9711039 Shearer Jul 2017 B2
9715772 Bauer Jul 2017 B2
9715825 Geerlings Jul 2017 B2
9791861 Keohane Oct 2017 B2
9811085 Hayes Nov 2017 B1
9811958 Hall Nov 2017 B1
9819498 Vuyst Nov 2017 B2
9836905 Chutorash Dec 2017 B2
9836955 Papay Dec 2017 B2
9836956 Shearer Dec 2017 B2
9858806 Geerlings Jan 2018 B2
9875650 Witkowski Jan 2018 B2
9879466 Yu Jan 2018 B1
9916769 Wright Mar 2018 B2
9922548 Geerlings Mar 2018 B2
9947159 Geerlings Apr 2018 B2
9965947 Geerlings May 2018 B2
9984516 Geerlings May 2018 B2
10008109 Witkowski Jun 2018 B2
10045183 Chutorash Aug 2018 B2
10062229 Zeinstra Aug 2018 B2
10096186 Geerlings Oct 2018 B2
10096188 Geerlings Oct 2018 B2
10097680 Bauer Oct 2018 B2
10127804 Geerlings Nov 2018 B2
10147310 Geerlings Dec 2018 B2
10163337 Geerlings Dec 2018 B2
10163366 Wright Dec 2018 B2
10176708 Geerlings Jan 2019 B2
10198938 Geerlings Feb 2019 B2
10217303 Hall Feb 2019 B1
10229548 Daniel-Wayman Mar 2019 B2
10282977 Witkowski May 2019 B2
10553050 Romero Feb 2020 B1
10614650 Minsley Apr 2020 B2
10652743 Fitzgibbon May 2020 B2
10997810 Atwell May 2021 B2
11074773 Morris Jul 2021 B1
11122430 Fitzgibbon Sep 2021 B2
11423717 Cate Aug 2022 B2
11462067 Atwell Oct 2022 B2
20010023483 Kiyomoto Sep 2001 A1
20020034303 Farris Mar 2002 A1
20020075133 Flick Jun 2002 A1
20020083178 Brothers Jun 2002 A1
20020183008 Menard Dec 2002 A1
20020184504 Hughes Dec 2002 A1
20020191785 McBrearty Dec 2002 A1
20020191794 Farris Dec 2002 A1
20030025793 McMahon Feb 2003 A1
20030033540 Fitzgibbon Feb 2003 A1
20030051155 Martin Mar 2003 A1
20030056001 Mate Mar 2003 A1
20030070092 Hawkes Apr 2003 A1
20030072445 Kuhlman Apr 2003 A1
20030118187 Fitzgibbon Jun 2003 A1
20030141987 Hayes Jul 2003 A1
20030147536 Andivahis Aug 2003 A1
20030177237 Stebbings Sep 2003 A1
20030189530 Tsui Oct 2003 A1
20030190906 Winick Oct 2003 A1
20030191949 Odagawa Oct 2003 A1
20030227370 Brookbank Dec 2003 A1
20040019783 Hawkes Jan 2004 A1
20040046639 Giehler Mar 2004 A1
20040054906 Carro Mar 2004 A1
20040081075 Tsukakoshi Apr 2004 A1
20040174856 Brouet Sep 2004 A1
20040179485 Terrier Sep 2004 A1
20040181569 Attar Sep 2004 A1
20040257200 Baumgardner Dec 2004 A1
20050030153 Mullet Feb 2005 A1
20050046545 Skekloff Mar 2005 A1
20050053022 Zettwoch Mar 2005 A1
20050058153 Santhoff Mar 2005 A1
20050060555 Raghunath Mar 2005 A1
20050101314 Levi May 2005 A1
20050151667 Hetzel Jul 2005 A1
20050174242 Cohen Aug 2005 A1
20050285719 Stephens Dec 2005 A1
20060020796 Aura Jan 2006 A1
20060046794 Scherschel Mar 2006 A1
20060083187 Dekel Apr 2006 A1
20060097843 Libin May 2006 A1
20060103503 Rodriguez May 2006 A1
20060109978 Farris May 2006 A1
20060164208 Schaffzin Jul 2006 A1
20060176171 Fitzgibbon Aug 2006 A1
20060224512 Kurakata Oct 2006 A1
20060232377 Witkowski Oct 2006 A1
20070005806 Fitzgibbon Jan 2007 A1
20070006319 Fitzgibbon Jan 2007 A1
20070018861 Fitzgibbon Jan 2007 A1
20070058811 Fitzgibbon Mar 2007 A1
20070167138 Bauman Jul 2007 A1
20070245147 Okeya Oct 2007 A1
20080194291 Martin Aug 2008 A1
20080224886 Rodriguez et al. Sep 2008 A1
20080229400 Burke Sep 2008 A1
20080291047 Summerford Nov 2008 A1
20080297370 Farris Dec 2008 A1
20080303630 Martinez 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
20090313095 Hurpin Dec 2009 A1
20090315672 Nantz et al. Dec 2009 A1
20100029261 Mikkelsen Feb 2010 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
20100159846 Witkowski Jun 2010 A1
20100199092 Andrus et al. Aug 2010 A1
20100211779 Sundaram Aug 2010 A1
20110037574 Pratt Feb 2011 A1
20110051927 Murray et al. Mar 2011 A1
20110205014 Fitzgibbon Aug 2011 A1
20110218965 Lee Sep 2011 A1
20110225451 Leggette Sep 2011 A1
20110227698 Witkowski Sep 2011 A1
20110273268 Bassali Nov 2011 A1
20110287757 Nykoluk Nov 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
20120133841 Vanderhoff May 2012 A1
20120191770 Perlmutter Jul 2012 A1
20120254960 Lortz Oct 2012 A1
20120297681 Krupke et al. Nov 2012 A1
20130017812 Foster Jan 2013 A1
20130063243 Witkowski Mar 2013 A1
20130088326 Bassali Apr 2013 A1
20130147600 Murray Jun 2013 A1
20130170639 Fitzgibbon Jul 2013 A1
20130268333 Ovick et al. Oct 2013 A1
20130272520 Noda et al. Oct 2013 A1
20130304863 Reber Nov 2013 A1
20140125499 Cate May 2014 A1
20140169247 Jafarian et al. Jun 2014 A1
20140245284 Alrabady Aug 2014 A1
20140266589 Wilder Sep 2014 A1
20140282929 Tse Sep 2014 A1
20140289528 Baghdasaryan Sep 2014 A1
20140327690 Mcguire Nov 2014 A1
20140361866 Evans Dec 2014 A1
20150002262 Geerlings Jan 2015 A1
20150022436 Cho Jan 2015 A1
20150084750 Fitzgibbon Mar 2015 A1
20150116082 Cregg Apr 2015 A1
20150139423 Hildebrandt May 2015 A1
20150161832 Esselink Jun 2015 A1
20150187019 Fernandes Jul 2015 A1
20150193999 Freese et al. Jul 2015 A1
20150222436 Morten Aug 2015 A1
20150222517 Mclaughlin et al. Aug 2015 A1
20150235172 Hall Aug 2015 A1
20150235173 Hall Aug 2015 A1
20150235493 Hall Aug 2015 A1
20150235495 Hall Aug 2015 A1
20150261521 Choi Sep 2015 A1
20150310737 Simanowski Oct 2015 A1
20150310765 Wright Oct 2015 A1
20150358814 Roberts Dec 2015 A1
20160009188 Yokoyama Jan 2016 A1
20160020813 Pilat Jan 2016 A1
20160021140 Fitzgibbon Jan 2016 A1
20160043762 Turnbull Feb 2016 A1
20160101736 Geerlings Apr 2016 A1
20160104374 Ypma Apr 2016 A1
20160125357 Hall May 2016 A1
20160145903 Taylor May 2016 A1
20160196706 Tehranchi Jul 2016 A1
20160198391 Orthmann et al. Jul 2016 A1
20160203721 Wright Jul 2016 A1
20160258202 Scalisi Sep 2016 A1
20160261572 Liu et al. Sep 2016 A1
20160359629 Nadathur Dec 2016 A1
20170061110 Wright Mar 2017 A1
20170079082 Papay Mar 2017 A1
20170113619 Boehm Apr 2017 A1
20170140643 Puppo May 2017 A1
20170225526 Tomakidi Aug 2017 A1
20170230509 Lablans Aug 2017 A1
20170316628 Farber Nov 2017 A1
20170320464 Schultz Nov 2017 A1
20170323498 Bauer Nov 2017 A1
20170352286 Witkowski Dec 2017 A1
20170364719 Boehm Dec 2017 A1
20170372574 Linsky Dec 2017 A1
20180052860 Hayes Feb 2018 A1
20180053237 Hayes Feb 2018 A1
20180118045 Gruzen May 2018 A1
20180123806 Vuyst May 2018 A1
20180184376 Geerlings Jun 2018 A1
20180225959 Witkowski Aug 2018 A1
20180232981 Geerlings Aug 2018 A1
20180234843 Smyth Aug 2018 A1
20180245559 Kang Aug 2018 A1
20180246515 Iwama Aug 2018 A1
20180276613 Hall Sep 2018 A1
20180285814 Hall Oct 2018 A1
20180367419 Hall Dec 2018 A1
20190082149 Correnti Mar 2019 A1
20190085615 Cate Mar 2019 A1
20190102962 Miller Apr 2019 A1
20190200225 Fitzgibbon Jun 2019 A1
20190208024 Jablonski Jul 2019 A1
20190228603 Fowler Jul 2019 A1
20190244448 Alamin Aug 2019 A1
20200027054 Hall Jan 2020 A1
20200043270 Cate Feb 2020 A1
20200074753 Adiga Mar 2020 A1
20200208461 Virgin Jul 2020 A1
20200236552 Fitzgibbon Jul 2020 A1
20200364961 Atwell Nov 2020 A1
20210248852 Atwell Aug 2021 A1
20210281405 Fitzgibbon et al. Sep 2021 A1
20210358239 Key Nov 2021 A1
Foreign Referenced Citations (102)
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
2551295 Dec 2006 CA
2926281 Feb 2008 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
102010015104 Nov 1957 DE
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
102006003808 Nov 2006 DE
102007036647 Feb 2008 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
0870889 Oct 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
20050005150 Jan 2005 KR
20060035951 Apr 2006 KR
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
2008082482 Jul 2008 WO
2011106199 Sep 2011 WO
2019126453 Jun 2019 WO
8908225 Oct 1991 ZA
Non-Patent Literature Citations (260)
Entry
US 7,902,994 B2, 03/2011, Geerlings (withdrawn)
US 10,135,479 B2, 11/2018, Turnbull (withdrawn)
‘Access Transmitters—Access Security System’, pp. 1-2, Dated Jul. 16, 1997. http://www.webercreations.com/access/security.html.
About us—ParqEx, 5 pages, Wayback Machine capture dated May 5, 2018, 5 pages, retrieved from https://web.archive.org/web/20180505051951/https://www.parqex.com/about-parqex/.
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); Date of Search: Sep. 30, 2011.
British Search Report Under Section 17; British Patent Application No. GB0601795.8; Date of Search: May 22, 2006.
British Search Report Under Section 17; British Patent Application No. GB0613068.6; Date of Search: Aug. 23, 2006.
British Search Report Under Section 17; British Patent Application No. GB0715089.9; Date of Search: May 9, 2008.
British Search Report Under Section 17(5); British Patent Application No. GB0613068.6; Date of Search: 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.
Cattermole, K.W., ‘Principles of Pulse Code Modulation’ lliffe 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.
Chinese Application No. 201880083263X; First Office Action dated Oct. 3, 2021; Our File No. 5569-144653-CN; 25 Pages.
Combined Search and Examination Reports Under Sections 17 and 18(3); British Patent Application No. GB0920612.9; Date of Search: 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, Martin 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).
European Patent Application No. 10 183 420.8; Communication Pursuant to Article 94(3) EPC dated May 4, 2020.
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; Date of Search: Jan. 28, 2010.
Examination Report Under Section 18(3) From British Patent Application No. GB0601795.8; Date of Search: Sep. 25, 2009.
Examination Report Under Section 18(3) From British Patent Application No. GB0613068.6; Date of Search: 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; Date of Search: Sep. 30, 2010.
Examination Report Under Section 18(3) From British Patent Application No. GB0920612.9; Date of Search: 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).
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 and Written Opinion; PCT/US2019/044358 dated Nov. 17, 2019, 14 pages.
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).
Nirdhar Khazanie and Yossi Matias, Growing Eddystone with Ephemeral Identifiers: A Privacy Aware & Secure Open Beacon Format; Google Developers; Thursday, Apr. 14, 2016; 6 pages.
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.
PCT Patent Application No. PCT/US2018/066722; International Search Report and Written Opinion; dated Apr. 1, 2019.
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).
Schedule of Confidential Non-Patent Literature Documents; Apr. 1, 2008.
Search Report Under Section 17 From British Patent Application No. GB0601795.8; Date of Search: Apr. 22, 2009.
Search Report Under Section 17, Application No. GB0715089.9; Date of Search: Nov. 27, 2007.
Seberry, J. and Pieprzyk, Cryptography—An Introduction to Computer Security, Prentice Hall of Australia, YTY Ltd, 1989, pp. 134-136.
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.
SpotHero, Frequently Asked Questions, Wayback Machine capture dated Jun. 30, 2017, 3 pages, retrieved from https://web.archive.org/web/20170630063148/https://spothero.com/faq/.
Steven Dawson, Keeloq.RTM. Code Hopping Decoder Using Secure Learn, AN662, 1997 Microchip Technology, Inc., 1-16.
Summary of Spothero Product, publicly available before Aug. 1, 2018.
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.
U.S. Appl. No. 16/528,376; Advisory Action dated May 4, 2021; 4 pages.
U.S. Appl. No. 17/194,923, filed Mar. 8, 2021; 34 pages.
U.S. Appl. No. 17/245,672, filed Apr. 30, 2021, 47 pages.
Uber, Airbnb and consequences of the sharing economy: Research roundup, Harvard Kennedy School—Shorenstein Center on Media, Politics, and Public Policy, 14 pages, Jun. 3, 2016, retrieved from https://journalistsresource.org/studies/economics/business/airbnb-lyft-uber-bike-share-sharing-economy-research-roundup/.
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. 16/454,978; Notice of Allowance dated Feb. 16, 2021, 9 pages.
U.S. Appl. No. 16/454,978; Notice of Allowance dated Feb. 16, 2021.
U.S. Appl. No. 16/871,844; Notice of Allowance dated Feb. 23, 2021.
U.S. Appl. No. 16/454,978, filed Jun. 27, 2019; 57 pages.
U.S. Appl. No. 16/454,978; Office Action dated May 8, 2020; 25 pages.
U.S. Appl. No. 16/454,978; Office Action dated Sep. 22, 2020; 36 pages.
U.S. Appl. No. 16/528,376; Office Action dated Feb. 17, 2021; (pp. 1-14).
U.S. Appl. No. 16/528,376; Office Action dated Aug. 18, 2020, (pp. 1-11).
U.S. Appl. No. 16/871,844; Notice of Allowance dated Feb. 23, 2021; (pp. 1-6).
U.S. Appl. No. 16/871,844; Notice of Allowance dated Mar. 23, 2021; (pp. 1-5).
U.S. Appl. No. 16/871,844; Notice of Allowance dated Dec. 28, 2020; 38 pages.
U.S. Appl. No. 16/871,844; Notice of Allowance dated Dec. 28, 2020; (pp. 1-10).
U.S. Appl. No. 14/867,633; Notice of Allowance dated Apr. 1, 2020; (pp. 1-8).
U.S. Appl. No. 14/867,844; Notice of Allowance dated Dec. 28, 2020; (pp. 1-38).
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).
U.S. Appl. No. 16/226,066; Notice of Allowance dated Jan. 9, 2020; (pp. 1-9).
U.S. Appl. No. 16/226,066; Supplemental Notice of Allowability dated Feb. 6, 2020; (pp. 1-2).
U.S. Appl. No. 16/528,376; Office Action dated Aug. 18, 2020; 34 Pages.
U.S. Appl. No. 16/843,119; Office Action dated Feb. 2, 2021, 24 pages.
U.S. Appl. No. 16/843,119; Supplemental Notice of Allowability dated May 25, 2021, 2 pages.
U.S. Appl. No. 16/843,119; Notice of Allowance dated May 11, 2021, 5 pages.
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.
YouTube Video entitled “How to Set up Tesla Model 3 Homelink . . . Super Easy!!!!” https://www.youtube.com/watch?v=nmmy4i7FO5M; published Mar. 1, 2018.
YouTube Video entitled Tesla Model X Auto Park in Garage (Just Crazy), https://youtu.be/BszlChMuZV4, published Oct. 2, 2016.
U.S. Appl. No. 17/245,672; Notice of Allowance and Fees Due (PTOL-85) dated Sep. 2, 2022; (pp. 1-2).
PCT Patent Application No. PCT/US2021/065227; International Search Report and The Written Opinion; dated May 12, 2022; 11 Pages.
European Patent Application No. 18 833 794.3-1009; Communication Pursuant to Article 94(3) EPC.
Korean Patent Application No. 10-2020-7020761; Office Action dated Apr. 29, 2022, With Translation.
U.S. Appl. No. 17/245,672; Notice of Allowance and Fees Due (PTOL-85) dated May 2, 2022; (pp. 1-5).
USPTO; U.S. Appl. No. 17/879,927; Non-Final Rejection dated May 23, 2023 (pp. 1-8).
Office Action, dated Mar. 31, 2023, by the CIPO, regarding Canada Patent Application No. 3,085,470, 10 pages.
Related Publications (1)
Number Date Country
20210385651 A1 Dec 2021 US
Provisional Applications (1)
Number Date Country
62608977 Dec 2017 US
Continuations (2)
Number Date Country
Parent 16843119 Apr 2020 US
Child 17405671 US
Parent 16226066 Dec 2018 US
Child 16843119 US