US 7,492,898 B2Grant

Rolling code security system

Issue Date:2009-02-17

•34 Claims

•17 Drawing Sheets

Abstract

A rolling code transmitter is useful in a security system for providing secure encrypted RF transmission comprising an interleaved trinary bit fixed code and rolling code. A receiver demodulates the encrypted RF transmission and recovers the fixed code and rolling code. Upon comparison of the fixed and rolling codes with stored codes and determining that the signal has emanated from an authorized transmitter, a signal is generated to actuate an electric motor to open or close a movable barrier.

Metadata

Assignee

The Chamberlain Group, Inc.

Inventors

Bradford L. Farris
James J. Fitzgibbon

Application Information

Application Number:US 10/884,051

Filing Date:2004-07-02

Priority Date:1995-05-17

Art Unit:2135

Classifications

IPC:

H04N7/167H04L9/00

Patent Drawings (17 sheets)

Description

Related Applications

[0001] This application is a continuation of U.S. application Ser. No. 10/215,900 filed Aug. 9, 2002, now U.S. Pat. No. 6,810,123, which is a continuation of U.S. application Ser. No. 09/981,433 filed Oct. 17, 2001, now U.S. Pat. No. 6,980,655, which is a continuation of U.S. application Ser. No. 09/489,073 filed Jan. 21, 2000, now U.S. Pat. No. 6,690,796, which is a divisional application of U.S. application Ser. No. 08/873,149 filed Jun. 11, 1997, now U.S. Pat. No. 6,154,544, which is a continuation of U.S. application Ser. No. 08/446,886 filed May 17, 1995, now abandoned, each of which is incorporated in their entirety herein by reference.

Background of the Invention

[0002] The invention relates in general to security systems which 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 which communicate via code streams having at least a portion thereof which charges with multiple operation of the device.

[0003] It is well known in the art to provide garage door operators or other barrier operators which include an electric motor connectable through a transmission to a door or other movable barrier which is to be opened and closed. Since 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 which the barrier protects. Some garage door operator systems have in the passed 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, they are very inconvenient to use for a person because it necessitates them exiting their vehicle in order to send the command to open the garage door. This also may present some danger to people when the exit the relative security of their vehicle if someone may be waiting to do injury to them.

[0004] It 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 be driven from the radio receiver. The radio receiver is adapted to receive radio frequency signals or other electromagnetic signals having particular signal characteristics which, when received, cause the door to be opened. More recently, such transmitter and receiver systems have become relatively more sophisticated in that they use radio transmitters which employ 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,349 to Willmott, which employs a transmitter and receiver system wherein a plurality of mechanical switches may be used to set a stored authorization code.

[0005] 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 transmitter 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.

[0006] While each of these devices have provided good security for the user, it is apparent that persons wishing 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.

[0007] Transequatorial Technology, Inc. sells integrated circuit code hopping encoders identified as Keeloq Model NTQ105, NTQ115, NTQ125D and NTQ129. Some of the keeloq code hopping encoders generate serial codes having fixed portions, i.e., which do not change with repeated actuation of the encoding portion of the chip and rolling code portions which alter with each actuation of the encoding portion of the chip. In order to avoid, however, having the problem of the encoding portion of the chip having been inadvertently enabled and causing the rolling code to be altered on successive enabling attempts thereby leading to a rolling code which is transmitted and not recognized by a receiver, the keeloq code hopping encoders provide a window forward system, that is they are operable with systems having a 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. The problem with such a system, however, might arise if a user was away for a period of time or had inadvertently caused codes to be transmitted excluding the number of codes normally allowed within the valid forward code window. In that case, the rolling code would not be recognized by the receiver and the user could not gain entry without taking other measures to defeat the locking system or the garage door operator system which might involve the intervention of a trained engineer or technician.

[0008] Texas Instruments also has a prior systems identified as the Mark Star TRC1300 and TRC1315 remote control transmitter/receiver combination. The system involves the use of a rolling code encoder which increments or rolls potentially the entire code, that is it does not leave a fixed portion. The system also includes a forward windowing function which allows an authorized user to be able to cause the receiver to be enabled within a limited number of key pushes. Like the keeloq system, if the forward window is exceeded, the Texas Instruments systems must be placed in a learn mode to cause the system to relearn the code. In order to place the system into the learn mode, the person must obtain direct access to the receiver to cause a programming control system associated with the receiver to be hand actuated causing the receiver to enter a learn mode. Once the receiver has learned the new code, the receiver will then construct a new valid forward code window within which valid rolling codes may be received. The problem, of course, with such a system is that if, for instance in a garage door operator, the only portal of entry to the garage door is through the overhead door controlled by the garage door operator, the user will not be able to obtain entry to the garage without possibly having to do some damage to the structure. This problem is sometimes referred to in the industry as a “vaulted garage.”

[0009] What is needed is an economical encoding system which provides good security by using a rolling code, but which enables a user of the system to proceed via a gradually degraded pathway in the event that the receiver detects a signal condition indicative of what might be a lack of security.

Summary of the Invention

[0010] The invention relates in general to an electronic system for providing remote security for entry of actuation of a particular device. Such a system may include a transmitter and receiver set, for instance with a hand-held transmitter and a receiver associated with a vehicle such as an automobile or the like. The transmitter, upon signaling the receiver, causing the vehicle to start up or to perform other functions. The system may also be useful 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, although unauthorized, cause the vehicle to begin running or to allow access to the garage.

[0011] The system includes a transmitter generally having means for developing a fixed code and a rolling or variable code. The rolling or variable code is changed with each actuation of the transmitter. The fixed code remains the same for each actuation of the transmitter. In the present system, the transmitter includes means for producing a 32-bit frame comprising the fixed portion of the code and a second 32-bit frame comprising the variable portion of the code. The 32-bit rolling code is then mirrored to provide a 32-bit mirrored rolling code. The 32-bit mirrored rolling code then has its most significant bit “deleted” by setting it to zero. The transmitter then converts the 32-bit fixed code and the mirrored variable code to a three-valued or trinary bit fixed code and a three-valued or trinary bit variable code or rolling code.

[0012] To provide further security, the fixed code and the rolling codes are shuffled so that alternating trinary bits are comprised of a fixed code bit and a rolling code bit to yield a total of 40 trinary bits. The 40 trinary bits are then packaged in a first 20-trinary bit frame and a second 20-trinary bit frame which have proceeding them a single synchronization and/or identification pulse indicating the start of the frame and whether it is the first frame or the second frame. Immediately following each of the frames, the transmitter is placed into a quieting condition to maintain the average power of the transmitter over a typical 100 millisecond interval within legal limits promulgated by the United States Federal Communications Commission. The first trinary frame and the second trinary frame are used to modulate a radio frequency carrier, in this case via amplitude modulation to produce an amplitude modulated encrypted signal. In a preferred embodiment, the radio frequency signal is amplitude modulated. The amplitude modulated signal is then launched an may be received by an AM receiver. In the preferred embodiment, the AM receiver receives the amplitude modulated signal, demodulates it to produce a pair of trinary bit encoded frames. The trinary bits in each of the frames are converted on the fly to 2-bit or half nibbles indicative of the values of the trinary bits which are ultimately used to form two 16-bit fixed code words and two 16-bit variable code words. The two 16-bit fixed code words are used as a pointer to identify the location of a previously stored rolling code value within the receiver. The two 16-bit rolling code words are concatenated by taking the 16-bit word having the more significant bits, multiplying it by 3¹⁰and then adding it to the second of the words to produce a 32-bit encrypted rolling code. In order to make certain that if the transmitter was inadvertently actuated a number of times, the authorized user can still start his car or gain entry to his garage. The 32-bit encrypted code is then compared via a binary subtraction with the stored rolling code. If the 32-bit code is within a window or fixed count, in the present embodiment 1000, the microprocessor produces an authorization signal which is then responded to by other portions of the 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 1000, indicative of a relatively large number of incrementations, the user is not locked out of the garage, but is allowed to provide further signals or indicia to the receiver that he is an authorized user without any significant degradation of the security. This is done by the receiver entering an alternate mode requiring two or more successive valid codes to be received, rather than just one. If the two or more successive valid codes are received, the garage door will open. However, in order 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, in this case starting at a count of 300 or less than the present stored count and including all code values between the present stored count and 300 less is compared to the received code. If the received code is within this backward window, the response of the system simply is to take no further action, nor to provide authorization during that code cycle on the assumption that the code has been purloined.

