KR19980086957A - Identification device and identification method - Google Patents

Abstract

An identification device of the present invention is a detection device for transmitting a first identification signal representing a specific identification code composed of a plurality of divisions each of which has been determined with a predetermined number of bits, and the first identification signal is sent from the detection device. And a detection device for identifying whether or not the device to be detected has been registered in advance, wherein the detection device has a second identification indicating a registration identification code composed of a plurality of divisions each having a predetermined number of bits. A storage unit in which a signal is stored in advance; a matching unit for matching the received first identification signal with a second identification signal read out from the storage unit; and controlling the matching unit to specify the same classification for the same division. The identification code is compared with the registration identification code, and the registration identification code to be compared after matching with the specific identification code in the classification is specified. And a processing control unit for repeating the control of the matching between the divisions and the specific section of the registration identification code to be compared next, and repeatedly performing the matching between all the divisions while changing the matching division. It also provides an identification method.

Description

Identification device and identification method

The present invention relates to an identification device and an identification method suitable for example as a keyless entry system.

Conventionally, a key device as a mobile terminal and a lock device as a main body device provided on a control target side, such as a door, are registered in advance, and the operation of the key device by wireless is registered in advance. A keyless entry system has been proposed in which a lock device identifies whether or not the key device is unlocked and performs lock release / lock.

This conventional keyless entry system uses an infrared ray or radio wave to transmit an identification signal from the key device side to the lock device side so as to perform lock or unlock.

In such a conventional keyless entry system, since the one-way communication always transmits the same identification signal from the key device side, there is a risk that the identification signal is simply stolen when the third party receives the communication.

In particular, when the identification signal is transmitted using infrared rays, the identification signal can be simply copied by the same principle as the so-called learning remote control, which is a social problem.

In addition, in the keyless entry system described above, there is a big problem in terms of security, such as being able to find a specific identification signal by trying various identification signals many times.

Therefore, a darkening signal indicating a darkening value is transmitted from the portable device (key device) side to the main body device (locking device) side, and the main body device has its own darkening value calculated by arithmetic processing of the darkening signal. A keyless entry system that first determines the correspondence with the received cancer symptom value has been proposed.

The keyless entry system proposed above has the advantage of high security since the main body apparatus judges the coincidence between its registered cancer value and the received cancer value, which is calculated by arithmetic processing of numerical signals. .

In the conventional keyless entry system, in contrast to the cancer value, the cancer value calculated internally and stored (registered) in the memory or the like is compared with the cancer value received by retrieving, for example, from the first memory address. If the numbers do not match, the cancer value of the next address is searched, and a method of contrasting the cancer value in the memory is searched in order.

However, in this method of matching by sequential search, when the registered cancer symptom value increases, it takes time to collate so much, and when dealing with tens of thousands of cancer symptom values, it is disadvantageous that it requires considerable time to unlock / lock. There was this.

Therefore, in the conventional keyless entry system, since the response time is long since the user instructs the lock / lock release until the lock / lock release is actually performed, the responsiveness is bad.

SUMMARY OF THE INVENTION The present invention has been made in view of the above circumstances, and an object of the present invention is to provide an identification device and an identification method which are excellent in responsiveness after giving an instruction to start operation and are advantageous in terms of power consumption.

1 is a block diagram showing a schematic configuration of an identification device (keyless entry system) according to the present embodiment.

2 is a flow chart illustrating operation of the keyless entry system of FIG.

3 is a timing chart illustrating transmission and reception and intermittent operation in the keyless entry system of FIG. 1;

4 is an explanatory diagram showing a format structure of an identification code;

5 is a view systematically side-by-side identification code to facilitate the search of the registration identification code.

Fig. 6 is a flowchart showing the procedure of ID code matching (step S12) in Fig. 2 as an example of searching for a registration identification code from top to bottom in Fig. 5 and matching it with a specific identification code.

Fig. 7 is a block diagram of a keyless entry system showing a modification 1 related to random number generation.

FIG. 8 is a flowchart showing the contents of random number generation (S4 in FIG. 2) in the modification 1. FIG.

Fig. 9 is a block diagram of a keyless entry system showing a modification 2 related to random number generation.

10 is a flowchart showing the contents of random number generation (S4 in FIG. 2) in the modification 2. FIG.

Fig. 11 is a block diagram of a keyless entry system showing a modification 3 related to random number generation.

Fig. 12 is a flowchart showing the contents of random number generation (S4 in Fig. 2) in the third modification.

Explanation of symbols for the main parts of the drawings

