JPS63201283A - Improved keying system - Google Patents

Abstract

(57) [Summary] This bulletin contains application data before electronic filing, so abstract data is not recorded.

Description

DETAILED DESCRIPTION OF THE INVENTION Field of the Invention The present invention relates to electronic lock devices, and more particularly to an improved keying system for electronic lock devices.

BACKGROUND OF THE INVENTION Electronic safety systems have been well known for many years, and various approaches to designing electronically controlled door lock systems have recently emerged. Some of the early commercial devices required a hardwired connection between the central processor and the locking electronics for each door.

A disadvantage of such a system is that connections have to be installed between the central controller and the individual locking assemblies. Another problem with these schemes is the ability to otherwise "key change," or change the encoding of a key, the recoding of which is necessary for a given keying system function.

The key issue in the design of such locking devices is not so much the security they guarantee, i.e. the mechanical robustness of the locking mechanism, but the keying system information that can be used by unauthorized persons to open one or more locks. It is safety in the sense of the ease with which it is required. System specifications for this security include the number of possible values for the keying system code, the ability to update the code, and the impact on a given facility's management system if the security is breached. The keying system of the present invention takes advantage of electronic locking technology, which provides a large number of possible values for each code and allows the door lock to be rekeyed.

Another important feature of the locking device is that keying is convenient and even a less skilled person can become a keying operator. As a further feature of the security system, it is desirable to have sufficient flexibility in the design of the keying system so that a given facility can be provided with various levels of keying authorization.

A specific object of the invention is the design of a flexible and adaptable keying system. This system facilitates the design of keying systems suitable for large, complex facilities that require the features of various keying systems.

Another object of the invention is to provide a fully guaranteed secure keying system. For related purposes,
When security is breached in certain circumstances, it is highly desirable to minimize the impact of the breach, that is, to ensure the integrity of the system as much as possible. Additionally, it would be desirable for a keying system designer to be able to provide more than one level of keying authority to further increase the security of the system.

(Means for Solving the Problems) In order to achieve the above and other objects, the present invention provides that a predetermined door lock device and a predetermined key are electronically processed in response to recognition of the key by the door lock device. Provided is a method for keying (key matching code translation) a door lock device and key of a facility having a code. The method includes the steps of “defining a directional acyclic graph of a door group (i.e., an individual door lock device or a set of door lock devices);
the graph is based on the configuration of door lock devices of the facility; and the step of assigning codes to door lock devices and keys using predetermined code assignment rules according to the configuration of the door group graph. The door group graph represents the geographical and functional characteristics of the door lock devices belonging to each genus door group element of the graph. Preferably,
A door group graph includes a terminal node corresponding to a given door lock device and non-terminal nodes corresponding to a plurality of door lock devices, each non-terminal node having a corresponding terminal node that governs the possible choices of subsequent nodes as it progresses through the graph. It has “selection rules”. The process of encoding a key corresponding to a facility starts from the appropriate start node in the door group graph using the keying system architecture in the form of a directional acyclic door group graph of the present invention;
It involves proceeding down the nodes until only the terminal node corresponding to a given door device remains.

Preferably, a given key issuance operator is assigned a permission level that determines the set of permissible starting nodes during the key issuance process.

In a preferred embodiment, the codes inherent in the various door devices and keys are comprised of "zone codes," and when a key is recognized by the door device, each key zone code is compared to each door device zone code, and a positive comparison result is Provides an “access permission” determination.

Preferably, at least some of the keys are identified in one or more predetermined "key classes", each key class identifying an acceptable typology of key users, and different key classes belonging to each key class. Each key has a separate set of zone codes assigned to it.

The invention also provides a management system for door locks and keys of an installation in which the door locks and keys have codes that are processed electronically within a given door lock in response to a given key. This management system includes means for storing a database representing the configuration of the door lock devices of the facility in the form of a directional acyclic graph of door groups (that is, individual door lock devices or sets of door lock devices); .

means for accessing the database and assigning a code to a predetermined door lock device and a predetermined key; and means for encoding the door lock device and key with the assigned code.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS It should be understood that the present invention pertains to the design of an improved keying system that can be used in conjunction with a variety of electromechanical locking device technologies. For illustrative purposes, the keying system of the present invention will be hereinafter referred to in connection with an electronic locking device with a code changeable key body (where "key" is meant to be similar in design to a conventional mechanical key). However, the present invention can be easily applied to card reading techniques such as so-called "smart cards", optical systems, etc. Preferably, such a locking device is capable of storing large amounts of data, allows the use of multiple codes in the door locking device and the "key," and further allows for changing the code of the key in the door locking device as appropriate. U.S. Patent Application Nα06/84 filed March 21, 1986 and assigned to the applicant.
The exemplary system discussed below that is the subject of 2.681 is:
Meets all of the above criteria.

