JPH06318185A - How to identify using a disposable password - Google Patents

Abstract

PURPOSE:To discriminate whether a certain device prepared by disclosed specifications is valid or copied by a disclosed procedure by using disposable 'a pair of passwords'. CONSTITUTION:When an ID card 11 is inserted into a slot 15, the card 11 transmits 'the upper phrase of passwords' which is selected at random to a main computer 14. When a correct 'lower phrase of passwords' is returned, the card 11 judges whether the slot 15, a terminal 12, a communication line 13, and the main computer 14 connected to the card 11 at present are valid or not. When the card 11 receives the 'upper phrase of passwords' from the main computer 14, checks whether the received phrase is invalid or not and is a used phrase or not and then transmits the corresponding 'lower phrase of passwords' to the computer 14. When 'the upper phrase of the passwords' is invalid or can not be received with a fixed time, the card 11 judges the invalidity of the devices connected to the card 11 at present.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION The present invention is directed to whether a device (and the person who owns it, the legal entity, etc.) is legitimate.
Alternatively, the present invention relates to a method of identifying whether or not the device on the side that determines whether or not the device is valid.

[0002]

2. Description of the Related Art At present, as a mechanism for judging whether a certain device is legitimate, for example, in the case of a card, in order to avoid forgery of the card, electric / magnetic information is written on the card,
There is a way to read this and identify whether it is a valid card. For example, a bank cash card or the like corresponds to this.

[0003]

In the case of the above card example, a method of creating a card (writing information to the card /
How to read) is often not published. This is to prevent counterfeiting of the card.

Further, since the card is a mere data recording medium, it is impossible to judge whether the reading device of the card is legitimate or fraudulent and prevent the fraudulent reading device from reading the data. .

It is an object of the present invention to provide a method for identifying whether a given device created according to the published specifications is legitimate or has been copied according to the published procedure.

Another object of the present invention is, for example, a device for certifying that an object is legitimate by another party, and when the party A is the discriminating apparatus, the discriminating apparatus only discriminates whether the party B is legal. Instead, the second party on the discriminating side is to provide a method for discriminating whether or not the discriminating device is valid.

[0007]

[Means for Solving the Problems] In order to have the functions mentioned in the preceding paragraph, as a method of determining whether or not the device A and B are legal each other, the device A and B is a microcomputer such as a storage device or an arithmetic unit ( Or equivalent) function and bidirectional data communication function. Since the specifications of these functions use the published ones, anyone can create equivalent ones. Any device including Kotsu can send any data to Koto,
It is not possible to directly read the data that Kotsu remembers.

A sufficient number of "pairs of secret words" having exactly the same contents are stored in the storage device of the device Kou. When Party A determines whether or not a device is a legitimate party B, it sends a randomly selected "phrase above the secret" through the data communication function. At this time, if the correct “phrase under the secret word” is sent from the device, the device is determined to be a legitimate second party.

Even when the second party judges whether a certain device is a valid first party, the same is the same except that the second party's position is changed. Thus, for example, if the second party is a device for certifying that a certain object is legitimate, and the first party is the discriminating device, not only the second party discriminating device not only discriminates the second party, but also One of them can judge whether the discriminating device is legitimate and, if it is improper, warn the user.

Both Ko and Oto remember whether or not the "phrase above the secret word" has already been used, and never use the secret word that has been used once. As a result, even if another person can receive the content, for example, by using radio waves or infrared rays for data communication, the “password pair” cannot be copied and illegally used. If the "phrase above the secret phrase" that has already been used is sent, it is judged that the other party may be an illegal device, or there may be an illegal device among the devices that sent the "phrase above the secret word" until now. To do.

Further, since the "password pair" is made disposable, the number of times that the device A and B can confirm each other's validity is finite. For this reason, when the unused "pair of secrets" falls below a certain number, the user is notified to that effect and the device is updated, or if the contents of the data communication cannot be received by another person, After confirming the legitimacy of the other party, a function to automatically create a new "password pair" will be added if necessary.