[0013] Thus, the present system provides important advantages over the previous garage door operator systems and even previous rolling code systems. The systems provides a multiple segmented windowed system which provides a valid code window, a second relatively insecure code window in which two successive valid codes must be received and finally a window in which no valid codes are recognized due to the likelihood of the receiver having been stolen.

[0014] It is a principal object of the present invention to provide a security system involving a radio frequency transmitter and receiver wherein multiple security conditions may exist requiring different levels of signal security.

[0015] It is another object of the present invention to provide a secure radio transmitter receiver system which may rapidly and easily decode a relatively large code combination.

[0016] Other advantages of the invention will become obvious to one of ordinary skill in the art upon a perusal of the following specifications and claims in light of the accompanying drawings.

Brief Description of the Drawings

[0017] FIG. 1 is a perspective view of an apparatus for moving a barrier or garage embodying the present invention;

[0018] FIG. 2 is a block diagram of a transmitter for use with a garage door operator of FIG. 1;

[0019] FIG. 3 is a block diagram of a receiver positioned within a head unit of the garage door operator shown in FIG. 1;

[0020] FIG. 4 is a schematic diagram of the transmitter shown in FIG. 2;

[0021] FIG. 5 is a schematic diagram of the receiver shown in FIG. 3;

[0022] FIG. 6 is a timing diagram of signals generated by a portion of the transmitter;

[0023] FIGS. 7A, B, and C are flow diagrams showing the operation of the transmitter; and

[0024] FIGS. 8A, B, C, D, E and F are flow charts showing the operation of the receiver.

Detailed Description of the Preferred Embodiment

[0025] Referring now to the drawings and especially to FIG. 1, more specifically a movable barrier door operator or garage door operator is generally shown therein and includes a head unit 12 mounted within a garage 14. More specifically, the head unit 12 is mounted to the ceiling 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 system includes a hand-held transmitter unit 30 adapted to send signals to an antenna 32 positioned on the head unit 12 and coupled to a receiver as will appear hereinafter. An external control pad 34 is positioned on the outside of the garage having a plurality of buttons thereon and communicate via radio frequency transmission with the antenna 32 of the head unit 12.

[0026] An optical emitter 42 is connected via a power and signal line 44 to the head unit. An optical detector 46 is connected via a wire 48 to the head unit 12.

[0027] Referring now to FIG. 2, the transmitter 30 is shown therein in general and includes a battery 70 connected by a pushbutton switch 72 to a power supply 74 which is coupled via leads 75 and 76 to a microcontroller 78. The microcontroller 78 is connected by a serial bus 79 to a non-volatile memory 80. An output bus 81 connects the microcontroller to a radio frequency oscillator 82. The microcontroller 78 produces coded signals when the button 72 is pushed causing the output of the RF oscillator 82 to be amplitude modulated to supply a radio frequency signal at an antenna 83 connected thereto. More specifically, as shown in FIG. 5, details of the transmitter 30 are shown therein, including a plurality of switches 72. When switch 72 is closed, power is supplied through a diode 100 to a capacitor 102 to supply a 7.1 volt voltage at a lead 103 connected thereto. A light emitting diode 104 indicates that the transmitter button has been pushed and provides a voltage to a lead 105 connected thereto. A Zener diode 106 provides voltage regulation and causes the back biased diode 107 to cause the crystal 108 to be energized, thereby energizing the microcontroller 78, a Zilog 125C0113 8-bit microcontroller in this embodiment. The signal is also sent via a resistor 110 through a lead 111 to a P32 pin of the microcontroller 78. Likewise, when a switch 113 is closed, current is fed through a diode 114 to the lead 103 also causing the crystal 108 to be energized, powering up the microcontroller at the same time that pin P33 of the microcontroller is pulled up. Similarly, when a switch 118 is closed, power is fed through a diode 119 to the crystal 108 as well as pull up voltage being provided through a resistor 120 to the pin P31. It should also be appreciated that pin P34 of the microcontroller is configured via a connection with the resistor 123 to be an RS232 input port 124.

[0028] The microcontroller is coupled via the serial bus 79 to a chip select port, a clock port and a DI port to which and from which serial data may be written and read and to which addresses may be applied. As will be seen hereinafter in the operation of the microcontroller, the microcontroller 78 produces output signals at the lead 81, which are supplied to a resistor 125 which is coupled to a voltage dividing resistor 126 feeding signals to the lead 127. A 30-nanohenry inductor 128 is coupled to an NPN transistor 129 at its base 130. The transistor 129 has a collector 131 and an emitter 132. The collector 131 is connected to the antenna 83 which, in this case, comprises a printed circuit board, loop antenna having an inductance of 25-nanohenries, comprising a portion of the tank circuit with a capacitor 133, a variable capacitor 134 for tuning, a capacitor 135 an a capacitor 136. An 30-nanohenry inductor 139 is coupled via a capacitor 139 to ground. The capacitor has a resistor 140 connected in parallel with it to ground. When the output from lead 81 is driven high by the microcontroller, the capacitor Q1 is switched on causing the tank circuit to output a signal on the antenna 83. When the capacitor is switched off, the output to the drive the tank circuit is extinguished causing the radio frequency signal at the antenna 83 also to be extinguished.

[0029] Referring now to FIG. 3, the receiver is shown therein and includes a receiver antenna 200 coupled to an amplitude modulated receiver 202 driven from a power supply 204 connectable to a source of alternating current 206. The receiver 202 provides a demodulated output via a band-pass filter 210 to an analog-to-digital converter 212 which provides input to a microcontroller 214 having an internal read-only memory 216 and an internal random-access memory 218. A serial non-volatile memory 220 is connected via a memory bus 222 to the microcontroller 214 to send and receive information thereto. The microcontroller has an output line 226 coupled to a motor controller 228 which may include a plurality of relays or other standard electro-mechanical features which feeds electrical current on lines 230 and 232 to an electric motor 234.