FIG. 1 shows very schematically the main elements of a locking device 10, in which a code-changing key 30 is inserted into a box lock cylinder (door device) 50 to open the lock. Electronic logic circuit in cylinder 50 (control electronics system)
100 recognizes the complete insertion of the key 30 and inserts the key into the key memory 40 via the key connector 45 and the cylinder connector 59.
Extract electronically encoded information from. Control electronics 100 stores and processes the keying code and inherent cylinder code received from key memory 40. Electronic logic circuit 100 can change the code in key memory 40 based on data transmitted from door device 50 and can change the code stored in cylinder 50 based on data from key memory 40.

The access codes from both the key and cylinder are processed by the cylinder's control electronics 100 to determine whether to grant or deny access. Once an "access allowed" determination is made, the release mechanism 70 receives a drive signal from the control electronics 100 to retract the radially oriented locking bin 72 from the cylinder plug 55.

Next, the user turns the key 30 to release the cylinder plug 55.
is rotated in a mechanical box lock, which rotates a cam (not shown) to release the door locking mechanism.

The cylinder 50 also has one tooth or notch 37 on the key.
It also contains a key alignment/retention bag [90] that interacts with the key 30 to ensure accurate positioning of the key 30 within the keyway 57.

The "chip-on-key" design of FIG. 1 and other code changeable key designs, such as smart cards, utilize electronically changeable integrated circuit (IC) technology. Electronically changeable IC key memories have the ability to store a significant number of access codes, each having a much larger range of possible values than in traditional mechanical locks. This non-volatile integrated circuit technology is a traditional memo! Contains memory that can be read and written to after being electronically erased, similar to ROM. Such a memory device is
Commonly known as an EEPROM integrated circuit. EE
PROM is a medium density memory that maintains appropriate key memory within a 2-3 mm micron profile device. To store data on such a device, the word must be erased and then written. Another integrated circuit technology that can be used as key memory 40 and cylinder memory 180- is the so-called EPROM.

Door System Electronic Logic FIG. 2 is a block schematic diagram of door system control logic 100 that monitors various electronic functions of lock cylinder 50. Door system electronic logic FIG. Control logic circuit 100 is a microprocessor-based system that includes central processing unit (CPU) 105 as a central element. The other main components of the cylinder control logic circuit 100 are: a key serial interface 110 that performs synchronous serial communication of access code data to the key EEPROM 40; a timing circuit 120 that provides various timing signals for the cylinder control logic circuit 100; a key detection circuit 150 that produces signals indicating complete insertion into and withdrawal of the key from the keyway 57 of 30; a power control circuit that regulates the power supply from the battery 68 to each element of the cylinder control logic circuit 100; 140; and CPU105
The release mechanism 70 releases an actuation signal in response to an appropriate command from the
This is the release mechanism driver 130 that outputs the output to the release mechanism driver 130. Timing circuit 120 optionally includes a real-time clock (not shown) to provide real-time control to the keying system as described below. Under the supervision of power supply control circuit 140, control logic circuit 100 provides respective power distribution states to the various subassemblies with consideration for low power consumption.

The cylinder control logic circuit 100 further includes a random access memory 'J (RAM) 160, a continuous memory dedicated memory 'J
(ROM) 170, and electronically changeable memory (
EEPROM) 180 and various other types of memory are provided. RAMI 60 is key serial interface 11
The data from 0 is received and the CPU 105 of this data
enables high-speed processing. ROMI 70 stores firmware for the cylinder control logic. EE
PROM 180 consists of non-volatile memory for access codes resident in cylinder 50 and may take the form of any of a number of commercially available devices.

FIG. 3 is a schematic high-level flowchart of a basic operating program 350 for cylinder control logic 100 that resides in ROM 170 (FIG. 2). At 351, key detection circuit 350 detects valid insertion of the key, and at 353, power is applied to CPU 105 and key 30 by power control circuit 140.

354, the logic is key serial I10 110 (second
5); typically different protocols are needed for the conventional key 30 and cylinder recombination device 255 (shown in FIG. 5 and discussed below). 3
56, key serial I10 110 is key memory 40
The data is read into the RAM 160.

As will be explained in more detail below, both the key and shilling memories are configured in the preferred embodiment to contain a plurality of "zone code" keying data F1, F2...FN. In the example program, the data is 3
56, each code is read from the key. Step 35
8 and each subsequent step 359...361.36
The program is a block consisting of 2 and 364 blocks, and the program is stored in ROM.
170 (see section ``Keying System Features'' discussed below) and then interprets the key code just read. Depending on the performance of the particular subprogram, this interpretation process results in an "access permission"decision; for example, by recombining keys or by transmitting information about cylinder 50 to the clerk console 3.
50); and further cylinder memory 180.
Issue a command to change the code. If necessary, it is preferable to change the cylinder code at this stage.

At 362, the CPU tests the key data in RAM 160 to determine whether the "end of data" flag is present, and then at 364, the redundancy check code in the key data is analyzed and valid key data is accepted. Check to see if it is correct.