[0012]

According to the present invention, it is possible to make a mechanism for confirming the legitimacy of each other in a device having an open structure, and to eliminate a forged copy.

Since the mutual validity can be confirmed,
Not only can the discriminating side device discriminate the legitimacy of the discriminating side device, but also the discriminating side device can discriminate the legitimacy of the discriminating side device.

[0014]

DESCRIPTION OF THE PREFERRED EMBODIMENTS As an embodiment of the present invention, an example of an ID card to which the function of the present invention is added and a computer system for identifying a user by the ID card is shown. FIG. 1 is a structural diagram of the embodiment. The embodiment comprises an ID card 11, a terminal 12, a communication line 13, and a main computer 14. The terminal 12 has a slot 1 for data communication with the ID card 11.
5 is attached. The ID card 11 is connected to the main computer 1 through the slot 15-terminal 12-communication line 13.
4 and data communication. The initialization dedicated slot 16 directly connected to the main computer 14 is I
For D card initialization. The communication line 13 is open to the outside, and the communication information in the line can be read by any device. Although only one terminal is shown for convenience, a plurality of terminals may actually be connected to the communication line 13. The main computer 14 is a communication line 1
3 can be used from the terminal 12, but for security management, the main computer 14 refuses to use from the terminal 12 unless a valid ID card 11 is inserted in the slot 15.

All the devices from the ID card 11 to the initialization dedicated slot 16 have public specifications.

FIG. 2 is an external view and structural diagram of the ID card 11. The LSI 21 contains a storage device, a calculation device, and an interface circuit for data communication.
The storage device of the LSI 21 stores a plurality of “password pairs”, information on whether or not they have been used, and a program to be executed by the arithmetic unit. The battery 22 is a power supply for driving the LSI 21. The transmission / reception device 23 is a device for performing data communication with the slot 15 / initialization dedicated slot 16. Infrared communication is assumed here, but other various communication methods such as radio waves, ultrasonic waves, and bus connection can be considered. The lamp 24 and the speaker 25 are for giving a warning to the user when the card is inserted into an illegal slot. All these mechanisms are sealed with plastic etc. and cannot be disassembled.

FIGS. 3 and 4 are flowcharts of programs executed by the ID card 11 when the ID card 11 is inserted into the slot 15. These two programs are executed in parallel. First, when the card 11 is inserted into the slot 15, the ID card 11 randomly selects "phrase above the secret word" from the main computer 1
4 (step 32). When the correct "phrase under secret" is returned, the ID card 11 judges that the currently connected slot 15-terminal 12-communication line 13-main computer 14 is valid (step 36). If the "phrase under the secret" is not received within a certain period of time, or if it is illegal even if received, the ID card 11 judges that the currently connected device is illegal and prompts the user. To issue a warning (step 37, step 38). Further, when the ID card 11 receives the "phrase under the secret" from the main computer 14 (step 42), it is checked whether it is an illegal one or the one already used, and then the corresponding "phrase under the secret" is checked. Is transmitted to the computer 14.
If the "phrase above secret" is incorrect, if it has been used before, or if "phrase above secret" is not received within a certain period of time, the ID card 11 indicates that the currently connected device is invalid. It is judged to be a thing and a warning is issued to the user (step 44, step 47, step 48). The same program is also executed by the main computer 14 when it is detected that the card 11 is inserted into the slot 15.
Also checks whether the ID card 11 is valid. If it is determined that there is something wrong, neither the ID card 11 nor the main computer 14 will stop data communication with the other party unless the card 11 is once removed from the slot 15.

The card is initialized as follows.
FIG. 5 shows a program executed by the main computer 14 when the ID card 11 is initialized. A "password pair" is automatically generated by a random number (step 52) and transferred to the ID card 11 inserted in the initialization dedicated slot 16 (step 54). If the card is initialized through the communication line 13, the newly created "password pair" may be received and analyzed by another person.
The initialization of the ID card is limited to the initialization dedicated slot 16 directly connected to the main computer 14.