[0030] Referring now to FIG. 3 the antenna 200 coupled to a reactive divider network 250 comprised of a pair of series connected inductances 252 and 254 and capacitors 256 and 258 which supply an RF signal to a buffer amplifier having an NPN transistor 260, at its emitter 261. The NPN transistor 260 has a pair of capacitors 262 and 264 connected to it for power supply isolation. The buffer amplifier provides a buffered radio frequency output signal on a lead 268. The buffered RF signal is fed to an input 270 which forms part of a super-regenerative receiver 272 having an output at a line 274 coupled to the bandpass filter which provides digital output to the bandpass filter 212. The bandpass filter 212 includes a first stage 276 and a second stage 278 to provide a digital level output signal at a lead 280 which is supplied via an averaging circuit 282 to an input pin P32 of the microcontroller 214.

[0031] The microcontroller 214 may have its mode of operation controlled by a programming or learning switch 300 coupled via a line 302 to the P25 pin. A command switch 304 is coupled via a jumper 306 to a line 308 and ultimately through a resistor to the input pin P22. A pin P21 sinks current through a resistor 314 connected to a light emitting diode 316, causing the diode to light to indicate that the receiver is active. The microcontroller 214 has a 4 MHz crystal 328 connected to it to provide clock signals and includes an RS232 output port 332 that is coupled to the pin P31. A switch 340 selects whether constant pressure or monostable is to be selected as the output from output terminals P24 and P23 which are coupled to a transistor 350 which, when switched on, sinks current through a coil 352 of a relay 354, causing the relay to close to provide an actuating signal on a pair of leads 356 and 358 to an electric motor.

[0032] It may be appreciated that the power supply 204 may receive power from an external transformer or other AC source through a jack 370 which is connected to a pair of RJ uncoupling capacitors 372 and 374. The input signal is then set to a full-wave rectifier bridge 376 which provides an output current at a resistor 378. An 18-volt Zener diode 380 is connected between ground and the resistor 378 and includes high frequency bypass capacitor 382 connected in parallel with it. An 8.2-volt Zener diode 384 is connected in back-biased configuration to the resistor 378 to receive a signal therefrom to guarantee that at least an 8.2-volt signal is fed to a resistor 390 causing an LED 392 to be illuminated and also causing power to be supplied to a 5-volt 78LO5 voltage regulator 396. The voltage regulator 396 supplies regulated voltage to an output line 398. Filtering capacitors 400a, 400b, 400c and 400d limit the fluctuations at the power supply.

[0033] The program code listing for the transmitter is set forth at pages A-1 through A-19 and for the receiver at pages A-20 through A-51 of the attached appendix. Referring now to FIGS. 7A through 7C, the flow chart set forth therein describes the operation of the transmitter. A rolling code is incremented by three in a step 500, followed by the rolling code being stored for the next transmission from the transmitter when the transmitter 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 is set to 0. It may be appreciated that it is trinary code which is actually used to modify the radio frequency oscillator signal and the trinary code is best seen in FIG. 6. It may be noted that the bit timing in FIG. 6 for a 0 is 1.5 millisecond 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.

[0034] 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 equal to zero. If it is, the next most significant digit of the binary rolling code is incremented in a step 514, following which flow is returned 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 the 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 it is not, control is transferred back to step 510. If it has, control is transferred to step 522 to clear the bit counter. In a step 524, the blank timer is tested to determine whether it is active or not. If it is not, a test is made in a step 526 to determine whether the blank time has expired. If the blank time 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 time 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 it is, the blank timer is started in a step 542. If it is 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 544. If the bit counter is not equal to 40, control is transferred back to step 522.

[0035] Referring now to FIGS. 8A through 8F and, in particular, to FIG. 8A, the operation of the receiver is set forth therein. In a step 700, an interrupt is detected and acted upon from the radio input pin. 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 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.

[0036] 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 FIG. 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. If it is 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.

[0037] In the event that the bit counter test in step 712 indicates that the bit counter is not 0, control is transferred to step 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 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 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 they difference between the active time an 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.

[0038] 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 numbered 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.

[0039] If the bit counter indicates that it is an odd number trinary bit 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 the 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 cod 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, as would be needed in order to get programming, 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 in non-volatile memory. If there is a match, the rolling portion is stored in the memory. If there is not, it 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 773. If there is a match, the counter which is indicative of the rolling code is tested to determined 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 transmitter. If it is not, a test is made in the step 786 to determine whether the last transmission from the same transmitter 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.

[0040] While there has been illustrated and described a particular embodiment of the present invention, it will be appreciated that numerous changes and modifications will occur to those skilled in the art, and it is intended in the appended claims to cover all those changes and modifications which fall within the true spirit and scope of the present invention.

Claims

Certificate of Correction present

The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.

What is claimed is:

1. A method of sending codes to operate a controller for a barrier movement operator, the method comprising:

rf transmitting in trinary format a sequence of security codes, the sequence of security codes comprising a first code having a first relationship to a security code stored in the controller such that the first code will not cause operation of the controller and an additional code, which has a second relationship to the first code of the sequence for causing operation of the controller;

wherein the controller characterizes received security codes to be in one of a valid window, an invalid window or an insecure window based on the relationship between a received security code and the security code stored in the controller and a received code having the first relationship to the expected security code results in an insecure window characterization.

2. The method according to claim 1 wherein the rf transmitting is performed by an rf transmitter which generates a carrier frequency and the first and additional codes are transmitted by modulating the carrier frequency.

3. The method according to claim 2 wherein modulating comprises selectively gating carrier frequency in intervals at a first level and a second level where the second level is less than the first level.

4. The method according to claim 3 wherein the second level comprises substantially no carrier frequency.

5. The method according to claim 3 wherein the intervals of modulation are approximately 0.5 milliseconds in length.

6. The method according to claim 1 wherein the controller comprises an algorithm for producing a rolling code sequence of security codes and the additional code comprises a portion which is the next code in the rolling code sequence after the first code.

7. The method according to claim 1 wherein the controller includes a receiver which converts received codes into a fixed code portion and a rolling code portion and the fixed code portion of the first code and the additional code are the same.

8. A method of operating a transmitter to operator a controller for a barrier movement operator which includes an algorithm to generate a sequence of generated security codes in which a predetermined portion of a security code differs from the predetermined portion of previous security codes in the sequence and which controller interprets received codes in trinary format to be one of an invalid window, a valid window or an insecure code window, the method of operating the transmitter comprising:

rf transmitting in a trinary format, a first transmitted code representing a first security code to be interpreted as being in the insecure code window; and

rf transmitting in a trinary format after the transmission of the first transmitted code a second transmitted code representing a second security code having a predetermined relationship to the first code.

9. The method accordance with claim 8 wherein the second transmitted code represents a second security code which is next after the first security code in the sequence of generated security code.

10. The method accordance with claim 8 wherein the controller receives rf transmitted codes in trinary format and converts them into a fixed portion and a rolling portion and wherein the transmitter transmits, in trinary format, a second transmitted code representing the same fixed portion as does the first transmitted code.

11. The method accordance with claim 8 wherein the step of rf transmitting comprises modulating an rf carrier signal.

12. A transmitter for controlling a controller for a barrier movement operator, comprising an rf transmitter which rf transmits, in trinary format, a sequence of security codes, the sequence of security codes comprising a first code having a first relationship to security code previously stored in the controller such that the first code will not cause operation of the controller and an additional code, which has a second relationship to the first code transmitted by the rf transmitter for causing operation of the controller;

wherein the controller characterizes received security codes to be in one of a valid window, an invalid window or an insecure window based on the relationship between a received security code and the security code stored in the controller and the controller characterizes a received code having the first relationship to the security code stored in the controller as being in the insecure window.