1: key device (detection device), 2: door, 3,20,30,40: lock device (detection device), 4: switch part, 5: signal processing part, 6: transceiver part, 7: ID memory, 8 : Battery, 9: transceiver, 10: drive unit, 11, 21, 31, 41: processing controller, 12: registration ID memory (memory), 13: random number generator, 14: battery, 15: power controller, 16 : Timer, 17: decryption unit, 18: control unit, 22, 42: random number changing unit, 23: random number memory, 24: comparison unit, 25: output control unit, 33: arithmetic processing unit, 43: counter, IDS: specific Identification code, IDR: Registration identification code, MID: Main group ID code, SID: Subgroup ID code, IID: Individual ID code, X: Random number, C: Count value.

The identification device of the present invention is provided with two types of devices capable of transmitting and receiving signals by mutual radio: a detection device for transmitting the first identification signal and a detection device for identifying whether the detection device is registered in advance. Consists of.

The detection apparatus has a storage unit in which a second identification signal is stored in advance, a first identification signal received, and a matching unit which matches the second identification signal read out from the storage unit, and the first identification signal. Each of the specific identification code indicated by the identification signal and the registration identification code indicated by the second identification signal is composed of a plurality of divisions in which the number of bits is respectively determined by a predetermined number.

Further, the detection apparatus controls the matching unit to perform matching between the specific identification code and the registration identification code for the same division, and the registration identification code to be collated after matching with the specific identification code in the division. And a processing control unit for repeatedly performing the control of the matching between the divisions, and the specification of the registration identification code to be collated next, and repeatedly performing the matching between all the divisions while changing the division to be collated.

In the present invention, the detection device further includes a random number generator that generates a random number transmitted as the random number signal to the device to be detected, and the device to be detected uses the received random number signal to perform the detection. And a signal processing unit for encrypting the first identification signal and transmitting the same to the detection apparatus.

In this case, the processing control unit decrypts the first identification signal after encryption, reads out the first identification signal before encryption, and then performs matching between the divisions.

Further, in the present invention, the registration identification code has at least an upper division and a lower division, and in the entire registration identification code stored in the storage means, a plurality of the above-mentioned codes different in any of the upper divisions having the same code. The sets of lower divisions are equally assigned, and the divisions are layered.

In this case, the processing control section controls the matching section to change the matching section from the uppermost division to the first and the lower division.

In the identification device configured as described above, at the time of collation by the collation unit, the processing control unit controls the collation unit, and first, for example, searches for the uppermost division, and selects the specific identification code and the registration identification code for the upper division. In turn, the matching registration identification codes are identified in this division. Next, with respect to the common registration identification code, the most significant division is searched for, for example, one division lower than the most significant division, and similarly, the matching and matching between the divisions are determined. By repeating the matching between the divisions while changing the division, the range to be contrasted is gradually narrowed down, and finally, the registration identification code that completely matches the specific identification code is specified. If no match is found within the checked division, the process is forcibly terminated at that point.

In general, in searching and matching between divisions, the unit of code for matching at one time is small and does not take time, but the number of searching and matching is increased.

However, in the comparison between codes having the above-described hierarchical division, in general, the number of codes increases as the upper division decreases and the number of codes increases as the division on the lower side, but since the search range is narrowly narrowed, the codes are searched regardless. Less contrast is needed.

The identification method of the present invention receives the identification signal transmitted from the apparatus to be detected and checks whether the identification signal is registered in advance by matching the specific identification code indicated by the identification signal with a registration identification code registered in advance. As the identification method, each of the specific identification code and the registration identification code is composed of a plurality of divisions each having a predetermined number of bits, and in the matching, the specific identification code and the registration identification code for the same division. In contrast, the registration identification code to be matched after the matching with the specific identification code in the classification is specified, and the classification to check the comparison between the classification and the specification of the registration identification code to be compared next is changed. Repeatedly until all the divisions are finished.

In addition, the identification method of the present invention generates a random number and transmits the random number signal to the apparatus to be detected as a random number signal, and then receives the identification signal encrypted by the apparatus to be detected using the transmitted random number signal, and then identifies the encrypted signal. After decrypting to read the identification signal before encryption, the classification is performed.

Each of the registration identification codes has at least an upper division and a lower division, and in the entire registration identification code stored in the storage means, a plurality of sets of the lower divisions having different codes are the same for any of the upper divisions having the same code. The divisions between the divisions are hierarchically arranged, and the division between the divisions includes a step of changing the divisions to be contrasted by the divisions of the lowermost and the first divisions from the top division.