If the above test is unsuccessful, invalid key data is reread.

At 365, the output code resulting from the above processing of the key code is written to the key or a device similar to the key (eg, to change one or more zone codes of the key).

At 366, the CPU determines whether the function processing resulted in an "access allowed" state, and if that state exists, the CPU
At 68, the release mechanism driver 130 (FIG. 2) is actuated to open the lock. If the “access permission” flag is not present, the system will enter a “timeout” state with 367;
Timing circuit 120 then clocks a predetermined time interval during which key detection circuit 150 is not permitted to output a valid key press signal. A timeout step 367 limits the number of times an unauthorized user can apply multiple random codes to control logic 100 using a key-like device. The timeout condition may occur after a predetermined number of key insertions. 369 is the power supply control circuit 14
0 turns off power to CPU 105 and release mechanism driver 130.

Access code memory structure Table 1 shows the EEFROM 18 of the cylinder or door device.
2 shows a preferred memory map for access codes contained within 0 (FIG. 2). This memory map is EEPROM
The logical addressing scheme of the lock control program for sequentially retrieving data from memory cells within I 80 is schematically illustrated and is not necessarily representative of the physical layout of the memory cells. Memo! 7180 includes various fixed format fields having a predetermined number of allocated data bits and a variable format section for function storage. Fixed format fields are
“Door unit identification number” is a serial number that identifies 0.
but does not include any safety protection functions; and a "programming code" which is a security code that must be transmitted to the control logic circuit 100 of the cylinder to allow changes to the memory 180, as described below in section "Management System". ” Contains. Other fixed format fields not shown in Table 1 may be included as required by the door device firmware. The function storage field contains data depending on the particular keying system function programmed into cylinder access code memory 180, as shown in Tables 2 and 3.

As a specific example, key memory 40 is configured similar to the cylinder code map in Table 1, but the programming code column is omitted.

Table 2 shows the preferred record structure - zone functionality. In a basic embodiment, the zone function compares each of the set of key zone codes to each of the set of cylinder zone codes and allows access if there is a match. The header byte of this memory map gives the number of zone capability records (4 in this case). Together with a priori knowledge of the memory occupied by each zone's records, the header bytes enable addressing routines to scan logical memory to locate the next function in functional memory (Table 1). . Within each record, a combination of codes represents the codes that must match to initiate the corresponding function. Status bits 81-S5 (five shown for example purposes) are associated with special zone characteristics, and the setting of a particular used bit identifies a code combination with that characteristic. For example, Sl allows only one use of a key. Associated with "one time use"; S2 is identified as an "electronic lockout" which allows a special lockout key to prevent access by a regular key until the lockout key is used again. Status bits 81-S
If none of 5 is set, the combination of codes will be the basic zone code mentioned above, which will not undergo any further processing, and an "access permission" determination will be made based on the match between the key and door device zone codes. .

Zones As mentioned above, "zones" are base data that are attempted to match before granting access. Preferably, each key and each door device includes a plurality of codes, each code representing one zone. From a keying system perspective, each zone can be defined as a collection of door devices and keys that share a common code. Storage is required for both door devices and keys for each zone involved; in other words, storage limitations are correlated to the number of types of access that can be tolerated. This storage scheme is superior to storing a list of authorized keys for each door device, or storing a list of authorized door devices for each key. The latter method is susceptible to security violations and wastes storage capacity.

In key memory 40 and cylinder memory 180, each zone is assigned a predetermined code width (number of binary digits per code), which inversely determines the total number of zones available within the EEPROM. All else being equal, a larger code width will be slower, but it will be more robust against attempts to gain unauthorized access by, for example, sending the Tyndum code electrically to the lock.

Characteristics of the Keying System Tables 3 and 4 show a simplified record structure of the cylinder and key memory function storage fields for the basic zones and one-time use functions, and the structure of the access code memory and ROM.
Reference should be made in conjunction with the flowchart schematic diagram of FIG. 4 illustrating the relationship between the corresponding keying system routines within 170. The record structure of the door locking device has three zone records with associated "one-time use" status (pictures) SL (Table 3) Simplified memory map Table 4 for door zone functions Simplified memory map Table 4 for key zone functions (Table 3) On the other hand, the structure of the key memory has five zone records, but does not include the associated states, ie, used bits (Table 4).

In the basic system program of Figure 3, the control firmware includes various subroutines as part of the "Function Selection" block that correspond to specific keying system features, including the "Basic Zone/Single Use Subroutine" of Figure 4. ing. “Basic Zone/Single Use Subroutine”
The key pointer I (for example, pointing to a specific record or row in Table 4) and the door device pointer J (pointing to a predetermined door device zone code, see Part 3) each range from 1 to the respective "number of records". Contains a host-like loop that increments to a value. For each pair of I, J values, the routine compares in step 335 the "code combination" in the applicable door system zone and key zone records. If a match is found, the program sets the cylinder S1 flag (CYL=31) for the corresponding record J at 338.
(J)) is set. If this "one-time use" flag is not set, the routine moves directly to step 341 to determine "access permission". However, if the flag is set, the routine first uses a pseudo-random number generated from the management system to enter the cylinder code (J).
, which prevents keys from being used repeatedly to open the same lock cylinder.