13. The transmitter according to claim 12 comprising a carrier frequency generator and a modulator to transmit the first and additional codes by modulating the carrier.

14. The transmitter according to claim 13 comprising apparatus for selectively gating carrier frequency in intervals of modulation at a first level and a second level where the second level is less than the first level.

15. The transmitter according to claim 14 wherein the second level comprises substantially no carrier frequency.

16. The transmitter according to claim 14 wherein the intervals of modulation are approximately 0.5 milliseconds in duration.

17. The transmitter according to claim 12 wherein the controller comprises an algorithm for producing a rolling code sequence of security codes to be stored by the controller and the additional code comprises a portion which is the next expected code in the rolling code sequence after the first code.

18. The transmitter according to claim 12 wherein the controller converts received codes into a fixed code portion and a rolling code portion and the fixed code portion of the first code and the additional code are the same.

19. A remote actuation system comprising:

an rf transmitter to control an operator which includes an rf receiver and an algorithm to generate a sequence of security codes in which a predetermined portion of a generated security code differs from the predetermined portion of previous security codes in the sequence and which operator interprets security codes received from the rf transmitter, in trinary format, to be in one of an invalid window, a valid window or an insecure code window, and the rf transmitter includes apparatus which rf transmits in trinary format, a first transmitted code representing a first security code to be interpreted by the operator as being in the insecure code window and rf transmits in a trinary format after the transmission of the first transmitted code a second transmitted code representing a second security code having a predetermined relationship to the first code.

20. The system in accordance with claim 19 wherein the second transmitted code represents a second security code which is next after the first transmitted security code in the generated sequence of security codes.

21. The system in accordance with claim 19 wherein the operator receives rf transmitted codes in trinary format and converts them into a fixed portion and a rolling portion and wherein the rf transmitter transmits, in trinary format, a second transmitted code representing the same fixed portion as does the first transmitted code.

22. A method of sending codes to operate a controller for a barrier movement operator, the method comprising: rf transmitting in trinary format a sequence of security codes, the sequence of security codes comprising a first code having a first relationship to a security code stored in the controller such that the first code will not cause operation of the controller and an additional code, which has a second relationship to the first code of the sequence for causing operation of the controller;

wherein the controller includes a receiver which converts received codes into a fixed code portion and a rolling code portion and the fixed code portion of the first code and the additional code are the same.

23. The method according to claim 22 wherein the controller characterizes received security codes to be in one of a valid window, an invalid window or an insecure window based on the relationship between a received security code and the security code stored in the controller and a received code having the first relationship to the expected security code results in an insecure window characterization.

24. The method according to claim 23 wherein the rf transmitting is performed by an rf transmitter which generates a carrier frequency and the first and additional codes are transmitted by modulating the carrier frequency.

25. The method according to claim 24 wherein modulating comprises selectively gating carrier frequency in intervals at a first level and a second level where the second level is less than the first level.

26. The method according to claim 25 wherein the second level comprises substantially no carrier frequency.

27. The method according to claim 25 wherein the intervals of modulation are approximately 0.5 milliseconds in length.

28. The method according to claim 22 wherein the controller comprises an algorithm for producing a rolling code sequence of security codes and the additional code comprises a portion which is the next code in the rolling code sequence after the first code.

29. A transmitter for controlling a controller for a barrier movement operator, comprising:

an rf transmitter which rf transmits, in trinary format, a sequence of security codes, the sequence of security codes comprising a first code having a first relationship to security code previously stored in the controller such that the first code will not cause operation of the controller and an additional code, which has a second relationship to the first code transmitted by the rf transmitter for causing operation of the controller;

a carrier frequency generator and a modulator to transmit the first and additional codes by modulating the carrier;

apparatus for selectively gating carrier frequency in intervals of modulation at a first level and a second level where the second level is less than the first level.

30. The transmitter according to claim 29 wherein the controller characterizes received security codes to be in one of a valid window, an invalid window or an insecure window based on the relationship between a received security code and the and the security code stored in the controller and the controller characterizes a received code having the first relationship to the security code stored in the controller as being in the insecure window.

31. The transmitter according to claim 29 wherein the second level comprises substantially no carrier frequency.

32. The transmitter according to claim 29 wherein the intervals of modulation are Approximately 0.5 milliseconds in duration.

33. The transmitter according to claim 29 wherein the controller comprises an algorithm for producing a rolling code sequence of security codes to be stored by the controller and the additional code comprises a portion which is the next expected code in the rolling code sequence after the first code.

34. The transmitter according to claim 29 wherein the controller converts received codes into a fixed code portion and a rolling code portion and the fixed code portion of the first code and the additional code are the same.

Patent Citations (214)