The identification method further includes a step of forcibly terminating the matching when there is no matching code in the matching between the divisions.

Next, a case where the identification device and the identification method according to the present invention are applied to a keyless entry system for remotely opening and closing a door will be described in detail with reference to the drawings.

1 is a block diagram showing a schematic configuration of an identification device (keyless entry system) according to the present embodiment.

The keyless entry system is provided on the portable key device 1 and the driving object (for example, the door 2), and instructs the opening and closing of the door 2 and lock / lock release. It consists of (3). Usually, the key device 1 is assigned to each individual, and the lock device 3 is provided for each driving object.

The key device 1 includes a switch unit 4 for instructing the door to be opened and closed by a user's operation, a signal processing unit 5 for performing various signal processing, and a transmission / reception unit 6 for communicating with the lock device 3. ), An ID memory 7 which is assigned to the owner of the key device 1 or the like and stores an identification code (hereinafter referred to as a specific identification code IDS) unique to the key device 1, and each part of the key device 1. It has the battery 8 which supplies electric power to (5-7).

The switch section 4 is inserted in the middle of the power supply line of the battery 8, and is composed of an operation switch for instructing the opening and closing of the door and the unlocking / locking release, a power switch of the key device 1, and the like.

The signal processing unit 5 generates a response request signal by the operation of the switch unit 4, and encrypts a specific identification code IDS using a predetermined function and a random number, and is usually composed of, for example, a microcomputer. do.

The transmission / reception section 6 transmits the response request signal and a signal indicating a specific identification code IDS after encryption (hereinafter, a specific identification signal), and receives a random number signal used for encryption of the specific identification code IDS. It has a function of modulating and demodulating a signal to a predetermined carrier. There is no limitation on this modulation method. For example, a base band method, an ASK modulation method or an FSK modulation method is selected. The baseband method has the advantage that high-speed communication can be performed at low power consumption and the circuit configuration can be simplified compared with modulation methods such as ASK and FSK. Here, the predetermined carrier may be any of infrared rays, light, radio waves, and ultrasonic waves. In addition, the transmitting and receiving unit 6 may be divided into a transmitting unit and a receiving unit.

As the ID memory 7, when the signal processing section 5 is formed of a microcomputer, the internal memory can be used. In the case where the number of the key devices 1 is small and the specific identification code IDS is simple, the ID memory 7 is omitted, and the specific identification code IDS such as the encryption number is used as the key input in the switch unit 4. It may be an acceptable structure.

The facing lock device 3 includes a transceiver 9 for communicating with the key device 1, a drive device 10 for driving a lock of a door, and a lock / lock release, a processing control unit 11, Register ID memory 12, random number generation section 13 for generating random numbers and outputting them as random number signals, battery 14 for supplying power to the sections 9 to 13 of these lock devices, and controlling the power supply of the batteries. Power supply control section 15 for intermittently operating the respective sections 9 to 13, and a timer 16 for giving a time signal to the power supply control section 15.

The transmission / reception section 9 transmits a random number signal to the key device 1 and receives a specific identification signal, and has the same function as the transmission / reception section 6 on the key device side. It is comprised corresponding to a kind (infrared, light, radio wave, or ultrasonic wave). The transmission / reception section 9 may also be configured by dividing into a transmission section and a reception section.

The processing control unit 11 checks a specific identification code IDS with a previously registered identification code (hereinafter referred to as a registration identification code IDR) for identifying a specific person authorized to unlock / lock, and various signal processing accompanying the matching. In addition, the drive device 10 is controlled in accordance with the matching result, and is usually constituted by, for example, a microcomputer.

For example, as shown in FIG. 1, the processing control unit 11 decrypts the received specific identification signal based on the received identification code to obtain the specific identification code IDS before encryption, and the specific identification code IDS after decryption. Is matched with the registration identification code IDR from the registration ID memory 12, and has a matching unit 18 for controlling the drive unit 10 in accordance with the matching result.

The decryption unit 17 performs decryption using a function for decryption and a random number used for encryption, and therefore the random number from the random number generation unit 13 is connected to be inputable.

In the registration ID memory 12, a plurality of registration identification codes IDR are stored. As the memory 12, a built-in memory of a microcomputer can be used, and can be used as an external storage device or a portable recording medium.

As the random number generator 13, for example, a binary counter having a predetermined number of bits can be used. In this case, it becomes a pseudo random number in which generation of the same random number is repeated periodically.