If the zone function data structure takes a more complex form as shown in Table 2, other states (i.e. usage pins)
The subroutine of FIG. 4 is modified to include an appropriate algorithm to determine whether any of S2-S5 are set and to implement these additional keying system features.

The locking device of the present invention is capable of achieving all of the conventional keying system features found in mechanical locks (eg, great grandmaster keying, cross keying, etc.), as well as other additional useful functions. Additionally, the door system access code memory 180 may also include updating of key codes that are written to the key memory 41 in the performance of certain keying system functions. Special keying system functions may be provided to selectively update the key memory 40 and/or door device memory for increased flexibility, including security protection and, more generally, to prevent unauthorized copying of key codes. It can be designed to

Based on a given keying system function, it may be desirable to change one or more zone codes due to the discovery of a security breach or need to change the door system code for other reasons. To facilitate this code modification, the keying system preferably associates each zone code with a meaningful zone code identifier based on the characteristics of the door device and key carrying that code. Additionally, the keying system can also be recoded using a predetermined "primary" key and special code attached to the cylinder.
In embodiments where the door system control electronics 100 includes a real-time clock, the keying system can be extended to include a time-of-day control.

This time control can correspond to each keying function. In the case of basic zone/single use, time can be associated with each door zone (ie, a set of door devices includes a common zone code). The function of the keying system is
It may also be modified to include one or more time access windows, automatic cylinder recording at predetermined times, and other features. The structure of the cylinder memory must be replenished with a time code with one byte for every significant time interval within a day. According to the management system discussed below, the key/initialization console 250 and central controller 260 would have the ability to maintain time in such a system. Timing circuit 120 (
By including a calendar timekeeping device in FIG. 3), the principles described above can be applied to features of the keying system associated with particular days, weeks, etc.

Management System An electronic lock device embodying a keying system according to the present invention can also be incorporated into a "hardwired" electronic lock installation using a communications network connecting various lock cylinders to a central management system processor. However, in the preferred embodiment of the invention, door system 50 comprises a separate system that does not include wired communication. Referring again to the configuration shown in FIG. 1, the keys can be encoded at a remote station to send the code to the lock cylinder 50, so that the EEPROM element 41 in each key 30 has direct communication with the central controller. Acts as a replacement for a communication link. key 3
The zero can be encoded with a special code recognized in the cylinder's access code memory 180. As shown in FIG. 5, the management system preferably includes one or more consoles 250, which may take the form of, for example, a portable combination including a dedicated person/output device. A key socket 352 accepts the insertion of the key 30 and connects the inserted key to internal logic circuitry for key initialization or code changes. Cylinder recombination device 255 includes a key blade 256 similar to a normal key blade (flat plug) and a plug 257 that engages with an electrical outlet (not shown) on the back of console 250. Therefore, the portable console 250 can be transported to a predetermined door device 50 location to serve the purpose of initializing or reconfiguring the door device memory 180.