Patent	Date	Inventor	Cited By
US2405500(A)	1946-08-01	Guannella	Applicant
US3716865(A)	1973-02-01	Willmott	Applicant
US3735106(A)	1973-05-01	Hollaway	Applicant
US3792446(A)	1974-02-01	McFiggins et al.	Applicant
US3798359(A)	1974-03-01	Feistel	Applicant
US3798360(A)	1974-03-01	Feistel	Applicant
US3798605(A)	1974-03-01	Feistel	Applicant
US3845277(A)	1974-10-01	Voss et al.	Applicant
US3890601(A)	1975-06-01	Pietrolewicz	Applicant
US3906348(A)	1975-09-01	Willmott	Applicant
US3938091(A)	1976-02-01	Atalla et al.	Applicant
US4037201(A)	1977-07-01	Willmott	Applicant
US4064404(A)	1977-12-01	Willmott et al.	Applicant
USRE29525(E)	1978-01-01	Willmott	Applicant
US4078152(A)	1978-03-01	Tuckerman, III	Applicant
US4138735(A)	1979-02-01	Allocca et al.	Applicant
US4178549(A)	1979-12-01	Ledenbach et al.	Applicant
US4195196(A)	1980-03-01	Feistel	Applicant
US4195200(A)	1980-03-01	Feistel	Applicant
US4196310(A)	1980-04-01	Forman et al.	Applicant
US4218738(A)	1980-08-01	Matyas et al.	Applicant
US4304962(A)	1981-12-01	Fracassi et al.	Applicant
US4305060(A)	1981-12-01	Apple et al.	Applicant
US4316055(A)	1982-02-01	Feistel	Applicant
US4326098(A)	1982-04-01	Bouricius et al.	Applicant
US4327444(A)	1982-04-01	Court	Applicant
US4328414(A)	1982-05-01	Atalla	Applicant
US4328540(A)	1982-05-01	Matsuoka et al.	Applicant
USRE30957(E)	1982-06-01	Feistel	Applicant
US4380762(A)	1983-04-01	Capasso	Applicant
US4385296(A)	1983-05-01	Tsubaki et al.	Applicant
US4393269(A)	1983-07-01	Konheim et al.	Applicant
US4418333(A)	1983-11-01	Schwarzbach et al.	Applicant
US4426637(A)	1984-01-01	Apple et al.	Applicant
US4445712(A)	1984-05-01	Smagala-Romanoff	Applicant
US4447890(A)	1984-05-01	Duwel et al.	Applicant
US4454509(A)	1984-06-01	Buennagel et al.	Applicant
US4464651(A)	1984-08-01	Duhame	Applicant
US4471493(A)	1984-09-01	Schober	Applicant
US4491774(A)	1985-01-01	Schmitz	Applicant
US4509093(A)	1985-04-01	Stellberger	Applicant
US4529980(A)	1985-07-01	Liotine et al.	Applicant
US4535333(A)	1985-08-01	Twardowski	Applicant
US4574247(A)	1986-03-01	Jacob	Applicant
US4578530(A)	1986-03-01	Zeidler	Applicant
US4581606(A)	1986-04-01	Mallory	Applicant
US4590470(A)	1986-05-01	Koenig	Applicant
US4593155(A)	1986-06-01	Hawkins	Applicant
US4596898(A)	1986-06-01	Pemmaraju	Applicant
US4596985(A)	1986-06-01	Bongard et al.	Applicant
US4599489(A)	1986-07-01	Cargile	Applicant
US4602357(A)	1986-07-01	Yang et al.	Applicant
US4611198(A)	1986-09-01	Levinson et al.	Applicant
US4623887(A)	1986-11-01	Welle, II	Applicant
US4626848(A)	1986-12-01	Ehlers	Applicant
US4628315(A)	1986-12-01	Douglas	Applicant
US4630035(A)	1986-12-01	Stahl et al.	Applicant
US4633247(A)	1986-12-01	Hegeler	Applicant
US4638433(A)	1987-01-01	Schindler	Applicant
US4646080(A)	1987-02-01	Genest et al.	Applicant
US4652860(A)	1987-03-01	Weishaupt et al.	Applicant
US4653076(A)	1987-03-01	Jerrim et al.	Applicant
US4670746(A)	1987-06-01	Taniguchi et al.	Applicant
US4686529(A)	1987-08-01	Kleefeldt	Applicant
US4695839(A)	1987-09-01	Barbu et al.	Applicant
US4703359(A)	1987-10-01	Rumbolt et al.	Applicant
US4710613(A)	1987-12-01	Shigenaga	Applicant
US4716301(A)	1987-12-01	Willmott et al.	Applicant
US4720860(A)	1988-01-01	Weiss	Applicant
US4723121(A)	1988-02-01	van den Boom et al.	Applicant
US4731575(A)	1988-03-01	Sloan	Applicant
US4737770(A)	1988-04-01	Brunius et al.	Applicant
US4740792(A)	1988-04-01	Sagey et al.	Applicant
US4750118(A)	1988-06-01	Heitschel et al.	Applicant
US4754255(A)	1988-06-01	Sanders et al.	Applicant
US4755792(A)	1988-07-01	Pezzolo et al.	Applicant
US4758835(A)	1988-07-01	Rathmann et al.	Applicant
US4761808(A)	1988-08-01	Howard	Applicant
US4779090(A)	1988-10-01	Micznik et al.	Applicant
US4794268(A)	1988-12-01	Nakano et al.	Applicant
US4794622(A)	1988-12-01	Isaacman et al.	Applicant
US4796181(A)	1989-01-01	Wiedemer	Applicant
US4799061(A)	1989-01-01	Abraham et al.	Applicant
US4800590(A)	1989-01-01	Vaughan	Applicant
US4802114(A)	1989-01-01	Sogame	Applicant
US4804938(A)	1989-02-01	Rouse et al.	Applicant
US4807052(A)	1989-02-01	Amano	Applicant
US4808995(A)	1989-02-01	Clark et al.	Applicant
US4825200(A)	1989-04-01	Evans et al.	Applicant
US4825210(A)	1989-04-01	Bachhuber et al.	Applicant
US4831509(A)	1989-05-01	Jones et al.	Applicant
US4835407(A)	1989-05-01	Kataoka et al.	Applicant
US4845491(A)	1989-07-01	Fascenda et al.	Applicant
US4847614(A)	1989-07-01	Keller	Applicant
US4855713(A)	1989-08-01	Brunius	Applicant
US4856081(A)	1989-08-01	Smith	Applicant
US4859990(A)	1989-08-01	Isaacman	Applicant
US4870400(A)	1989-09-01	Downs et al.	Applicant
US4878052(A)	1989-10-01	Schulze	Applicant
US4881148(A)	1989-11-01	Lambropoulus et al.	Applicant
US4885778(A)	1989-12-01	Weiss	Applicant
US4888575(A)	1989-12-01	De Vaulx	Applicant
US4890108(A)	1989-12-01	Drori et al.	Applicant
US4905279(A)	1990-02-01	Nishio	Applicant
US4912463(A)	1990-03-01	Li	Applicant
US4914696(A)	1990-04-01	Dudczak et al.	Applicant
US4918690(A)	1990-04-01	Markkula, Jr. et al.	Applicant
US4922168(A)	1990-05-01	Waggamon et al.	Applicant
US4922533(A)	1990-05-01	Philippe	Applicant
US4928098(A)	1990-05-01	Dannhaeuser	Applicant
US4931789(A)	1990-06-01	Pinnow	Applicant
US4939792(A)	1990-07-01	Urbish et al.	Applicant
US4942393(A)	1990-07-01	Waraksa et al.	Applicant
US4951029(A)	1990-08-01	Severson	Applicant
US4963876(A)	1990-10-01	Sanders	Applicant
US4979832(A)	1990-12-01	Ritter	Applicant
US4980913(A)	1990-12-01	Skret	Applicant
US4988992(A)	1991-01-01	Heitschel et al.	Applicant
US4992783(A)	1991-02-01	Zdunek et al.	Applicant
US4999622(A)	1991-03-01	Amano et al.	Applicant
US5001332(A)	1991-03-01	Schrenk	Applicant
US5023908(A)	1991-06-01	Weiss	Applicant
US5049867(A)	1991-09-01	Stouffer	Applicant
US5055701(A)	1991-10-01	Takeuchi	Applicant
US5058161(A)	1991-10-01	Weiss	Applicant
US5060263(A)	1991-10-01	Bosen et al.	Applicant
US5103221(A)	1992-04-01	Memmola	Applicant
US5107258(A)	1992-04-01	Soum	Applicant
US5126959(A)	1992-06-01	Kurihara	Applicant
US5144667(A)	1992-09-01	Pogue, Jr. et al.	Applicant
US5146067(A)	1992-09-01	Sloan et al.	Applicant
US5148159(A)	1992-09-01	Clark et al.	Applicant
US5153581(A)	1992-10-01	Hazard	Applicant
US5159329(A)	1992-10-01	Lindmayer et al.	Applicant
US5168520(A)	1992-12-01	Weiss	Applicant
US5193210(A)	1993-03-01	Nicholas et al.	Applicant
US5224163(A)	1993-06-01	Gasser et al.	Applicant
US5237614(A)	1993-08-01	Weiss	Applicant
US5252960(A)	1993-10-01	Duhame	Applicant
US5278907(A)	1994-01-01	Snyder et al.	Applicant
US5280527(A)	1994-01-01	Gullman et al.	Applicant
US5331325(A)	1994-07-01	Miller	Applicant
US5361062(A)	1994-11-01	Weiss et al.	Applicant
US5363448(A)	1994-11-01	Koopman, Jr. et al.	Applicant
US5365225(A)	1994-11-01	Bachhuber	Applicant
US5367572(A)	1994-11-01	Weiss	Applicant
US5369706(A)	1994-11-01	Latka	Applicant
US5412379(A)	1995-05-01	Waraksa et al.	Applicant
US5414418(A)	1995-05-01	Audros, Jr.	Applicant
US5420925(A)	1995-05-01	Michaels	Applicant
US5442341(A)	1995-08-01	Lambropoulos	Applicant
US5444737(A)	1995-08-01	Cripps et al.	Applicant
US5471668(A)	1995-11-01	Soenen et al.	Applicant
US5473318(A)	1995-12-01	Martel	Applicant
US5479512(A)	1995-12-01	Weiss	Applicant
US5485519(A)	1996-01-01	Weiss	Applicant
US5517187(A)	1996-05-01	Bruwer et al.	Applicant
US5530697(A)	1996-06-01	Watanabe	Examiner
USRE35364(E)	1996-10-01	Heitschel et al.	Applicant
US5563600(A)	1996-10-01	Miyake	Applicant
US5594429(A)	1997-01-01	Nakahara	Applicant
US5598475(A)	1997-01-01	Soenen et al.	Applicant
US5608723(A)	1997-03-01	Felsenstein	Applicant
US5657388(A)	1997-08-01	Weiss	Applicant
US5680131(A)	1997-10-01	Utz	Examiner
US5686904(A)	1997-11-01	Bruwer	Applicant
US5745068(A)	1998-04-01	Takahashi et al.	Examiner
US5778348(A)	1998-07-01	Manduley et al.	Applicant
US5872519(A)	1999-02-01	Issa et al.	Applicant
US5898397(A)	1999-04-01	Murray	Applicant
US5937065(A)	1999-08-01	Simon et al.	Applicant
US6154544(A)	2000-11-01	Farris et al.	Applicant
US6175312(B1)	2001-01-01	Bruwer et al.	Applicant
US6275519(B1)	2001-08-01	Hendrickson	Applicant
US6690796(B1)	2004-02-01	Farris et al.	Applicant
US6810123(B2)	2004-10-01	Farris et al.	Applicant
US6980655(B2)	2005-12-01	Farris et al.	Applicant
US7412056(B2)	2008-08-01	Farris et al.	Applicant
DE3234538(A1)	1984-03-01		Applicant
DE3234539(A1)	1984-03-01		Applicant
DE3244049(A1)	1984-09-01		Applicant
DE3309802(A1)	1984-09-01		Applicant
DE3320721(A1)	1984-12-01		Applicant
DE3309802(C2)	1985-07-01		Applicant
DE3407436(A1)	1985-08-01		Applicant
DE3407469(A1)	1985-09-01		Applicant
DE3532156(A1)	1987-03-01		Applicant
DE3636822(C1)	1987-10-01		Applicant
DE4204463(A1)	1992-08-01		Applicant
EP43270(A1)	1982-01-01		Applicant
EP103790(A2)	1984-03-01		Applicant
EP244332(B1)	1987-11-01		Applicant
EP155378	1988-07-01		Applicant
EP154019	1988-08-01		Applicant
EP311112	1989-04-01		Applicant
EP335912(B1)	1989-10-01		Applicant
EP372285(A1)	1990-06-01		Applicant
EP459781(B1)	1991-12-01		Applicant
FR2606232	1988-05-01		Applicant
FR2607544	1988-07-01		Applicant
FR2685520	1993-06-01		Applicant
GB2023899(A)	1980-01-01		Applicant
GB2051442	1981-01-01		Applicant
GB2099195(A1)	1982-12-01		Applicant
GB2118614	1983-11-01		Applicant
GB2131992(A)	1984-06-01		Applicant
GB2133073(A)	1984-07-01		Applicant
GB2184774	1987-07-01		Applicant
GB2265482(A)	1993-09-01		Applicant
WO93/20538	1993-10-01		Applicant
WO94/11829	1994-05-01		Applicant
WO94/18036	1994-08-01		Applicant
ZA90/4088	1990-05-01		Applicant
ZA8908225	1990-06-01		Applicant