As a random number generating unit for generating a random number without periodicity, although not particularly shown, there is, for example, a generation circuit of M series (Maximum Length Code) consisting of a shift register and an exclusive OR. This circuit arranges taps appropriately in the middle of a shift register of a predetermined number of bits, and connects an empty input of an adder inserted into a feedback loop of the shift register to the tap.

The power supply control unit 15 is usually disposed inside a microcomputer constituting the processing control unit 11. In general, the microcomputer has a normal operation mode and a low power consumption mode in a standby state where only a part of the power is operated. However, the power supply control unit 15 can be a microcomputer portion that operates even in a low power consumption mode. On the other hand, the processing control unit 11 can be a microcomputer portion in which the power supply is stopped in the low power consumption mode and operates only in the normal operation mode.

Among these identification devices, the lock device 3 is controlled by the power supply control unit 15 to operate intermittently.

In the intermittent operation, when the operation of the key device 1 is arbitrary and the response request is not known, when power is constantly supplied to each part of the lock device 3, the power consumption is large and the battery 14 is consumed. Therefore, the operation (power supply) of the lock device 3 is intermittently performed at a predetermined cycle to achieve low power consumption.

The power supply control unit 15 may control the power supply so as to start or stop all the sections 9 to 13 in the lock device 3 at the same time as in the normal intermittent operation. You are changing the timing. That is, when the power supply control unit 15 starts the power supply from the stop state in the intermittent operation, the start timing of the power supply to the processing control unit 11, the registration ID memory 12, and the random number generator 13 The control is performed to start supplying power to the transceiver 9 (strictly, only the receiver) before the predetermined time. Details of timing control of this intermittent operation will be described later.

Next, the identification method of this invention is demonstrated according to the flowchart of FIG. 2, referring the timing chart of FIG. 3 as an example when it applies to the above-mentioned identification apparatus.

Now, it is assumed that a specific identification code IDS is registered in the ID memory 7 in the key device 1, and a registration identification code IDR is registered in advance in the registration ID memory 12 in the lock device 3. These identification codes IDS, the number of bits of the IDR, and the number of bits of the random number generated from the random number generator 13 are not limited, but for convenience of explanation, all of them are referred to as 24-bit codes.

As described above, the lock device 3 is intermittently operated, and the timing of the start of the transition from the stopped state to the operating state is set earlier by DELTA T in the transmission / reception unit 9 than at other parts. That is, according to the time signal from the timing 16, the power supply control unit 15 controls the portions other than the transmission / reception unit 9 at the operation time T1 and the stop time T2 as shown in Fig. 3E. As shown in Fig. 3 (f), the transmission / reception unit 9 is controlled intermittently by controlling at the operation time T1 + ΔT and the stop time T2-ΔT.

When this intermittent operation is in full swing, when the user operates the switch unit 4 of the key device 1 and presses the switch, power from the battery 8 is supplied to the units 5 to 6, and the user switches the unit. When operating (4) to instruct either the "open" or the "close" of the door 2, this operation signal is output to the signal processing part 5 (step S1).

As a result, the signal processing unit 5 generates a response request signal including a command of "salt" or "close" of the door, and is, for example, 100 msec from the key device 1 as shown in FIG. Subsequently, the response request signal is continuously transmitted to the lock device 3 (step S2). The transmission period of the response request signal is set equal to or longer than the period T1 + T2 of the intermittent operation so that the device 3 can receive the response request signal so that the switch of the key device 1 is turned on at any timing. It is supposed to be.

When the lock device 3 receives this response request signal (step S3, see FIG. 3 (d)), the power supply control unit 15 determines that the response request signal is being transmitted, and powers the transceiver 9 first. To supply. When the transmission / reception section 9 in which the time ΔT has elapsed is in a state capable of being stably received, the power supply control section 15 starts supplying power to the processing control section 11.

Then, the power supply to the other portions 10 to 13 is started at the same time as the power supply to the processing control unit 11 or at an appropriate timing thereafter. This timing is arbitrary as long as there is no problem in the subsequent processing. Preferably, the power supply is started in the order of processing, that is, the random number generator 13, the registration ID memory 12, and the driving device 10.

When power is supplied to the processing controller 11, the processing controller 11 detects that a response request signal is being transmitted, and controls the random number generator 13 to generate a 24-bit random number X (step S4). . In the random number generation, when the random number generator 13 is composed of a 24-bit binary counter, the binary counter is counted with a predetermined clock signal irrelevant to communication between the two transceivers 6 and 9. When the response request signal from the key device 1 is received, the binary counter is stopped and the numerical value is read.

