WO1994008320A1

WO1994008320A1 - Key-lock system

Info

Publication number: WO1994008320A1
Application number: PCT/US1992/008132
Authority: WO
Inventors: Zoltan S. Ormos
Original assignee: Ormos, Kleopatra
Priority date: 1992-09-28
Filing date: 1992-09-28
Publication date: 1994-04-14

Abstract

A feature of the system is that there is neither master-key nor emergency-code by the manufacturers of by said authorized people to unlock a closure. The only authorized person for a lock (200) is its owner him/herself. According to the invention the new features are achieved by using class-codes and unique-codes as parts of the messages between the locks (200) and the keys (100), as well as of dynamic, elative 'labels' for the proper keys in the lock's memory. These labels are authorities: indicating whether a key is able to make another key (subsequently inserted in the same lock) (de)assign to that lock; and parents: indicating which one of the authority possessing keys made a key proper in the lock.

Description

KEY - LOCK SYSTEM

THE BACKGROUND OF THE INVENTION

In the highly sophisticated art of modern ley-lock systems multiple independent locks can be operated by one or more independent keys and multiple independent keys can operate the same lock. These systems are based on two way communication between keys and locks. The release operation of the lock depends on the coincidence between the key-code transmitted by the key and the release-code stored in the lock.

For securtiy reasons the key-code gets transmitted only upon receiving a trigger-code from the lock. In order to further enhance security these transmitted codes get scrambled or changed after each use.

The problem of establishing and reorganizing key-lock assignments in an easy and flexible way without restricting the security of systems is not satisfactorily solved yet.

SUMMARY OF THE INVENTION