Non-Patent Literature (133)

NM95HS01/NM95HS02 HiSeC.TM. (High Security Code) Generator, National Semiconductor, Jan. 1995, 1-19.Applicant
Charles Watts, How to Program the HiSeC.TM. Remote Keyless Entry Rolling Code Generator, National Semiconductor, Oct. 1994, 1-14.Applicant
MM57HS01 HiSeC.TM. Fixed and Rolling Code Decoder, National Semiconductor, Nov. 11, 1994, 1-8.Applicant
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Transcript of Porceedings Before the Honorable James B. Moran, May 31, 2006.Applicant
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Memorandum Opinion and Order, Sep. 11, 2006.Applicant
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.Applicant
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Plantiffs' Response to Lear's Motion for Reconsideration of the Court's Sep. 11, 2006 Ruling Regarding Claim Construction.Applicant
U.S. District Court, Northern District of Illinois, Eastern Divison, 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.Applicant
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Memorandum Opinion and Order, Feb. 20, 2007.Applicant
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Plantiffs' Response to Lear's Mar. 2, 2007 Supplemental Memorandum.Applicant
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.Applicant
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Plantiffs' Opposition to Lear Corporation's Motion to Stay the Effectiveness of the Preliminary Injunction Memorandum Opinion and Order Entered Mar. 30, 2007.Applicant
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Memorandum Opinion and Order, Apr. 25, 2007.Applicant
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.Applicant
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.Applicant
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.Applicant
Anderson, Ross. Searching for the optimum correlation attack, Fast Software Encryption, Lecture Notes in Computer Science 1008 (1995), 137-143.Applicant
Bellovin, S.M. Security problems in the TCP/IP protocol suite, ACM SIGCOMM Computer Communication Review, vol. 19, Issue 2, 32-48, Apr. 1989.Applicant
Beutelspacher, A. Perfect and essentially perfect authentication schemes, Advances in Cryptology—Eurocrypt '87, Lecture Notes in Computer Science 304 (1988), 167-170.Applicant
Soete, M. Some constructions for authentication—secrecy codes, Advances in Cryptology—Eurocrypt '88, Lecture Notes in Computer Science 303 (1988), 57-75.Applicant
Dijkstra, E.W. Co-operating sequentail processes, Programming Languages, F. Genuys, Ed., Academic Press, NY (1968), 43-112.Applicant
Marneweck, Kobus. Guidelines for KeeLoq® Secure Learning Implementation, TB007, pp. 1-5, Microchip Technology, Inc. (1987).Applicant
Otway, Dave and Rees, Owen. Efficient and timely mutual authentication, ACM SIGOPS Operating Systems Review, vol. 21, Issue 1, Jan. 8-10, 1987.Applicant
International Search Reoprt for PCT/US03/25308.Applicant
Abrams and Podell, Tutorial Computer and Network Security, District of Columbia: IEEE, (1987).Applicant
Abramson, Norman, The Aloha System—Another Alternative for Computer Communications, pp. 281-285, (University of Hawaii, 1970).Applicant
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).Applicant
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)).Applicant
Anderson, Ross. Searching for the Optium Correlation Attack, pp. 136-143, Computer Laboratory, Pembroke Street, Cambridge CB2 3QG, 1995.Applicant
Arazi, Benjamin. Vehicular Implementations of Public Key Cryptographic Techniques, pp. 646-653, IEEE Transactions on Vehicular Technology, vol. 40, No. 3, (Aug. 1991).Applicant
Baran, P. Security Secrecy and Tamper-free Communications, Distribution Communications, vol. 9, (Rand Corporation, 1964).Applicant
Barbaroux, Paul. Uniform Results in Polynomial-Time Security, pp. 297-306, Advances in Cryptology—Eurocrypt 92, (1992).Applicant
Bellovin, S. M. Security Problems in the TCP/IP Protocol Suite, pp. 32-49, Computer Communication Review, New Jersey, 1989.Applicant
Beutelspacher, Albrecht. Perfect and Essentially Perfect Authentication Schemes, pp. 167-170, Advances in Cryptology-Eurocrypt 87, (Extended Abstract), Federal Republic of Germany, 1988.Applicant
Bloch, Gilbert. Enigma Before Ultra Polish Work and The French Contribution, pp. 142-155, Cryptologia 11(3), (Jul. 1987).Applicant
Brickell, Ernest F. and Stinson, Doug. Authentication Codes With Multiple Arbiters, pp. 51-55, Proceedings of Eurocrypt 88, (1988).Applicant
Bruwer, Frederick J. Die Toepassing Van Gekombineerde Konvolusiekodering en Modulasie op HF-Datakommuikasie, District of Pretoria in South Africa, (Jul. 1998).Applicant
Burger, Chris R., Secure Learning RKE Systems Using KeeLoq® Encoders, TBOO1, pp. 1-7, 1996 Microchip Technology, Inc.Applicant
Burmeister, Mike. A Remark on the Efficiency of Identification Schemes, pp. 493-495, Advances in Cryptology—Eurocrypt 90, (1990).Applicant
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).Applicant
Cerf, Vinton G. Issues In Packet-Network Interconnection, pp. 1386-1408, Proceedings of the IEEE, 66(11), (Nov. 1978).Applicant
Conner, Doug. Cryptographic Techniques—Secure Your Wireless Designs, pp. 57-68, EDN (Design Feature), (Jan. 18, 1996).Applicant
Coppersmith, Don. Fast Evaluation of Logarithms in Fields of Characteristic Two, pp. 587-594, IEEE Transactions on Information Theory, IT-30(4), (Jul. 1984).Applicant
Davies, D. W. and Price, W. C. Security for Computer Networks, (John Wiley and Sons, 1984).Applicant
Davies, Donald W. Tutorial: The Security of Data in Networks, pp. 13-17, New York: IEEE, (1981).Applicant
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).Applicant
Davis, G. Marcstar™ TRC 1300 and TRC 1315 Remote Control Transmitter/Receiver, pp. 1-24, Texas Instruments, (Sep. 12, 1994).Applicant
Davis, Gregory and Palmer, Morris. Self-Programming, Rolling-Code Technology Creates Nearly Unbreakable RF Security, Technological Horizons, Texas Instruments, Inc. (ECN), (Oct. 1996).Applicant
Dawson, Steven. Keeloq® Code Hopping Decoder Using Secure Learn, AN662, pp. 1-16, 1997 Microchip Technology, Inc. 1997.Applicant
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).Applicant
Deavours, C. A. and Reeds, James. The Engima, Part 1, Historical Perspectives, pp. 381-391, Cryptologia, 1(4), (Oct. 1977).Applicant
Denning, Dorothy E. Cryptographic Techniques, pp. 135-154, Cryptography and Data Security, (1982).Applicant
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.Applicant
De Soete, Marijke. Some Constructions for Authentication-Secrecy Codes, pp. 57-75, Advances in Cryptology-Eurocrypt 88, 1988.Applicant
Diffie, Whitfield and Hellman, Martin E. An RSA Laboratories Technical Note, Version 1.4, (Revised Nov. 1, 1993).Applicant
Diffie and Hellman, Exhaustive Cryptanalysis Of The NBS Data Encryption Standard, pp. 74-84, Computer, (Jun. 1977).Applicant
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).Applicant
Diffie, Whitfield and Hellman, Martin E. Privacy and Authentication: An Introduction to Cryptography, pp. 29-33, Proceedings of the IEEE, vol. 67, No. 3, (Mar. 1979).Applicant
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).Applicant
Dijkstra, E. W. Co-Operating Sequential Processes, pp. 43-112, Programming Languages, F. Genuys. NY, 1968.Applicant
Dijkstra, E. W. Hierarchical Ordering of Sequential Processes, pp. 115-138, Acta Informatica 1, (1971).Applicant
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).Applicant
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).Applicant
Feistel, Horst. Cryptography and Computer Privacy, pp. 15-23, Scientific American, vol. 228, No. 5, (May 1973).Applicant
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).Applicant
Fenzl, H. and Kliner, A. Electronic Lock System: Convenient and Safe, pp. 150-153, Siemens Components XXI, No. 4, (1987).Applicant
Fischer, Elliot. Uncaging the Hagelin Cryptograph, pp. 89-92, Cryptologia, vol. 7, No. 1, (Jan. 1983).Applicant
Fragano, Maurizio. Solid State Key/Lock Security System, pp. 604-607, IEEE Transactions on Consumer Electronics, vol. CE-30, No. 4, (Nov. 1984).Applicant
Godlewski, Ph. and Camion, P. Manipulations and Errors, Detection and Localization, pp. 97-106, Proceedings of Eurocrypt 88, (1988).Applicant
Greenlee, B. M., Requirements for Key Management Protocols in the Wholesale Financial Services Industry, pp. 22-28, IEEE Communications Magazine, (Sep. 1985).Applicant
Guillou, Louis C. Smart Cards and Conditional Access, pp. 481-489, Proceedings of Eurocrypt, (1984).Applicant
Guillou, Louis C. and Quisquater, Jean-Jacques. A Practical Zero-Kowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory, pp. 123-128, Advances in Cryptology—Eurocrypt 88, (1988).Applicant
Habermann, A. Nico. Synchronization of Communicating Processes, pp. 171-176, Communiactions, (Mar. 1972).Applicant
ISO 8732: 1988(E): Banking Key Management (Wholesale) Annex D: Windows and Windows Management, (Nov. 1988).Applicant
Jones, Anita K. Protection Mechanisms and The Enforcement of Security Policies, pp. 228-251, Carnegie-Mellon University, Pittsburgh, PA, (1978).Applicant
Jueneman, R. R., et al. Message Authentication, pp. 29-40, IEEE Communications Magazine, vol. 23, No. 9, (Sep. 1985).Applicant
Kahn, Robert E. The Organization of Computer Resources Into A Packet Radio Network, pp. 177-186, National Computer Conference, (1975).Applicant
Keeloq® Code Hopping Decoder, HCS500, pp. 1-25, 1997 Microchip Technology, Inc.Applicant
Keeloq® Code Hopping Encoder, HCS300, pp. 1-20, 1996 Mircrochip Technology, Inc.Applicant
Keeloq® NTQ 105 Code Hopping Encoder, pp. 1-8, Nanoteq (Pty.) Ltd., (Jul. 1993).Applicant
Keeloq® NTQ 115 Code Hopping Decoder, pp. 1-8, Nanoteq (Pty.) Ltd., (Jul. 1993).Applicant
Keeloq® NTQ 125D Code Hopping Decoder, pp. 1-9, Nanoteq (pty.) Ltd., (Jul. 1993)Applicant
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).Applicant
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).Applicant
Kent, Stephen T. Encryption-Based Protection Protocols for Interactive User-Computer Communication, pp. 1-121, (May 1976). (See pp. 50-53).Applicant
Kent, Stephen T. Protocol Design Consideration for Network Security, pp. 239-259, Proc. NATO Advanced Study Institiute on Interlinking of Computer Networks, (1979).Applicant
Kent, Stephen T., Protocol Design Considerations for Network Security, pp. 239-259, Proc. NATO Advanced Study Institute on Interlinking of Computer Networks, (1979).Applicant
Kent, Stephen T., et al. Personal Authorization System for Access Control to the Defense Data Network, pp. 89-93, Conf. Record of Eascon 82 15th Ann Electronics & Aerospace Systems Conf., Washington, D.C. (Sep. 1982).Applicant
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).Applicant
Konheim, A.G. Cryptography: A Primer, pp. 285-347, New York, (John Wiley, 1981).Applicant
Kruh, Louis. Device anc Machines: The Hagelin Cryptographer, Type C-52, pp. 78-82, Cryptologia, vol. 3, No. 2, (Apr. 1979).Applicant
Kruh, Louis. How to Use the German Enigma Cipher Machine: A photographic Essay, pp. 291-296, Cryptologia, vol. No. 7, No. 4 (Oct. 1983).Applicant
Kuhn. G.J. Algorithms for Self-Synchronizing Ciphers, pp. 159-164, Comsig 88, University of Pretoria, Pretoria, (1988).Applicant
Kuhn, G.J., et al. A Versatile High-Speed Encryption Chip, Infosec '90 Symposium, Pretoria, (Mar. 16, 1990).Applicant
Lamport, Leslie. The Synchronization of Independent Processes, pp. 15-34, Acta Informatica, vol. 7, (1976).Applicant
Linn, John and Kent, Stephen T. Electronic Mail Privacy Enhancement, pp. 40-43, American Institute of Aeronautics and Astronautics, Inc. (1986).Applicant
Lloyd, Sheelagh. Counting Functions Satisfying a Higher Order Strict Avalanche Criterion, pp. 63-74, (1990).Applicant
Marneweck, Kobus. Guidelines for KeeLoq® Secure Learning Implementation, TB007, pp. 1-5, 1987 Microchip Technology, Inc.Applicant
Massey, James L. The Difficulty with Difficulty, pp. 1-4, (Updated). http://www.iacr.org/conferences/ec96/massey/html/framemassey.html. 1996.Applicant
McIvor, Robert. Smart Cards, pp. 152-159, Scientific American, vol. 253, No. 5, (Nov. 1985).Applicant
Meier, Willi. Fast Correlations Attacks on Stream Ciphers (Extended Abstract), pp. 301-314, Eurocrypt 88, IEEE, (1988).Applicant
Meyer, Carl H. and Matyas Stephen H. Cryptography: A New Dimension in Computer Data Security, pp. 237-249 (1982).Applicant
Michener, J.R. The ‘Generalized Rotor’ Cryptographic Operator and Some of Its Applications , pp. 97-113, Cryptologia, vol. 9, No. 2, (Apr. 1985).Applicant
Morris, Robert. The Hagelin Cipher Machine (M-209): Reconstruction of the Internal Settings, pp. 267-289, Cryptologia, 2(3), (Jul. 1978).Applicant
Newman, David B., Jr., et al. “Public Key Management for Network Security”, pp. 11-16, IEE Network Magazine, 1987.Applicant
News: Key System for Security, p. 38 (Apr. 1982).Applicant
Niederreiter, Harald. Keystream Sequences with a Good Linear Complexity Profile for Every Starting Point, pp. 523-532, Proceedings of Eurocrypt 89, (1989).Applicant
NM95HS01/NM95HS02 HiSeC™ (High Security Code) Generator, pp. 1-19, National Semiconductor, (Jan. 1995).Applicant
Otway, Dave and Rees, Owen. Efficient and Timely Mutual Authentication, pp. 8-11 1987.Applicant
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).Applicant
Postel, Jonathon B., et al. The ARPA Internet Protocol, pp. 261-271, (1981).Applicant
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).Applicant
Reynolds, J. and Postel, J. Official ARPA-Internet Protocols, Network Working Groups, (Apr. 1985).Applicant
Ruffell, J. Battery Low Indicator, p. 15-165, Eleckton Electronics, (Mar. 1989. (See p. 59).Applicant
Saab Anti-Theft System: Saab's Engine Immobilizing Anti-Theft System is a Road-Block for ‘Code-Grabbing’ Thieves, pp. 1-2, 1996.Applicant
Savage. J.E. Some Simple Self-Synchronizing Digital Data Scramblers, pp. 449-498, The Bell System Tech. Journal, (Feb. 1967).Applicant
Seberry, J. and Pieprzyk, Cryptography—An Introduction to Computer Security, (Prentice Hall of Australia, YTY Ltd, 1989).Applicant
Secure Terminal Interface Module for Smart Card Applications, pp. 1488-1489, IBM: Technical Disclosure Bulletin, vol. 28, No. 4, (Sep. 1985).Applicant
Shamir, Adi. Embedding cryptographic Trapdoors In Arbitrary Knapsak Systems, pp. 81-85, IEEE Transactions on Computers, vol. C-34, No. 1, (Jan. 1985).Applicant
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).Applicant
Simmons, Gustavus, J. Message Authentication with Arbitration of Transmitter/Receiver Disputes, pp. 151-165 (1987).Applicant
Smith. J.L. The Design of Lucifer: a Cryptographic Device for Data Communications, pp. 1-65, (Apr. 15, 1971).Applicant
Smith, J.L., et al. An Experimental Application of Crptography to a Remotely Accessed Data System, pp. 282-297, Proceedings of the ACM, (Aug. 1972).Applicant
Svigals, J. Limiting Access to Data in an Identification Card Having A Micro-Processor, pp. 580-581, IBM: Technical Disclosure Bulletin, vol. 27, No. 1B, (Jun. 1984).Applicant
Transaction Completion Code Based on Digital Signatures, pp. 1109-1122, IBM: Technical Disclosure Bulletin, vol. 28, No. 3, (Aug. 1985).Applicant
Turn, Rein. Privacy Transformations for Databank Systems, pp. 589-601, National Computer Conference, (1973)Applicant
Voydock, Victor L. and Kent, Stephen T. Security in High-Level Network Protocols, pp. 12-25, IEEE Communications Magazine, vol. 23, No. 7, (Jul. 1985).Applicant
Voydock, Victor L. and Kent, Stephen T. Security Mechanisms in a Transport Layer Protocol, pp. 325-341, Computers & Security, (1985).Applicant
Voydock, Victor L. and Kent, Stephen T. Security Mechanisms in High-Level Network Protocols, pp. 135-171, Computing Surveys, vol. 15, No. 2 (Jun. 1983).Applicant
Watts, Charles and Harper John. How to Design a HiSec™ Transmitter, pp. 1-4, National Semiconductor, (Oct. 1994).Applicant
Weinstein, S.B. Smart Credit Cards: The Answer to Cashless Shopping, pp. 43-49, IEEE Spectrum, (Feb. 1984).Applicant
Weissman, C. Security Controls in the ADEPT-50 Time-Sharing System, pp. 119-133, AFIPS Full Joint Computer Conference, (1969).Applicant
Welsh, Dominic, Codes and Cryptography, pp. 7.0-7.1, (Clarendon Press, 1988).Applicant

Abstract