The processing control unit 11 outputs the generated random number X to the transmission / reception unit 9 for 30 msec, for example, as shown in Fig. 3C, and transmits it to the key device 1 as a random number signal (step S5). ).

When the transmitting / receiving unit 6 of the key device 1 receives the random number signal (see step S6, FIG. 3 (b)), the transmitting / receiving unit 6 extracts the random number X from the received random number signal, and then the signal processing unit ( 5) to send.

In the next step S7, the signal processing section 5 reads out a specific identification code IDS stored in the ID memory 7 in advance, and reads a predetermined or arbitrarily selectable function f from another memory or the like.

Although there is no limitation in this function f, for example, when two corresponding bits are the same "1" or "0", both of those bits shall be "1", and when they are different, both bits shall be " The so-called exclusive OR logic function can be used.

In a subsequent step S8, the read specific identification code IDS is encrypted (logically operated) using a random number X and a function f to scramble. By this encryption, the encryption code f (X, IDS) of the specific identification code IDS can be generated as in the example shown in the following table.

IDS 010101010101010101010101X 110111011101110111011101 f (X, IDS) 011101110111011101110111

The generated encryption code f (X, IDS) is transmitted to the lock device 3 as an encryption ID signal within a time for which 30 msec is determined, for example, as shown in Fig. 3A (step S9).

When the lock apparatus 3 receives this encrypted ID signal (step S10, see FIG. 3 (d)), the encrypted ID signal is decrypted, and the encryption code f (X, IDS) thus obtained is decrypted in the processing control unit 11. In step S11, the original specific identification code IDS is derived by decryption, that is, logical operation or the like, is sent to the unit 17.

Specifically, the decryption unit 17 reads out the decryption function f- ¹ corresponding to the function f from a predetermined memory in advance, and inputs the encryption code by using the function f- ¹ and the random number X transmitted in advance. Logical operation f (X, IDS) obtains the original specific identification code IDS. As shown in [Table 1], when the exclusive logical sum function f is used for encryption, the exclusive logical sum operation returns to its original state when the exclusive logical sum operation is performed twice, so that the logical operation function f- ¹ for decryption is Here, the result is the same as the function f used for encryption.

In step S12, the matching unit 18 in the processing control unit 11 compares the decrypted specific identification code IDS with a plurality of registration identification codes IDR previously stored in the registration ID memory 12, and has been transmitted. It is checked whether the specific identification code IDS is registered.

The present invention is characterized by an identification code matching method, and then, an efficient matching method and code recording therefor will be described.

Fig. 4 is an explanatory diagram showing the format configuration of a specific identification code IDS and a registration identification code IDR (hereinafter, simply " identification code " in combination). 5 is a diagram in which identification codes are systematically side-by-side in order to facilitate retrieval of identification codes. In this format description, the identification code is 16 bits for convenience. Also in the identification code of another bit number called 24 bits as described above, the basic format structure and matching method are the same as described below.

The identification code illustrated in FIG. 4 includes three divisions, namely, a main group ID code (MID) consisting of the upper four bits, a subgroup ID code (SID) consisting of the following four bits, and an individual ID code consisting of the lower eight bits. It consists of (IID). For example, in the keyless entry system of the entrance door of the collective house, the MID corresponds to a code indicating the house wing, the SID the floor, and the IID the respective entrance door.

In addition, the systematic arrangement diagram illustrated in FIG. 5 is a so-called hierarchical arrangement structure, and the lower codes are the same number in the same order between different codes (for example, SID0 and SID1) in the same layer on the upper side. They are arranged repeatedly (for example, the same individual codes IID0 to IID255 are repeatedly arranged immediately below the SID0 and SID1, respectively).

In the registration ID memory 12, systematic code recording as shown in Fig. 5 is performed so that the recorded code can be searched in a system. For example, if the numerical value of the 16-bit registration identification code IDR is recorded from the first address in the memory in ascending order or in descending order, a systematic arrangement as shown in Fig. 5 is naturally realized. The MIDs may be in the order of the largest number, and the SIDs may be the order of the smallest.

FIG. 6 is a flowchart showing in detail the procedure of ID code collation (step S12) in FIG. 2 as an example in which the registration identification code IDR is searched from top to bottom in FIG. 5 to collate with a specific identification code IDS.

First, in step S120, the MID0s of both identification codes IDR and IDS are collated to determine whether they match in step S121. If they do not match, the search target is shifted by one in step S122, and MIDm (m = 0 to 15). ) To match the contrast.