The purpose of this invention is to provide a very easy to use, flexible, comfortable yet highly secure closure/controller system. It can solve all of the currently known key-lock related problems e.g.: assigning a key to a lock, allowing a lock to be operated by many independent keys and making security copies; the owner of the lock can replace and disable the lost keys to the lock as well as disable (prohibit) any absent keys and their copies without the notice or approval of their (=copies') owners.

Only the key's owner is able to make a copy of the key.

A very new feature of the system is that there is neither a master- key nor emergency-code by the manufacturers or by said authorized people to unlock a closure. The only authorized person for a lock is its owner him/herself.

According to the invention, the new features are achieved by using class-codes and unique-codes as parts of the messages between the lock and the key, as well as dynamic, indicators for the proper keys in the locks' memory.

These indicators are: authorities: indicating whether a key is able to make another key (subsequently inserted in the same lock) (de)- assigned to that lock; and parents: indicating which one of the authority possessing keys made a key proper in the lock.

BRIEF DESCRIPTION OF THE DRAWING

In order to better clarify the esential characteristics of th invention, an exemplifying form of a practical embodiment thereo is now described, with reference to the attached drawing whic shows a functional block diagram thereof. The references used on the drawing are: 100 key

111 starter

110 key_linker 180 key_energy_storage

120 key_transmitter 130 key_receiver

121 key_temporary_register 131 key_temporary_register

144 key_class-code_generator 141 key_class-code_analyzer

145 key_unique-code_generator 142 key_unique-code_analyzer 140 key_algorithm_processor 143 key_comparator 160 key_state_register 170 key_timer

150 key_memory 159 read-only memory (ROM) the content of the key_memory 150: 151 acutal identifier

152 actual copy-code

153 questions

154 answers

155 scrambling codes

156 intermediate data 200 lock

210 lock_linker 280 lock_energy_storage

220 lock_transmitter 230 lock_receiver

221 lock_temporary_register 231 lock_termporary_registe

244 lock_class-code_generator 241 lock_class-code_analyze

245 lock_unique-code_generator 242 lock_unique-code_analyze 240 lock_algorithm_processor 243 lock_comparator 260 lock_state register 270 lock_timer

250 lock_memory 281 energy supply the content of the lock_memory 250 : 251 identifiers

252 questions

253 answers

254 authority indicators

255 parent indicators

256 scrambling codes

257 intermediate data

290 lock driver

291 alarm

292 optical and/or acoustic display

293 reset button/keyboard 299 computer interface

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT

In the drawing a lock is indicated by 200 and the related key by 100.

The key 100 and the lock 200 are connected through linkers 110,210. The linkers are interconnected in any preferred wired or wireless way. Both key and lock are able to send and receive messages consisting of class-code part and unique-code part via transmitters 120,220 and receivers 130,230.

Activating the starter 111 the algorithm processor 140 checks the state register 160 whether the key 100 in 'blocked state. It is not then the algorithm processor 140 forces the class-code generator 144 and the unique-code generator 145 to generate into the temporary register 121 a 'key-identifier' message. This message sent by the transmitter 120 comprises the actual identifier 151 stored in the memory 150. After sending the 'key-identifier' message the algorithm processor 140 sets the state register 160 in a 'waiting-for-question' state. This state changes into 'blocked' one unless it receives an acceptable valid message within a certain period of time timed by timer 170. The 'blocked' state is transitional and conditional as well and is timed by the timer 170, too.

The receiver 230 in the lock 200 (assumed now to be empty or reset) delivers the received message into the temporary register 231. The class-code analyzer 241 having analyzed the content of the temporary register informs the algorithm processor 240 that a 'key- identifier-message' is received. The algorithm processor 240 sensing that the memory 250 does not contain key related data, forces the class-code generator 244 and the unique-code generator 245 to produce (into the temporary register 221) a 'question-to- store' message to be sent by the transmitter 220 through the linker 210 to the key 100. The algorithm processor 240 sets the state register 260 into a 'waiting-for-acknowledgment' state and saves the unique-code part of the received 'key-identifier' message and the unique-code part of the transmitted 'question-to-store' message as intermediate data 257 into the memory 250.

The key 100 receiving the 'question-to-store' message (temporarily stored in the temporary register 131, analyzed by the class-code analyzer 141 and the unique-code analyzer 142) as an acceptable valid message in its 'waiting-for-question' state, checks with the aid of it's comparator 143 the memory 150 whether there is a conflict between the questions 153 stored in the memory 150 and the unique-code part of the received 'question-to-store' message. If there is no conflict then the key sends to the lock 200 an 'acknowledgement' message and saves the unique-code part as intermediate data 156 into the memory 150; if there is a conflict then the key sends a 'question-conflict' message to the lock 200.

The lock 200 receiving the 'acknowledgement' message generates and sends to the key 100 an 'answer-to-store' message whose unique code part, upon receiving the next 'acknowledge' message from the key 100, will be stored into the memories 150,250 as an answer 154,253. At the same time the unique-code part of the 'question-to-store' message, previously saved in 250 will be stored in the memories 150, 250, as questions 154,253. The saved unique-code part of the 'key-identifier' message as identifier 251 as well as a 'main-key' authority 254 and a '0' parent 255 assignment as labels will be stored into the memory 250 of the lock 200, linked to the question 252 and to the answer 253.

In case of receiving a 'question-conflict' message the lock generates and sends a new 'question-to-store' message with a different unique-code part repeatedly until receiving an 'acknow¬ ledged' message.

Upon operating the key 100 which thus became the 'main key' in the same lock 200, the key 100 sends to the lock 200 the 'key-identifi¬ er' message, the lock 200 extracts the unique-code part of it with the help of the unique analyzer 242 to use as an identifier 251 and sends the stored question 252 as the unique-code part of a 'question-to-answer' message to the key 100. The key then answers with an 'answer-to-question' message by recalling and employing the stored answer 154 as a unique-code part. The lock 200 compares the stored answer 253 to the unique-code part of the received 'answers- to-question' message with the help of the comparator 243. Finding them identical, the lock driver 290 will be operated to unlock. Since the authority 254 of the used key 100 is 'main-key', the algorithm processor 240 sets the state register 260 into the 'assigning' state, in which (until the time-off timed by the timer 270) the subsequently used key will be assigned in the lock the same way as the 'main-key' was except that the authority indicator 254 stored in the memory 250 will indicate 'sub-main-key' which is a level lower than the parent-key's authority. In the lock a parent indicator 255 will indicate the key's parental origin.

8 The keys having the 'sub-main-key' authority are also able to assign new keys of 'ordinary authority' to the lock allowing them to operate the lock driver 290 but not to change other keys' assignments.

Operating again a 'main-key' or a 'sub-main-key' in the 'assigning' state of a locks', the locks state will be changed into the 'prohibiting' state in which (till the time-off) the subsequently used (e.g. lower authorized) key and associated child-keys are disabled by deleting the related data from the lock's memory. Using an improper key causes an alarm signal initiated by the algorithm processor 240 activating the alarm 291.

The states of the lock 200 can be displayed by the optical and/or acoustic display 292 and the empty state or reset of the lock can be enforced through the reset button/keyboard 293 which are mechanically closed or hidden. Using a keyboard instead of reset button provides the user with the possibility to feed a copy-code (stored in the memory 150 of the key 100 as actual copy-code 152) and any new copy-code into the lock enabling it to serve as house¬ hold copy device. The copying process is also based on messages between the lock 200 and the key 100. It comprises the actual copy-code 152, the new copy-code for replacing the actual one, both fed into the lock 200 through the keyboard 293 and the copied keys identifier for replacing the actual one in the copy. Without knowing the copy-code it is impossible to make an unauthorized copy of a key due to the high number of possible copy-codes and the self-blocking of the keys when receiving a false code. For the purpose of resetting a key into the original state (as pe manufacturer) the key 100 comprises a read-only memory 159 fo storing the original identifier and the original copy-code fo replacing the actual identifier 151 and the actual copy-code 15 in the memory 150.

The computer interface 299 is optional for larger applications e.g. in hotels or offices. There it can be useful to record use o locks or to make restrictions of the time interval for operatin the locks or setting conditions for their use. These features ar available either independently in each lock or in a centrall controlled system which is linked to the locks by the compute interfaces 299 of the locks. In addition, this interface can b used for highly sophisticated key management processing names an other data related to the keys.

This system was primarily designed to be used by the public i homes, offices, cars, cupboards, safes, etc. However, its uniqu features make it especially advantageous for official use where i is desirable to proved variable (and different from one another), changeable access for each person.

It if is necessary the key comprises an energy storage 180 t supply the key. The lock comprises energy storage 280 and energ supply 281 for recharging the energy storage.

For security reasons the unique-code part of messages can b scrambled by the unique-code generators 145, 245 and descramble by the unique-code analyzers 142,242 using the scrambling code

10 155,256 stored in memories 150,250.

11

Claims

I CLAIM :

1. Key-lock system comprising:

Key: communicating with locks via messages consisting of class-code part and unique-code part, said key includ¬ ing: a key_state register for storing states of said key, a key_timer for timing said states of said key and for resetting said key_state_register after expiration of a state of said key, a starter for initiating the operation of said key, a key__memory for storing + actual identifier of said key and + actual copy-code of said key and + questions for comparison to said unique-code part of question-to-answer class of said messages received from lock and + answers inividually associated to said ques¬ tions, to be used as said unique-code part of answer-to-question class of said messages to be sent, a read-only memory for storing original identifier and copy-code determined by the manufacturer to replace said acutal identifier and said actual copy-code in case of rest of said key, a key_comparator for comparing said unique-code part of said messages received to said ques¬ tions, a key_class-code_generator for generating said

12

TE SHEET class-code part of said messages to be sent, a key_unique-code_generator for generating said unique-code part of said messages to be sent, a key_class-code_analyzer for identifying the class of said messges received, a key_unique-code_analyzer for identifying said unique-code part of said messaged received, a key_transmitter for transmitting of said messages a key_receiver for receiving said messages key_temporary registers for temporary storing of said messages to be sent and of said messages to be received, a key_linker for linking said transmitter and receiver to locks, a key_algorithm processor to organize the operation of said key in function of said states of said key and of said class-code part of said mes¬ sages received and of the output signal of said key_comparator and of the signal coming from said starter;

Lock: communicating with keys via messages consisting of class-code part and unique-code part, said lock including: a lock_state_register for storing states of said lock, a lock_timer for timing said states of said lock and for resetting said lock_state_register after expiry of a state of said lock,

13 a reset button for initiating reset operation of said lock, questions individually associated with said iden¬ tifiers, to be sent aε said unique-code part of question-to-answer class of said messages and answers individually associated with said ques¬ tions, to be expected as said unique-code part of answer-for-question class of said messages received from the key having the associated said identifier and authority indicators individually associated with said identifiers, indicating if the key has the power to assign other keys to said lock and if it does which level of authority the other keys will have and parent indicators individually associated with said identifiers, indicating the higher authorized key which assigned it into said lock, a lock_comparator comparing said unique-code part of said messages received to said identifiers and to said answers, a lock_class-code_generator for generating said class-code part of said messages to be sent, a lock_unique-code_generator for generating said unique-code part of said messages to be sent, a lock_class-code_analyzer for identifying the class of said messages received, a lock_uniσue-code_analyzer for identifying said

14

TUTE SHEET unique-code part of said messages received, a lock_receiver for receiving said messages, lock_temporary registers for temporary storing of said messages to be sent and said messgaes to be received, a lock_linker for linking said transmitter and said receiver to keys, a lock_algorithm processor to organize the opera¬ tion of said lock in function of said states of said lock and of said class-code part of said messages received and of the output signal of said lock_comparator and of the signal coming from said reset button

a lock driver driving unlock/lock operations which is activated by said lock_algorithm_processor when the unique code part of an answer-to- question class message, sent by said key and received by said lock in its waiting-for- answer state, matches said answer, stored in said lock_memory cupled with said question which was sent to said key as a unique-code part of said question-to-answer.

A system according to claim wherein said lock comprises in any combination at least one of the following items: an alarm for generating alarm signal in certain said states of said lock, an optical and/or acoustic display for displaying said

15 states of said lock, a computer interface for interfacing computer or alike to said lock, a keyboard for replacing said reset button to enable said lock to receive numerical or alfanumerical information, scrambling codes stored in said lock_memory of said lock and key_memory of siad key to be used by said key_unique-code_generator and asid lock_unique-code_generator for scrambling said unique-code part of said messages to be sent and to be used by said key_unique-code_analyzer and said lock_unique-code_analyzer for descrambling said unique-code part of said messages received.

16

HEET AMENDED CLAIMS

[received by the International Bureau on 05 April 1993 (05.04.93); original claims 1 and 2 cancelled; new claims 1-14 added;(7 pages)]

1. A key-lock system, in which an unlock sequence includes question and answer messages exchanged between a key and a lock, comprising: (A) a key comprising: a key transmitter for transmitting messages to said lock; a key receiver for receiving messages from said lock; a key memory for storing data in said key; and data processing means coupled to said key transmitter, said key receiver and said key memory, said data processing means including: means for initiating an unlock sequence by coupling a key-identification message, including a class-code part and a unique-code part, from said key memory to said key transmitter for transmission to said lock; and means for responding to a resulting question- to-answer message received from said lock by retrieving an answer from said key memory as the unique-code part of an answer-to-question message coupled to said key transmitter for transmission to said lock; and (B) a lock comprising: a lock receiver for receiving messages from said key; a lock transmitter for transmitting messages to said key; a lock memory for storing data; and data processing means coupled to said lock receiver, said lock transmitter and said lock memory, said data processing means including: means for responding to a key-identification message, including a class-code part and a unique-code part, received from said key by analyzing said unique- code part and retrieving a responsive question from said lock memory for use as the unique-code part of a question-to-answer message coupled to said lock transmitter for transmission to said lock; means for comparing the unique-code part of an answer-to-question message, received from said key, to an answer stored in said lock memory; and means for providing an unlock signal when said comparing establishes an acceptable correspondence between said received unique-code part and said answer.

2. A key, for use in a key-lock system in which an unlock sequence includes question and answer messages exchanged between said key and a lock, comprising: a transmitter for transmitting messages to said lock; a receiver for receiving messages from said lock; a key memory for storing data, including means for storing a key identifier, a copy-code, question data and answer data; and data processing means coupled to said transmitter, said receiver and said key memory, said data processing means including: means for initiating an unlock sequence by coupling a key-identification message, including a class-code part and a unique-code part, from said key memory to said transmitter for transmission to said lock; and means for responding to a resulting question- to-answer message, including a class-code part and a unique-code part, received from said lock by analyzing said unique-code part and retrieving a responsive answer from said key memory to include as the unique-code part of an answer-to-question message coupled to said transmitter for transmission to said lock.

3. Apparatus as in claim 1 or 2, wherein said data processing means of said key and said lock each include a unique-code generator for scrambling the unique-code part of a message to be transmitted, and a unique-code analyzer for descrambling the unique-code part of a message received, using scrambling codes stored in the respective key and lock memories.

4. Apparatus as in claim 1 or 2, wherein said data processing means of said key includes timing means for causing said key to be non-responsive to said question-to-answer message in a time period beginning a predetermined time after transmission of said key- identification message by said transmitter of said key to said lock, if no answer-to-question message is received within said predetermined time.

5. Apparatus as in claim 1 or 2, wherein said data processing means of said key includes: a class-code generator for generating class- code parts of messages to be sent; a unique-code generator for generating unique- code parts of messages to be sent; a class-code analyzer for identifying the class of messages received; a unique-code analyzer for identifying unique- code parts of messages received; a comparator for comparing unique-code parts of messages received to question data stored in said key memory; and an algorithm processor for organizing the operation of said key in transmitting, receiving, analyzing, storing and other operations.

6. Apparatus as in claim 1 or 2, wherein said data processing means of said key, in order to provide a key coding capability, includes: means for coupling a reference key- identification message, including a reference class-code part and a reference unique-code part, from said key memory to said transmitter for transmission to said lock; means for responding to a resulting question- to-store message, including a class-code part and a unique-code part, received from said lock by storing said unique code part as question data in said key memory and coupling a first acknowledge message to said transmitter for transmission to said lock; and means for responding to a resulting answer-to- store message, including a class-code part and a unique- code part, received from said lock by storing said unique-code part of said answer-to-store message as answer data in said key memory and coupling a second acknowledge message to said transmitter for transmission to said lock.

7. A lock, for use in a key-lock system in which an unlock sequence includes question and answer messages exchanged between a key and said lock, comprising: a receiver for receiving messages from said key; a transmitter for transmitting messages to said key; a lock memory for storing data, including means for storing key identifiers, question data, answer data, key authority data and key parent data; and data processing means coupled to said receiver, said transmitter and said lock memory, said data processing means including: means for responding to a key-identification message, including a class-code part and a unique-code part, received from said key by analyzing said unique- code part and retrieving a responsive question from said lock memory for use as the unique-code part of a question-to-answer message coupled to said transmitter for transmission to said lock; means for comparing the unique-code part of an answer-to-question message received from said key, to an answer stored in said lock memory; and means for providing an unlock signal when said comparing establishes an acceptable correspondence between said received unique-code part and said answer.

8. A lock as in claim 7, wherein said data processing means includes timing means for providing, after activation by use of an authorized key, timed periods during which keys may be coded for use with said lock or disabled to prevent further use with said lock.

9. A lock as in claim 7, wherein said data processing means includes: a class-code generator for generating class- code parts of messages to be sent; a unique-code generator for generating unique- code parts of messages to be sent; a class-code analyzer for identifying the class of messages received; a unique-code analyzer for identifying unique- code parts of messages received; a comparator for comparing unique-code parts of messages received to question data stored in said lock memory; and an algorithm processor for organizing the operation of said lock in transmitting, receiving, analyzing, storing and other operations.

10. A lock as in claim 7, wherein said data processing means, in order to provide a capability for coding a key, includes: means for responding to a key-identification message, including a class-code part and a unique-code part, received from said key in the case in which said lock memory does not contain key-related data for said key, by generating a question-to-store message which is coupled to said transmitter for transmission to said key; means for responding to a first acknowledge message, including a class-code part and a unique-code part, received from said key by generating an answer-to- store message, including a class-code part and a unique- code part, which is coupled to said transmitter for transmission to said key; and means for responding to a second acknowledge message received from said key by storing said unique- code portion of said question-to-store message as answer data in said lock memory with respect to said key.

11. A method for operating a key-lock system, comprising the steps of:

(a) transmitting a key-identification message, including a class-code part and a unique-code part, from said key;

(b) receiving said key-identification signal in said lock, analyzing said unique-code part, retrieving a responsive question from memory and transmitting from said lock a question-to-answer message which includes said question as the unique-code part of said message;

(c) receiving said question-to-answer message in said key, analyzing said unique-code part, retrieving a responsive answer from memory and transmitting from said key an answer-to-question message which includes said answer as the unique-code part of said message;

(d) receiving said answer-to-question message in said lock and comparing the unique-code part thereof to an answer retrieved from memory; and

(e) providing an unlock signal when step (d) indicates acceptable correspondence between said received unique-code part and said answer.

12. A method for operating a key-lock system as in claim 11, additionally including a step for coding additional keys as follows: (f) introducing a subsequent key into use with said lock during a period beginning after said unlock signal is provided in step (e) by use of a main- key or sub-main-key and ending at the expiration of a timed period of predetermined length; whereby, said subsequent key will be coded for operating said lock.

13. A method for operating a key-lock system as in claim 11, additionally including steps for deactivating previously coded keys as follows: (f) reintroducing said key into use with said lock during a period beginning after said unlock signal is provided in step (e) by use of said key and ending at the expiration of a timed period of predetermined length; and (g) introducing a subsequent key, previously coded for use with said lock and having a lower level of authorization than said key previously used, into use with said lock; whereby, previously stored data related to said subsequent key will be deleted from memory in said lock and said key will no longer be coded for operating said lock.

14. A method for operating a key-lock system as in claim 11, additionally including steps for coding a key for use in said key-lock system, comprising the steps of:

(a) transmitting a reference key- identification message, including a class-code part and a unique-code part, from said key;

(b) receiving said key-identification message in said lock, confirming that a lock memory does not contain key-related data for said key and transmitting from said lock a question-to-store message generated in said lock and including a class-code part and a unique- code part;

(c) receiving said question-to-store message in said key, storing in memory the unique-code part of said message as a question and transmitting from said key a first acknowledge message including a class-code part and a unique-code part;

(d) receiving said first acknowledge message in said lock and transmitting from said lock an answer- to-store message generated in said lock and including a class-code part and a unique-code part;

(e) receiving said answer-to-store message in said key, storing in memory the unique-code part of said message as an answer linked to said question stored in step (c) and transmitting from said key a second acknowledge message; and

(f) receiving said second acknowledge message in said lock and storing in memory said unique-code part of said question-to store message as answer data relating to said key.