FIG. 6 shows a program when the ID card 11 is initialized. The ID card 11 cannot determine whether the inserted slot is the initialization slot 16. When the ID card 11 receives the initialization command in the data communication (step 62), the ID card 11 unconditionally stores the “secret word pair” (step 5).
4). This means that anyone can initialize the ID card 11, but the already initialized ID card 11
Therefore, you cannot make a duplicate of it.

Now, consider a method of forging the ID card 11. The first conceivable method is to receive / analyze the data in the communication line 13. However, in the present invention, since the “password pair” that has been used once is not used, the card cannot be forged only by the past communication contents.

Another method is a method of reading a "password pair" from the ID card 11. If you send the phrase above the secret word to the card, the phrase below the secret word stored in the card will be sent, so if you repeat this you can read all the "pairs of secret words" of the card, This method is extremely inefficient because even on the card side, the other party is checked with a "secret word pair" and communication is stopped if there is any fraud.

Another method is to read a "secret word pair" from the main computer 14.
However, the main computer usually has sufficient data protection and cannot be read out illegally.

[0023]

According to the present invention, it is possible to form a mechanism for confirming the validity of each other in a device whose structure is open to the public,
And it is possible to eliminate forged duplicates.

Since the mutual validity can be confirmed,
Not only the main computer can determine the legitimacy of the ID card, but also the legitimacy of the system to which the ID card is connected after the slot can be discriminated.

[Brief description of drawings]

FIG. 1 is an overall system configuration diagram showing an embodiment of the present invention.

FIG. 2 is a configuration diagram of an ID card showing an embodiment of the present invention.

FIG. 3 is a flowchart showing an ID card and a program executed by a main computer.

FIG. 4 is a flowchart showing an ID card and a program executed by a main computer.

FIG. 5 is a flowchart showing a program of a main computer for initializing an ID card.

FIG. 6 is a flowchart showing a program of an ID card when receiving an initialization command.

[Explanation of symbols]

11 ... ID card, 12 ... Terminal, 13 ... Communication line, 14
... Main computer, 15 ... Slot, 16 ... Initialization dedicated slot, 21 ... LSI, 22 ... Battery, 23 ... Infrared transmitter / receiver, 24 ... Lamp, 25 ... Speaker

Claims (7)

[Claims] 1. A "password pair" is composed of two random data, and each data is "phrase above the password" and "phrase below the password". If you want to store multiple “pairs of secrets” (about 1 million to 100 millions) and decide whether or not it is a second party for a device, specify a randomly selected “phrase above secrets” and respond to it. A method to identify only the device that answers the correct "phrase under the secret" using a disposable secret that is recognized as a valid (non-copy) second party. [Claim 2] Both Ko and Oto remember that each time they use a "password pair", and Ko does not use the "phrase above the password" that has already been used. If "phrase above secret word" is specified, it is possible that the other party is an illegal device that is not instep, or among the devices that specified "phrase above secret word", there was an illegal device disguised as instep. The method for identifying with a disposable secret word according to claim 1, wherein [Claim 3] Each of the "password pairs" is completely independent, and once written, the "password pair" has a structure that cannot be directly read from the outside. Excluding the actual data for
Is disclosed, and even if all "pairs of secret passwords" used so far are known, it is impossible to forge the device Kou Otsu. how to. [Claim 4] By having the same mechanics as the second party and the second party having the same mechanism as the second party, it is possible to judge whether the second party is legal and at the same time the second party can judge whether the second party is legal. A method of identifying a disposable password according to claim 1. 5. A device for certifying that an object is legitimate by another party, and if the party A is the discriminating device, the discriminating device is judged to be fraudulent and the user is warned. A method for identifying using the disposable password according to Item 1. 6. The method for identifying with a disposable secret word according to claim 1, wherein when the number of unused “secret word pairs” is less than a certain number, a warning is given to the user. 7. The disposable secret word according to claim 1, wherein a new secret word pair is automatically created when the number of unused secret word pairs falls below a certain number. How to identify using.