When the MID match is determined in step S121, the matching (step S123), the match determination (step S124), and the increment of s (step S125) are also matched for the SIDs (s = 0 to 15). If there are SIDs, the process is repeated until it is determined.

And similarly, matching and matching determination are repeated about IIDi (i = 0-225) (step S126-step S128).

If all codes are searched and matched in each layer (division), and if there is no match, processing ends at that point, and operation control itself such as lock / lock release is forcibly terminated, thereby intermittent operation before the response request. Return to

By such an ID code matching method, an efficient matching is achieved without wasted search.

For example, if a 4-bit microcomputer is used for the processing control unit 11 and the length of the identification code is specified as 16 bits by the system format, the identification time of the 4-bit code is set to 10 µsec. Matching the code in 16-bit units takes about 40μsec to 2.6sec.

On the other hand, if the matching is performed for each layer (division) in the identification code by the above-described method, it ends in a time of about 40 µsec to 5.5 msec, and the time required for the verification is greatly reduced.

4 and 5 illustrate only the classification and hierarchical structure of the identification codes, and are limited to the number of divisions (three in the figure), the number of bits of each division, the number of codes that can be acquired in each division, and the like. There is no. In addition, there is no limitation to the arrangement of the hierarchical structure of FIG. 5, and there is no limitation, for example, whether the upper division MID is in the middle or the right.

In addition, there is no limitation on the order of matching, and in general, it is preferable to sequentially perform the order from the higher side having a smaller number of bits and types of codes. For example, if the number of bits of the individual ID code IID is extremely small and the matching is easy, first of all, the individual ID code. You may check from the IDD.

As a result of this check, when there is a registration identification code IDR that matches the decrypted specific identification code IDR, the processing control unit 11 responds to the command signal of "open" or "closed" of the door included in the response request signal sent earlier. Therefore, the drive signal of the door is output from the matching unit 18 to the door 2, for example. In this way, the door is opened and closed.

Simultaneously with the opening / closing control of the door, when the drive signal of the lock indicating the lock release when the door is opened and the lock when the door is closed is output from the matching unit 18 to the drive device 10, the drive signal is output. The door 10 is unlocked or locked by the received drive device 10 (step S13).

In this example, the lock device 3 generates a random number X each time the door is opened and closed, and encrypts the specific identification code IDS in the key device 1 using the received random number signal. Since (X, IDS) is transmitted to the lock device 3, the signal transmitted in both directions is always a different signal, so that even if a signal is received by a third party during transmission, there is no risk of the specific identification code IDS being stolen.

In addition, in this example, in the start timing control of the power supply during the intermittent operation by the power supply control unit 15, the power supply to the transceiver 9 is started in advance of the other portions 10 to 13, and quickly. The reception state is prepared. Therefore, as in the prior art, if all parts are simultaneously powered on, the processing control unit 11 or the like is capable of processing, so that the rise time of the transmitting / receiving unit 9 takes no time and wastes unnecessary time. . As a result, the normal operation time for performing a process control for a series of lock / lock release is shortened by that much, and power saving can be aimed at. Moreover, the response is also good by that much.

In this example, since the systematic identification code IDR is registered and can efficiently collate with the specific identification code IDS, not only is it possible to save more power, but also the operation of actually unlocking / locking after giving an instruction. This time is short, the response is high, the usability is good.

The number of trials does not change the probability of coincidence of the signal by chance. The probability that this code matches is always about 16.7 million when a signal is constructed from a 24-bit code, for example, and extremely high security can be easily realized.

Next, modified examples 1 to 3 relating to random number generation for the purpose of further improving the security and to prevent the occurrence of duplication of the random number X will be described next.

Incidentally, in the following descriptions of the modifications 1 to 3, the configuration of the processing control unit in the lock apparatus and the new random number memory are different from those in the previous case, and the other parts are the same. This same part attaches | subjects the same code | symbol, and the description is abbreviate | omitted.

Specifically, the configuration and operation of the transmission / reception unit 9, the drive unit 10, the registration ID memory 12, the random number generation unit 13, the battery 14, the power supply control unit 15, and the timer 16 , Does not change with the previous description. In addition, the structure and operation | movement of the decryption part 17 and the matching part 18 in a process control part are the same as that of the above description.

(Modification 1)

In the keyless entry system of this example shown in FIG. 7, the lock device 20 has a random number changing section 22 in the processing control section 21 and a random number memory 23 outside the processing control section 21. As shown in FIG.

The random number changing unit 22 also has a comparison means 24 and an output control means 25.