Preferably, the management system is adaptable to the requirements of users of facilities such as hotels and universities. Referring to FIG. 6, the system may include a plurality of six clerk consoles 250a-d configured as shown in FIG. 5 and communicating with a central controller 260. It acts as a repository and downloads the data to the respective consoles 250a-d, i.e. the central controller 260 stores the identification name (
Keep track of all zone codes that are currently assigned, including, for example, the identification name of the door system (see Table 1). Each console 250a-d encodes the key as required by the keying system's database and stores it in the console into which the key is inserted. Each console 250 can check a central controller 260 to consult a central database, and sensitive information can be protected by passwords or other features (see "Operator Permissions, Key Classes" section below).

The preferred management system is characterized as a distributed processing system capable of real-time processing across all individual locking devices 50.

Zone-Based Keying System Design The keying system preferably includes a set of rules for logically and efficiently assigning zone codes to each door device and key.

In combinatorial automated keying systems, the keying system designer establishes a logical structure (“architectural matrix”) within the framework of certain design rules, and this logical structure is based on the geographic and Based on functional characteristics. In a preferred embodiment of the Combiator automated keying system, the architecture matrix takes the form of a multidimensional array and includes one or more parameters representative of the configuration of the door locking device. This parameter preferably includes therein "selection rule" restrictions governing the assignment by the key issuing operator of features delivered to the door device and key. Additionally, the system automatically assigns zone codes to delivery keys according to predetermined assignment rules based on the door device and feature assignments. In such a scheme, the design rules for the architecture matrix and the rules for interpreting a given architecture map are established in advance, and the keying system designer generates or modifies a given architecture matrix based on the requirements of a given facility. .

A preferred method of establishing and interpreting the architecture matrix is discussed next.

In a preferred embodiment of the door group invention, the process of designing the keying system for a given facility, the issuance of keys, and other features of the management system are defined in the simplest case as a "door device or collection of door devices." It relies on an architectural matrix based on “door groups” that are However, to allow for a hierarchical definition of "door groups," this term is expanded to include "groups of door groups." Each door group has an identifying name chosen by the keying system designer, often preferably a name related to local geography or function. In contrast, it is desirable to choose the codes assigned to a zone completely independent of its associated door, door group, and key to reduce the possibility that key data will be leaked to unauthorized parties.

The extensible definition of “door groups” provides great flexibility in system design; door groups can be keyed based solely on the requirements of a given installation, rather than being constrained by the specific keying system used. can be defined by the designer. Optimal use of this method requires multiple zones on both the door and the key.

Keying, Door Group Graph As discussed above, the present invention provides a logical method for designing the architectural matrix of a keying system for a given facility using the concept of door groups. defines a “door group graph” in the form of a “directed acyclic network” in which each node represents a door group; thus, in this logical scheme, each door group corresponds to an individual node in the graph. Directed acyclic network, as used here, means a hierarchical graph or network consisting of nodes that interconnect edges or branches, each edge having a determined direction. If you follow a fixed direction from node to node, you will never be able to return to the previous node.Such networks are generally "trees" in the mathematical sense, i.e. each node has only one node. It consists of acyclic graphs with immediately preceding (“predecessor”) nodes, but also includes graphs in which multiple branches merge into one “predecessor” node.The architectural matrix of established keying systems (door group graph ), the key-issuing operation begins with an authorized start node, as described below, and follows a defined “selection rule” until only the terminal node remains, which typically identifies a particular door device. ”
Proceed to the lower nodes according to the following.

SELECTION RULES A "selection rule" is a set of rules for governing the decisions of a keying operator in choosing none, one, or more of the immediate subordinate nodes;
One rule is assigned to each node in the door group graph except for terminal nodes. A preferred set of selection rules used to define the architecture of a keying system includes the following terms: (1) all (2) one (3) each (which has the same effect as "all") (4) Any (i.e. none, any one, or more than one) (5) At least one of the above selection rules, with the first two Covers most of the decisions that need to be made by the designer of the keying system; the first rule requires virtually no decisions, although these rules impose severe constraints on the decisions of the key-issuing operator.

The third rule "each" has exactly the same effect as the first "all" from the key-issuing operator's point of view, but has several security advantages as discussed below. The fourth rule, "arbitrary", provides maximum flexibility in door group selection. The fifth rule, “at least one,” is similar to “any,” but excludes the possibility of not choosing any door group; this would, for example, require gym patrons to have keys for one or more locker doors. It can be used for making deliveries.

Both "all" and "each" selection rules can include all subordinate door groups, but are distinguished in the assignment of zone values to immediately subordinate door groups. That is, "all" generally assigns a common zone value to subordinate door groups, while "each" gives each door group a separate zone value. This effect will become clearer if we consider the issuance of a security master key. For example, if a resident were to determine the zone code of his or her room's door system, which can also be opened with a secure master key, that resident could then learn the zone code of the secure area. This information can be misused to gain access to all door devices accessible with the secure master key. However, if the "Each" selection rule is used, each zone area of the security master key is divided, so the dormitory resident can only access a part of the known security master door device, reducing the possibility of destruction. Can be controlled. Note that the "one,""any," and "at least one" rules all require such a distinction.

The keying process uses a management system such as that shown in FIG. 6 to display a series of "screens" on the Lark console 250 that allow the keying operator to navigate through the relevant portions of the door group graph and make the appropriate selections. It can also be implemented as an "on-line" system that guides the recording of the results of decisions. The process of progressing on the graph continues node by node until only terminal nodes remain. At each node where a decision needs to be made, a menu is displayed for the selection rules applicable to that node, and door groups for that node and subsequent nodes are displayed (preferably based on key functions or regional geography).
Confirmed in the imperative created by the keying system designer. The keying operator need only carry out decisions that have been established in advance by the keying system designer, and these decisions are designed to ensure proper security, integrity and rationality of the issuing keys.

FIG. 7 shows a portion of a door group graph for university facilities, ie, a graph 400 for issuing keys to each dormitory student. When referring to the graph of FIG. 7 and the bundle floor plan of FIG. 8, reference should also be made to Table 5 to determine the meaning of the various door groups and door devices shown in these figures. In Figure 7,
The starting point node 401 represents a door group consisting of all the doors of the dormitory. Since node 401 has an "all" selection rule, the issuing operator must branch into "entrance" door group 402 and "floor" door group 403. At the "1st floor" node 403, the operator must select between floors 1 and 2 (nodes 408 and 409). Referring to the bundle floor plan in FIG. 8, the operator moves the graph up to the terminal node according to the selection rule 405. If you trace it,
The keys will be coded for both the front and back entrances, one floor including the stairwell 511 for residents on the second floor, the entrance to the adjoining room and the bathroom door, and one room in the adjoining room. That should be obvious.

For example, the key issuing program may include a series of nodes 401.4.
02.404.405.403.408.412.41
Sufu corresponding to 5.417.413.422 ・
A lean screen is displayed, and the keys are coded for the front and back building entrances, the entrance and bathroom entrance for the adjoining room 101, and the door of Room A of the adjoining room.

The geometric model of the keying system architecture matrix in the form of a directed acyclic graph has an equivalent data structure that allows the keying process to be automated with a combicoater. As used herein, "equivalent data structure" refers to a data organization of door groups that has the logical equivalent of a directional acyclic door group. Table 6 shows the data structure of an indentation list equivalent to the door group graph of FIG. This is an indented list with each door group representing one element of the list. This list can be ordered either by the illustrated "count index" or by various other sequences known from graph logic. Each door group represents its level within the keying system's architectural hierarchy. “Level index”
is assigned, which visually represents the 6th door group name.
Table Sample indentation list 1 Student dormitory 1-2 2
All dormitories are on the 3rd floor
1 4 4 Floor 1 1-5 5 Contiguous rooms All 6 6
Population: 6 Bathrooms: 8 6 Bedrooms: 197
A 07B 11 7 C 27D 13 5 1 adjoining room 14 6
Population 15 6 It is expressed by the degree of bathroom intention. Each door group has a corresponding selection rule, except for the terminal door groups (i.e. door devices). The keying program processes each element of the list either in count index order or in various other sequences known from graph logic, applying selection rules at each level to each element in the next level. Therefore, a door group graph can be defined using a data structure including each parameter V1 for a node, that is, a door group; El for a directional edge connecting these nodes; VOT1 for a starting point node, and R1 for a selection rule corresponding to each node.

Assigning Zone Codes The encoding of the above examples (second to last paragraphs of the previous section) can be done by using the selection rule/zone code assignment method described above and assigning the following three zone codes to the keys; and the zone code that includes the rear artificial door, the zone code that includes the entrance to the suite and the bathroom, and the zone code for student cars.

(See Table 7). Note, however, that the zone concept is extremely flexible and many other methods can be used to assign zones to groups of doors and keys. For example, in the above case, the same door system could be used for a given key using only two zones, one containing the building entrance and the other containing the entrance and bathroom doors for the individual student bedrooms and their adjoining rooms. It can also be assigned to (See Table 8). In the former example, the common door system for the next room (515, 519) only has one base zone code shared by all students there, whereas in the latter example, the same door system for the other bedroom Each student has a separate code to deny access to the suite. The selection rules and allocation schemes described above represent an efficient and flexible approach.

Table 7 Example of basic zone assignment for keys Zone 1 Door device 504.505 Zone 2 Door device 515.519 Zone 3 Door device 522 Table 8 Example of basic zone assignment for keys 2 Zone 1 Door device 504.505 Zone 2 Door Devices 515.51T, 522 Operator Permissions, Key Classes In the preferred embodiment of the keying scheme of the present invention, each keying operator is given permission to initiate processes only on defined groups of doors. Each operator's access is therefore restricted to door groups and door devices, including the authorized start door group and those below it. The system prevents the operator from viewing the rest of the door group graph during keying.

Only qualified operators are allowed access to the top node, the node by which they can see the entire structure.

The architecture of the keying system according to the invention is:
It is preferable to use "key classes" which correspond in a general sense to acceptable types of key users. Example of university dormitory (
Considering Figure 8), key classes include dormitory residents, cleaners, plumbers, maintenance staff, and dormitory instructors. Each key class is associated with a start node defined for delivering keys to each member of that class, and each key class.

Each zone is assigned an independent set of zone codes. Thus, referring to FIG. 7, since two different key classes are associated with start node 401, the keying system includes two sets of zone codes in parallel. Therefore, even if the zone code for one key class is leaked, the zone code for the other key class is not compromised.

In the operator authorization system described above, it is preferable that the door group from which the key issuing operator starts is associated with the key class. However, other mechanisms are possible that require the operator to authorize key issuance.

[Brief explanation of the drawing]

FIG. 1 is a schematic diagram of an electronic door locking device according to an exemplary embodiment of the invention; FIG. 2 is a block diagram of an electronic logic circuit for the door locking device of FIG. 1; A schematic flowchart of the basic operation program for logic circuits; FIG. 4 is a schematic flowchart of the basic zone/one-time use subroutine for electronic logic circuits in FIG. 2; FIG.
FIG. 6 is a perspective view of a preferred management system configuration for the electronic locking device of FIG. 1, embodying the console of FIG. 5; FIG. 7 is a perspective view of the present invention; Schematic diagram of door group graph based on;
and FIG. 8 is a partial plan view of a basic floor plan corresponding to the door group graph of FIG. 7. 30...key member, 50...door lock device,
40.180...Memory means, 105...Processor 170...Functional memory, 160...Tracking means, 3
30... Keying function routine, 366... "Access permission" determination step, 400-... Directional acyclic door group graph, 401.402, 403.404
．． 405・・・・・・Door group (401; Start node, 404.405.415.417.422
~429; Terminal node (individual door lock device), 40
2.403... Non-terminal node (multiple sets of door lock devices)), 503.504.505... Equipment door lock device, F1, F2...; FI, FJ...
Code (FI; key zone code, F is the door lock device zone code. Word of drawing (no change in content) FIG, 7 1. Indication of incident Patent Application No. 67693 of 1988 2
0 Title of the invention: Improved keying system 3, Relationship with the person making the amendment: Applicant 4, Sub-Attorney 5, Date of amendment order: May 26, 1985 Nos. 1 to 3 of the drawings originally attached to the application. As shown in the engraving appendix in Figure 7 (no change in content) Procedural amendment 1, Indication of case 1988 Patent Application No. 67693 2, Title of invention Improved keying system 3,
Relationship with the case of the person making the amendment: Applicant 4, Agent 5, Date of amendment order: Initiator 6, Number of inventions increased by this amendment: 27, Subject of amendment: Scope of claims in the specification, column 8, Amendment Contents As shown in the appendix, claims (1) A management system for a door lock device and key of an equipment, wherein the door lock device and the key are electronically processed within a predetermined door lock device according to a predetermined key; a central processor means for storing a database representative of the configuration of door locking devices of the installation in a data structure that logically corresponds to a directional acyclic graph of door groups; , where the terminal "door group" node of the graph represents a door lock device, the non-terminal node represents a group of door lock devices, and further accesses the database to store a predetermined door lock device and a predetermined door lock device. A management system comprising means for assigning a code to a key and means for encoding a door lock device and a key with the assigned code. (2) As each non-terminal node progresses on the graph, A management system according to claim 1, characterized in that it has corresponding selection rules governing the possible selections. (3) Determining the parts of the data structure of the door group graph that are used to assign codes to keys. The management system according to claim (1), characterized in that a predetermined key can be assigned to a key class to which a predetermined key is assigned. The management system according to claim (1), characterized in that a permission code for determining the area is assigned. (5) The code of the door lock device and the key includes a “zone code”, and the key is a door lock device Once recognized, each key zone code is compared to each door lock device zone code, and if they match, “access granted” is granted.
2. The management system according to claim 1, wherein the management system makes a determination as follows. (6) A management system for a door lock device and key of a facility, in which the door lock device and the key have a code that is electronically processed within a predetermined door lock device according to a predetermined key. for storing a database representing the configuration of a facility's door locking devices in a data structure that logically corresponds to a directional acyclic graph of door groups (individual door locking devices or sets of door locking devices); central processor means, wherein each non-terminal node has a corresponding selection rule governing the possible selection of successor nodes as it progresses over the graph; A management system comprising means for assigning a code to a key and means for encoding a key with the assigned code. (7) A terminal node represents an individual door lock device, and a non-terminal node represents a set of door lock devices. The management system according to claim (6), characterized in that: (8) A management system that represents a predetermined key in a key class that determines a part of the door group graph data structure that is used to assign codes to keys. The management system according to claim (6), characterized in that the operator who issues the predetermined key is assigned an authorization code that determines an accessible portion of the data structure of the door group graph. The management system according to claim (8), further comprising means for making an inquiry to the operator who issues the αQ key, according to a selection rule that requires the operator to make a decision. Claim (6)
Management system described in. 7. The management system according to claim 6, wherein the αυ data structure is logically equivalent to a "tree". 7. A management system as claimed in claim 6, characterized in that the data structure further comprises "edges" consisting of ordered sets of door groups. Q31. The management system according to claim (sub), wherein the code assigned to the edge including the St-end door group is assigned to the key to be encoded in the corresponding door lock device. 00 The door lock and key codes include "zone codes", and when a key is recognized by the door lock, each key zone code is compared to each door lock zone code, and if both match, "access permission" is issued. The management system according to claim (sub), characterized in that it issues a determination of ``. (2) A method for issuing keys for equipment having a plurality of door locking devices, wherein the door locking devices and keys are configured to store a database of a keying system in a logical form of a directional acyclic graph of “door groups”. A "door group" has an access code that is processed electronically within a given door locking device in response to a given key using an electronic data processing device that stores it in the form of a "door group". defining a subgraph representing a plurality of sets of door locking devices and comprising all or a portion of the door group graph and including a starting door group in the case where the graph is based on the configuration of door locking devices of the facility; selectively following said subgraph starting from the starting door group according to selection rules corresponding to all door groups except the terminal door group; and typing an access code for each terminal group encountered while following said subgraph. and encoding the key with the assigned access code. e. the selection rules include a "select all" rule that causes an encounter with all subsequent door groups and a "select one" rule that requires an encounter with only one subsequent door group; The method according to claim αω. 5. The method of claim .alpha..omega., further comprising the step of, upon encountering a door group requiring a determination at .alpha., interrogating a key-issuing operator to obtain the determination. 0IID defined in claim 0, wherein the step of defining comprises: identifying a key class characterizing a type of key user; and identifying a starting door group specific to the key class. Method. α ■ The access code includes a “zone code” and each key zone code is compared to each cylinder zone code while the zone code for a given key is processed electronically by a given door locking device. The method according to claim αS. (to) A method of keying a door lock device of a facility, wherein the door lock device and the key are set to a predetermined door lock device according to a predetermined key using an electronic data processing device that stores a database of the keying system. define the data structure for said database in the logical form of a directed acyclic graph of "door groups", where a "door group" representing a door lock device or a plurality of sets of door lock devices, the graph being based on the configuration of door lock devices of the facility; and coding a door lock device with the assigned code. (21) The keying method according to claim (to), further comprising the step of assigning an access code to the key according to the correspondence between the access code and a part of the data structure encountered when issuing the key. the method of. (22) The keying method according to claim (a), wherein the door group graph represents geographical and functional characteristics of door lock devices that constitute various door groups. (23) A door group graph has terminal nodes each corresponding to a predetermined door lock device and non-terminal door group nodes corresponding to a plurality of door lock devices, and each non-terminal node is connected to a subsequent node as it progresses on the graph. A keying method as claimed in claim (a), characterized in that it has a corresponding selection rule governing the possible selections of the keys. (24) Claim (21) further comprising: defining a key class that characterizes the type of key user; and using the key class to impose restrictions on a part of the data structure. )
The keying method described in .

Claims (1)

[Claims] 1. A method of keying a door lock device (50) and a key (30) of equipment;
0) and the key (30) has a code (F1, F2...) that is electronically processed in a predetermined door lock device according to a predetermined key (30): "Door group" (401, 402 ) or an equivalent data structure for "door groups" (401, 402...)
are individual door lock devices (404, 405, 415...
) or a plurality of sets (402, 403...) of door lock devices, and the graph (400) is based on the configuration of the door lock devices (503, 504, 511...) of the facility; and the door group graph A keying method comprising: assigning codes (F1, F2...) to a door lock device (50) and a key (30) using a predetermined code assignment rule according to the configuration of the key (400). 2. Claim 1 in which the door group graph (400) represents the geographical and functional characteristics of the constituent door lock devices (503, 504, 511...) of various door groups (403, 404, 411...) Keying method described in section. 3. If the door group graph is set to the specified door lock device (50
4, 505...) corresponding to the terminal nodes (40
4, 405, 415, 417, 422 to 429) and non-terminal nodes (
401, 402, 403...), and each non-terminal node (40
1, 402, 403...) progresses on the graph (400), the subsequent nodes (402, 403, 404, 405,
408, 409...) A keying method according to claim 1, comprising corresponding selection rules (450) governing the possible selections of 408, 409...). 4. The process of encoding a key (30) for a facility with a given door group graph (400) ends with the appropriate start node (40) in the door group graph (400).
Starting from 1), a predetermined door device (504, 505...
) until only the terminal nodes (404, 405...) corresponding to the lower nodes (402, 403...) remain.
2. The keying method according to claim 1, comprising proceeding to step ). 5. A keying method according to claim 4, wherein a predetermined keying operator is assigned a permission level that determines the set of permissible start nodes (401). 6. Door lock device and key code (F1, F2...)
contains a "zone code" and when the key (30) is recognized by the door lock device (50), each key zone code (FI) is compared to each door lock device zone code (FJ) and a positive comparison result A keying method according to claim 1, which results in an "access permission" determination (366). 7. at least some of the keys (30) are identified in one or more predetermined key classes, each key class identifying an acceptable typology of key users, and different key classes belonging to each key class; A keying method according to claim 1, comprising each separate set of zone codes (F1, F2...) assigned to a key (30). 8. A management system for the door lock device (50) and key (30) of the equipment.
and the key (30) generate a code (F
1, F2...), a database representing the configuration of the door lock device (504, 505...) of the facility in the form of a directional acyclic graph of "door groups" (401, 402...) means (260) for accessing the database and assigning a code to a predetermined door lock device and a predetermined key (250); and means (250) for encoding the door lock device and key with the assigned code; ); a management system that includes; 9. The directional acyclic graph (400) has a plurality of terminal nodes (404, 405...) corresponding to a predetermined door lock device (504, 505...) and a non-terminal node (401) corresponding to a plurality of sets of door devices. , 402...), and each non-terminal node (401, 402...) forms a graph (400
) when proceeding over the subsequent nodes (402, 403, 404
, 405 . 10. The management system according to claim 9, wherein a predetermined key issuing operator is assigned an authorization code that determines an allowable portion (401, 402, . . . ) of the door group graph.