In the random number memory 23, the predetermined number is stored in the random number X which has been output from the processing control section 21 to the transmission / reception section 9 in the past and used for encrypting the specific identification code IDS. In the random number memory 23, the start timing of the intermittent power supply by the power supply controller 15 is controlled at the same timing as the random number generator 13.

The comparison means 23 includes the latest random number Xk from the random number generator 13 and the first used random number (hereinafter, referred to as the random number) Xk-1, Xk-2,... Read out from the random number memory 23. The random number generator 13 and the random number memory 23 are connected to the input of the comparison means 23.

The output control means 25 is arranged in the middle of the output path from the random number generator 13 to the transceiver 9, and according to the comparison result of the comparison means 24, the output of the random number Xk is prohibited or the random number generator ( 13 is instructed to generate two random numbers to control output of the random number Xk.

FIG. 8 is a flowchart showing the contents of random number generation (S4 in FIG. 2) in the first modification.

In the first step S400, random number Xk is generated by the random number generation unit 13 and input to the process control unit 21 in the same manner as described above.

In step S401, the random number Xk generated by the comparing means 24 and the previous random numbers Xk-1, Xk-2,... In the random number memory 23. Are compared in turn.

As a result of this comparison, the latest random number Xk is the previous random number Xk1, Xk-2,... If it matches with either of them, after the output control means 25 having received this result prohibits the output of the random number Xk (step S404), two random numbers Xk are generated so that duplicate random numbers do not always occur for a predetermined number of times ( Step S400), random number comparison (step S401), determination (step S402) and output prohibition of random number Xk (step S404) are repeated.

On the other hand, when it does not coincide with all previous random numbers in the random number memory 23 ("No" in step S402), after the output control means 25 which has received this result allows the output of the random number Xk (step S403), The random number generation processing S4 is terminated.

In this modified example 1, it is avoided that the same random number is used for the encryption of the specific identification code IDS after a predetermined number of times, and there is an advantage that a highly secure system can be realized.

In this example, the random number generation may be repeated continuously. For example, the next random number may be configured to be stoked after checking the redundancy with the previous random number.

(Modification 2)

In the keyless entry system of this example shown in Fig. 9, the lock device 30 has a random number changing section 32 in the processing control section 31.

The random number changing unit 32 differs from the random number changing unit 22 in the modification 1 in place of the output control unit 25 in FIG. 7. It is excreted. As this calculation process, the calculation process which can generate | generate a different random number necessarily may be sufficient, for example, the calculation process which inverts "0" and "1" of all the bits which comprise the random number Xk.

10 is a flowchart showing the contents of random number generation (S4 in FIG. 2) in the second modification.

Steps S410 to S412 are similar to steps S400 to S402 in the first modified example, generation of random number Xk by the random number generating unit 13 (step S410), and latest random number Xk by the comparing means 24. And the preceding random numbers Xk-1, Xk-2,... The comparison with step (step S411) and the determination (step S412) are performed.

As a result of this determination, the latest random number Xk is the previous random number Xk-1, Xk-2,... If it matches one of the above, if the arithmetic processing means 33 which has received this result performs a predetermined arithmetic processing on the random number Xk, changes it to a different random number, and outputs the changed random number as Xk (step S413), The random number generation processing S4 is completed.

Also in this modification 2, it is avoided that the same random number is used for the encryption of the specific identification code IDS after a predetermined number of times, thereby achieving a high security system.

In this example, even when the random numbers are duplicated, different random numbers are necessarily obtained in one calculation process, which has the advantage that the timing design for the random number processing of the system is easy.

(Modification 3)

In the keyless entry system of this example shown in FIG. 11, the lock device 40 is a counter that should be referred to as a second random number generating unit within the processing control unit 41 and a second random number generating unit outside the processing control unit 41. Has 43.

The random number changing section 42 of the present example differs from the above-described modifications 1 and 2 in that the random number changing method is different. For example, the random number changing section 42 combines the code string from the counter 43 in series with the code string of the random number Xk to synthesize the random number. Change Xk. Synthesis of this random number only needs to be able to generate a different random number, for example, adds one bit alternately with "0" and "1" to 23-bit random number Xk, or incrementally counters a predetermined number of bits. The resulting random number Xk can be changed to a different random number, for example, by cement or decrement.

FIG. 12 is a flowchart showing the contents of random number generation (S4 in FIG. 2) in the third modification.

Generation of the random number Xk in step S420 is performed by the random number generation unit 13 similarly to the modifications 1 and 2 described above, and the generated random number Xk is sent to one input of the random number changing unit 42.

On the other hand, the count value Ck in the counter 43 is read out (step S421) and sent to the other input of the random number changing section 42. Immediately after outputting the count value Ck, the counter 43 counts up or stops only the predetermined value and stops, and prepares to read the next count value Ck (step S422).

In the next step S423, in the random number changing unit 42, when the count value Ck is connected to the random number Xk, and the value after the synthesis is output as a new random number Xk, the random number generation process S4 ends.

Also in this modification 3, it is almost avoided that the same random number is used for the encryption of the specific identification code IDS after a predetermined number of times, and a high security system can be realized.

The present example has an advantage that the duplication prevention probability can be made extremely low, and the configuration of the random number changing section 42 is simple.

According to the identification device and the identification method of the present invention, a systematic (layered) identification code is registered in the storage unit to facilitate retrieval, and code retrieval and contrast in irrelevant classifications are greatly reduced. It is possible to collate each division, and as a result, the entire collation time is shortened.

In particular, in the identification device of the present invention, the time for which a control operation such as lock / lock release is actually performed after giving an instruction is short, and the response is high, and the usability is good.

In addition, since the matching time of the identification code is short, the power consumption is low, which is optimal for a code identification device using a finite battery as a power source.

The above description is for the case where the present invention is applied to a keyless entry system using two-way communication, but the gist of the present invention lies in the identification signal identification. If encryption or the like is not executed, a configuration in which one-way communication from the device to be detected to the detection device is used is also possible.

As described above, the present invention has been described with reference to the preferred embodiments, but the present invention is not limited to these embodiments, and those skilled in the art can make various changes and modifications without departing from the spirit and scope of the present invention. It can be seen that modifications can be made.

Claims (7)

A detected device for transmitting a first identification signal representing a specific identification code composed of a plurality of divisions each determined by a predetermined number of bits, and receiving the first identification signal from the detected device, wherein the detected device And a detection device for identifying whether or not the registration has been registered in advance, wherein the detection device stores in advance a second identification signal indicating a registration identification code consisting of a plurality of divisions each of which has been determined with a predetermined number of bits. And a matching unit for matching the received first identification signal with a second identification signal read out from the storage unit, and controlling the matching unit to control the specific identification code and the registration identification code for the same division. The registration identification code to be matched after matching with a specific identification code in the division, and performed between the divisions. And a processing control unit for repeating the control of the pair and the specific section of the registration identification code to be checked next, until the matching between all the divisions is finished while changing the division to be collated. 2. The detection apparatus according to claim 1, wherein the detection apparatus further includes a random number generator that generates a random number transmitted as the random number signal to the apparatus to be detected, and the apparatus to be detected uses the received random number signal to generate the random number. And a signal processing unit for encrypting a first identification signal and transmitting a result to the detection device, wherein the processing control unit reads the first identification signal before encryption by decrypting the first identification signal after encryption. And discriminating between the divisions. The plurality of subdivisions of claim 1, wherein the registration identification code has at least an upper division and a lower division, and in the entire registration identification code stored in the storage means, a plurality of the lower divisions having different codes for any of the upper divisions. The divisions are assigned to each other, and the divisions are stratified, and the processing control unit controls the collation unit to change the collation divisions starting from the highest division and sequentially into lower divisions. Identification device. Receive a specific identification signal composed of a plurality of divisions, each of which has been transmitted from the apparatus to be detected and whose number of bits is determined to be a predetermined number, and compares the specific identification code with a registration identification code that is registered in the same division in advance. After matching the specific identification code, the registration identification code to be contrasted is specified, and the comparison between all divisions is changed while changing the division to check the comparison between the division and the specific section of the registration identification code to be compared next. And repetitively performing steps until ending, thereby identifying whether an identification signal has been registered in advance. 5. The method according to claim 4, wherein a random number is generated and transmitted to the apparatus to be detected as a random number signal, and then the identification signal encrypted by the apparatus to be detected is encrypted using the transmitted random number signal, and the identification signal after the encryption is decrypted. And reading the identification signal before encryption, and then checking the classification. 5. The method according to claim 4, wherein each registration identification code has at least an upper division and a lower division, and in the stored registration identification code, a plurality of sets of the lower divisions having different codes are assigned to any of the upper divisions. And the divisions are stratified, and the identification method further comprises a step of changing the divisions to be contrasted with the divisions in the sequential order, starting with the division at the top. The identification method according to claim 4, further comprising the step of forcibly terminating the matching when there is no matching code in the matching between the divisions.