GB2150330A

GB2150330A - Validating ID code for transaction processing

Info

Publication number: GB2150330A
Application number: GB08500888A
Authority: GB
Inventors: Akira Matsuoka; Terukazu Tsukagoshi
Original assignee: Omron Tateisi Electronics Co
Current assignee: Omron Corp
Priority date: 1980-12-06
Filing date: 1985-01-14
Publication date: 1985-06-26
Also published as: DE3148396A1; GB2150330B; DE3148396C2; GB8500888D0; GB2091461A; GB2091461B

Abstract

In transaction processing apparatus in which an identification code keyed in by a customer is validated against card data, after a preset number of unsuccessful key-in attempts, any further attempts are ignored for a preset period. There is an upper limit on the total number of attempts, after which the card is declared valid. <IMAGE>

Description

1 GB 2 150 330 A 1

SPECIFICATION

Identification code determining apparatus for use in transaction processing apparatus Background of the invention Field of the invention

The present invention relates to an identification code determining apparatus for use in a transaction processing apparatus. More particularly, the present invention relates to an identification code determining apparatus which provides an improved manner of determining validity of an identification code entered by a customer in a transaction processing apparatus for making a transaction processing by using a record medium storing customer identifying information.

Description of the prior art

Generally, a transaction processing apparatus has been proposed to make each kind of a transaction processing by using a record medium, such as a magnetic card, in which identifying information inherent in a customer is recorded. As such transac- tion processing apparatuses, for example, an automatic cash dispenser, an electronic cash register capable of settling accounts by a credit card, POS system for use in a gas station which can supply a gas by using a magnetic card, and the like are known. In case that a transaction processing is made in such transaction processing apparatuses, presentation of magnetic card at the time of transaction processing and an entry of identification code which is known by only a customer owning a magnetic card must be made, in order to make sure a transaction processing and in order to enable only a particular customer owning a magnetic card to make a transaction.

By the way, in a conventional transaction proces- sing apparatus, in case that the entered identification 105 code is erroneous, the entry of an identification code is permitted a predetermined number of times, for example three times and after erroneous entry of identification code is repeated the predetermined number of times, the magnetic card is taken into the 110 apparatus or returned to the customer without any processing, and thereafter further entry of identification code is prohibited.

However, a transaction processing apparatus of type of taking a magnetic card into the apparatus when the number of erroneous entries of identification code reaches a predetermined number has a drawbackthat since a clerk in charge determines validity of a magnetic card and returns the same to a user of the magnetic card if the user is a owner of the magnetic card, the processing by a clerk in charge is complicated and thus the customer must be kept waiting for a longer time. Further, in another type of a transaction processing apparatus where a magne- tic card is returned to a customer when erroneous entries of identification code are repeated a predetermined number of times, there was a problem in that since a magnetic card is returned to a user even if the card is a stolen card, a person unfairly using a stolen card tries to repeat entry of identification code manytimes so as to find out a correct identification code and it results in a fair use of a magnetic card by using a correct identification code.

Summary of the invention

Briefly described, the present invention is adapted to permit erroneous entries of identification code a relatively small predetermined number of times and return a record medium if a correct identification code is entered within the predetermined number of times. The entry of identification code by inserting the record medium into a transaction processing apparatus is not permitted unless a predetermined time period from the time point of the last erroneous entry passes. Since the predetermined time period is not known by a user, determination of identification code is not made even if the user enters correct identification code. Then, if and when a correct identification code is entered after the predeter- mined time period has passed, determination of identification code is made and a transaction processing is permitted.

In accordance with the present invention, if and when an identification code is erroneously entered, a customer can have sufficient time to confirm his correct identification code and thus, the post processing is easily and quickly made even if a predetermined number of erroneous entries occur. Therefore, it can be prevented to make a transaction processing by using a stolen card.

In a preferred embodiment of the present invention, determination of validity of identification code is permitted if the number of erroneous entries of identification code is within an effective number of times, and the time period of prohibiting the determination of validity of identification code is made longer as the number of erroneous entries increases after the number of erroneous entries exceeds the effective number, whereby unfair transaction processing by using the other's record medium can not be prevented.

In another preferred embodiment of the present invention, the number of entries of identification code is accumulated and if and when the number of entries exceeds a relatively large, permissible number of erroneous entries, it is registered that a corresponding record medium is invalid, whereby a further transaction processing can not be prohibited by using the record medium regarded as invalid.

Accordingly, a principal object of the present invention is to provide an identification code determining apparatus for use in a transaction processing apparatus, wherein a customer can have sufficient time to confirm his identification code upon erroneous entry of identification code and the post processing can be easily and quickly made even if a predetermined number of erroneous entries occur and further, on the occasion that record medium is stolen, it can play fortime until the loss of the record medium is reported, thereby to prevent unfair use of the record medium.

One aspect of the present invention is to permit a relatively quick transaction processing when a correct identification code is entered after more than a predetermined time of erroneous entries occur and 2 GB 2 150 330 A 2 is to make progressively longer in proportion to the number of erroneous entries a time period starting from a time point of erroneous entry in the previous transaction, during which further determination of identification code can not be made.

Another aspect of the present invention is to regard a record medium as invalid if and when the number of error entries exceeds a relatively large number and to register a customer code of the record medium as invalid thereby to prohibit a further transaction processing by using the record medium regarded as invalid.

The objects and other objects, features, aspects and advantages of the present invention will become more apparent from the following detailed descrip- tion of the present invention when taken in conjunction with the accompanying drawings.

Brief description of the drawings

Figure 1 is a block diagram of a transaction 85 processing apparatus of one embodiment of the present invention; Figure 2 is a schematic diagram of a customer operating portion 20 shown in Figure 1; Figure 3 is a diagram schematically showing storage regions of a random access memory 30 of Figure 3; Figure 4 is a flow chart explaining an operation of one embodiment; Figure 5 is a diagram schematically showing 95 storage regions of random access memory 30A used in another embodiment; Figure 6 is a flow chart explaining an operation of another embodiment; Figure 7 is a schematic diagram of a customer operating portion 20A used in a further embodi ment; Figure 8 is a diagram schematically showing the storage regions of random access memory 30B used in a further embodiment; and Figure 9 is a flow chart explaining an operation of the further embodiment.

Description of the preferred embodiments

Figure 1 is a block diagram of a POS system for use in a gas station in an example of a transaction processing apparatus of an embodiment of the present invention. In the construction, a transaction processing apparatus 10 used for a POS system for use in a gas station includes a central processing unit (CPU) 11 such as a microprocessor or a microcomputer. A customer operating portion 20 shown in Figure 2 as described subsequently is connected to the CPU 11. The customer operating portion 20 includes a card reader 21, a tenkey 22 for entering an identification code, a display 23 and a buzzer 24. To the CPU 11 are connected a printer 12, a cassette deck 13, a timepiece 14 and a keyboard 16. The printer 12 is used for printing and recording a transaction processing data of a gas supply and the like to issue a receipt thereof. The cassette deck 13 is used for collecting and recording the processed data in a magnetic tape, in case that the processing unit 11 is not coupled to a central processing unit in a central office in an on-line manner, that is, in case of an off-line mode. A timepiece circuit 14 shows current time. The keyboard 16 is used for entering information other than identification code. In addition, to the CPU 11 are connected a memory (read only memory; ROM) 15 f or storing a program as shown in Figure 4 described subsequently and a memory (random access memory; RAM) 30 for temporarily storing the processed data as subsequently explained in detail referring to Figure 3.

Figure 2 is a schematic diagram of said customer operating portion 20. The panel of the customer operating portion 20 is provided with a card inserting slot 25. Said card reader 21 is provided in the rear side of said card inserting slot 25. When a magnetic card is manually scanned, the card reader 21 reads the data magnetically recorded in the magnetic card. The card reader 21 may be of a type of automatically scanning a magnetic card. For example, a customer code inherent in the customer having a magnetic card, an issuance place code indicating the place where the magnetic card is issued and an effective date date and the like are magnetically recorded in the magnetic card. In addition, an identification code may be recorded in the magnetic card, as necessary.

If and when the identification code is evaluated by reading the customer code from such a magnetic card, a number of four figures is evaluated based on a well-known equation for evaluating an identification code. There are many method known, for example, a method for evaluating the identification code by operating and processing an adequate arithmetic expression and a customer code and for determining coincidence of the evaluated identification code with an entered identification code; a method for evaluating a customer code by operating and processing an adequate arithmetic expression and an identification code and for determining coincidence of the evaluated customer code with a customer code read out of a magnetic card; and a method for adequately operating and processing a customer code and the first arithmetic expression and adequately operating and processing an identification code and the second arithmetic expression and thereafterfor determining whether both are coincident or not; and the like. It is assumed that such arithmetic expressions for evaluating these identification codes are preset and stored in said ROM 15.

Further, the customer operating portion 20 is provided with an identification code entry tenkey 22 for entering an identification code, a clear key C and a display 23. The display 23 includes a figure number displaying portion for displaying the number of figures of the entered identification code and a determination result displaying portion 232 for displaying the determination result (the result of determining whether a transaction processing is possible or impossible). Further, the customer operating portion 20 is provided with several apertures 26. In the rear side of said apertures 26, a buzzer 24 or piezoelectric vibrator (not shown) is provided for generating sound each time an identification code is entered andiorfor warning that more than a predetermined number of erroneous entries continuously occur.

3 GB 2 150 330 A 3 Figure 3 is a drawing schematically showing storage regions of said RAM 30. In Figure 3, the RAM includes a buffer region 31 for temporary storing the data to be compared, a storage region 32 for storing a predetermined time period, a storage region 33 for storing a predetermined number of times and a directory table 34. The buffer region 31 includes a customer code storage area 311 for storing a customer code, a currenttime storage area 312 for storing current time and a times storage area 313 for storing the number of times of identification code entries, the number being incremented each time the identification code is entered. The predeter mined time period storage region 32 stores a time period that a further identification code entry is to be prohibited from the time point when the last error identification code is entered in case that a predeter mined number of error identification code entry times occur. This predetermined time period is not known by a customer and may be differently selected depending on users or apparatuses in which the identification code determination appar atus of the present invention is used. Preferably, the predetermined time period is selected to a time period, for example, two hours, so that when a customer enters his identification code and thereaf ter he notices his error, he can go home to confirm a correct identification code. The predetermined num ber of times storage region 33 stores the number of times, for example, two times, in which error identification code entries are permitted. The data stored in said predetermined time period storage region 32 and said predetermined number of times storage region 33, respectively, is adapted to be stored in ROM 15 in case that the data is to be fixedly 100 set. Alternatively, in such a situation, at the time of turning a power source on, the data stored in the ROM 15 may be read out and transferred. Further, such data to be stored in the region 32 and the region 33 may be entered at the time of starting a daily business.

Said directory table 34 includes a plurality of storage areas 341 - 34n for storing a plurality of addresses, each address storage area comprising a customer storage area 34a, a time point, or day, hour, minute storage area 34b and a storage area 34c for storing the number of erroneous entry times.

The last time point or day, clock and minute when an identification code is erroneously entered is written into the time point storage area 34b for each 115 customer code. An accumulated number of erroneous entry times of identification code during a certain time period is stored in the number of times storage area 34c for each customer code. The number of the addresses of the directory table 34 is determined to a predetermined number, for exam pie, a hundred addresses. Therefore, if and when customer's erroneous entries occur more than a predetermined times, the data corresponding to the customer code stored first and foremost is erased and subsequent data is sequentially shifted one by one address and stored.

Figure 4 is a flow chart explaining an operation of the embodiment. Referring to Figures 1 to 4, a concrete operation of the embodiment will be de- scribed in the following.

First, a situation where an identification code is properly entered will be described. Prior to the operation of the flow chart as shown in Figure 4, a customer inserts his magnetic card into a card inserting slot 25 and manually scans the magnetic card. At that time, a card reader 21 reads out the data such as a customer code recorded in the magnetic card and the read out data is provided to CPU 11. The CPU 11 causes the customer code to be stored in the storage area 311 and causes the customer code to be stored in the storage area 311 and causes the current time clocked in a timepiece circuit 14 to be stored in the storage area 312. The customer operates the tenkey 22 to enter his identification code. In response to this, the CPU 11 starts the operation of the flow chart as shown in Figure 4.

In the step 1, CPU 11 retrieves in an address sequential manner whether the customer code read out from the magnetic card exists in the customer code storage area 34a in each address of the directory table 34. If and when the customer has not erroneously entered his identification code yet, the program proceeds to the step 2 since the customer code of the customer is not stored in any customer code storage area in any address of the directory table 34. In the step 2, it is determined whether the identification code previously entered coincides with a predetermined identification code of the customer.

This determination is made by some kinds of determination method as described in the foregoing. Now, assuming that it is determined that the identification code is properly entered, the program proceeds to the step 3. In the step 3, it is determined whether the customer code stored in the storage area 311 is stored in the customer code storage area 34a in each address of the directory table 34. If not stored, in the step 4, a sequential operation is terminated by lighting a display lamp included in said determination result displaying portion 232, the lamp indicating that the operation is normal.

Incidentally, in the step 4, after indication of the correctness, a transaction processing is permitted and necessary transaction processing as not shown is made.

Next, an operation will be described where no erroneous entry of identification code was made at all in the past transaction as far as this particular identification code is concerned, and in the present transaction, a predetermined number of erroneous entries occur atthe firsttime. In this case, in the step 1, upon first entry of an identification code, it is determined that the same customer code as a customer code stored in the storage area 311 does not exist in the directory table 34. In the step 2, it is determined that the identification code is not coincident and thereafter the program proceeds to the step 5. In the step 5, it is determined that the same customer code as a customer code stored in the storage area 311 does not exist in the directory table 34 and the program proceeds to the step 6. In the step 6, the number of erroneous entry times, that is, one, is written into the storage area 313 and current time clocked by the timepiece 14 is written into the storage area 312. Subsequently, in the step 7, all of 4 GB 2 150 330 A 4 the data stored in the directory table 34 is shifted one by one address toward a larger address direction, that is, "old" direction shown in arrow. Subsequent ly, in the step 8, the data to be compared stored in the buffer region 31 is set and stored in the first address 341 where the newest data is to be stored.

Subsequently, the step 9, the lamp of the determina tion result displaying portion 232 indicating erroneous entry is lighted and the buzzer 24 is energized for the purpose of warning. Then, the customer again operates the tenkey 22 to enter his identification code. Correspondingly, in the step 1, it is determined thatthe same customer code as the customer code stored in the storage area 311 is stored in thefirst address of the directory table 34 and the program proceeds to the step 10. In the step 10, it is determined whetherthe number of erroneous entrytimes stored in the number of times storage area 34c in the first address 341 of the directory table 34 is less than a predetermined 85 number. In case that an identification code is again entered after the first error entry, the program proceeds to the step 2 since the number of erroneous entries is less than the predetermined number. In the step 2, it is determined that the identification code is again erroneous and the prog ram proceeds to the step 5. In the step 5, it is determined that the same customer code is stored in the directory table 34 and the program proceeds to the step 11. In the step 11, the new number of 1 plus the number which was already stored in the storage area 34c in the first address 341 of the directory table 34 is newly stored in the same storage area 34c and the current time at that time is stored in the time point storage area 34b. Thereafter, in the step 12, the data of the current time and the number of times for each customer code stored in each address of the directory table 34 is shifted one by one address toward a larger address direction. Subsequently, the operations similar to the above described steps 8 and 9 are effected and thereafter a series of opera tions is terminated.

As described in the foregoing, if and when identifi cation code is erroneously entered more than a preset and predetermined number, for example, two times, no check of identification code is made even if the identification code is correctly entered, unless a predetermined time period passes from the time point of the last erroneous entry. In operation of this situation, in the step 1, it is determined that the same customer code exists in the directory table 34 and, in the step 10, it is determined that the number of erroneous entry times exceeds the predetermined number. Thereafter, the program proceeds to the step 13. In the step 13, the contents stored in the time point storage area 34b in the same address as that of the customer code storage area 34a which stores the same customer code as the customer code stored in the storage area 311 of the buffer region 31. Then, the time point read out of the directory table 34 is subtracted from the current time clocked by the timepiece circuit 14 and it is determined whether the predetermined time period passes from the time point of error identification code entry. if and when the predetermined time period has already passed, the operations in the above described steps 5, 11, 12, 8, 9 are repeated again. Thus, in case of a predetermined number of error identification code entries, even if further identification code entries are made before the predetermined time period passes, no determination of the validity of the identification code is made, but rather, the number of erroneous entry times is increased one by one and the current time at that time is newly stored. Accordingly, in case that a person who stole a card makes an attempt to make a transaction processing by using the card, the number of erroneous entry times is incremented and the current time is renewed, unless a predetermined time period passes after a predeter- mined number of erroneous entries. Therefore, even if the same identification code as the correct identification code is entered by accident, no matching of identification code is made and thus no transaction processing is permitted. Accordingly, a customer can play for time until loss of his card is recorded after he noticed that his card was stolen or lost and thus there is an advantage that a transaction processing by using the stolen card can be prevented.

By the way, in case that a customer who tries to make transaction processing using a magnetic card is an original owner of the magnetic card, he should go home so as to confirm the correct identification code if some troubles as to his identification code occurs. in such a situation, he should again come to make a transaction processing after a predetermined time period passed from the latest time point of error identification code entry. In such a situation, the following operations are made. More particularly, the data is read out of the magnetic card and the identification code is entered by operating the tenkey 22, as described in the foregoing. Then, in the step 1, it is determined that the same customer code as a customer code stored in the storage area 311 is stored in any of the customer code storage area 34a in any address of the directory table 34 and the program proceeds to the step 10. In the step 10, the contents stored in the number of times storage area 34c corresponding to the address of the customer code storage area is read out and is compared with the contents of the predetermined number of times storage area 33. Then, if and when it is determined that an accumulated number of erroneous entry times exceeds a predetermined number, then the program proceeds to the step 13. In the step 13, the time point of the latest erroneous entry stored in the storage area 34b in the address corresponding to the address in which the customer code is stored is read out and the read out time point is subtracted from the current time clocked by the time piece circuit 14 to evaluate the time period elapsed. If and when it is determined that the time period elapsed exceeds a predetermined time period, then the program proceeds to the step 2. In the step 2, it is determined that the identification code now entered is correct, the program proceeds to the step 3. In the step 3, it is determined that the same customer code as a customer code stored in the storage area 311 exists in the directory table 34 and the program proceeds to the step 14. In the step 14, the contents in an address subsequent to the address of the same GB 2 150 330 A 5 customer code as a customer code stored in the storage area 311 are shifted one by one address toward a smaller address and stored therein. As a result, the data of the customer code associated with a correct identification code entered is erased from the directory table 34. Subsequently, in the step 4, the correctness is indicated and a series of the operations are terminated.

As described in the foregoing, in accordance with the embodiment of the present invention, upon erroneous entry of an identification code, after a record medium is returned to a customer he can be given a chance to confirm his correct identification code and after a predetermined time period, reentry of the identification code is permitted and within the predetermined time period reentry of the identification code is handled as invalid. Therefore, even if a record medium is stolen, it is possible to playfor time until the loss of the record medium is reported.

In addition, in case that a customer uses his own record medium, subsequent processing can be simplified and quickly achieved, compared with a conventional apparatus which takes into the inserted record medium after a predetermined number of erroneous entries.

In the following, other embodiment of the present invention will be described. Referring to Figures 5 and 6, the other embodiment of the present invention is such that in case that the number of erroneous entries of identification code is within the effective number of times, or a predetermined number of times, the determination of validity of the identification code is permitted until the number of error entries reaches the effective number, and in case that the number of erroneous entries exceeds the effective number of times, the determination of validity of identification code is first prohibited during a relatively short time period and thereafter the time period of prohibiting the determination of validity of identification code is progressively increased as the number of erroenous entries increases.

A point where other embodiment as shown in Figures 5 and 6 is different from the embodiment as shown in Figure 4 is that RAM 30A shown in Figure 5 110 is used instead of RAM 30 shown in Figure 1 and other embodiment operates in accordance with a flow chart shown in Figure 6 instead of the flow chart in Figure 4.

Figure 5 is a drawing schematically showning a storage region of RAM 30A used in other embodiment. In Figure 5, RAM 30A includes a buffer region 31 for storing the data to be compared, a directory table 34, a storage region 35 for storing the effective number of times and a storage region 36 for storing a limit time period.

Said buffer region 31 for storing the data to be compared includes a customer code storage area 311 for storing only one customer code, storage area 314for storing the number of erroneous entries in a current transaction by the same customer, an accumulated number of times storage area 315 for storing an accumulated number of the same customer's error entries of identification code, and a removed date and hour storage area 316 for storing the date and hour when the limitation is remoied. Thisremoved date and hour is defined as the date and hour when the limit time period evaluated based on the accumulated number of erroneous entries passes from the date and hour from the last erroneous entry in the effective number of times.

Said directory table 34 includes storage areas 341 34n of a plurality of addresses, each storage area in each address comprising a customer code storage area 34a, a storage area 34d for storing the number of erroneous entries in the current transaction, an accumulated number of times storage area 34e and a removed date and houi storage area 34f. These storage areas store the same date as that stored in each storage area included in said buffer region 31. Since the number of addresses in the directory table 34 is determined to a predetermined number, for example, a hundred addresses, for the purpose of convenience of memory capacity, if the number of a customer's erroneous entries exceeds a predetermined number, then the data associated with the oldest one of the customer codes being stored is removed and the subsequent data is shifted one address by one address and stored.

Said effective number of times storage region 35 is a region for presetting and storing the number, for example twice, where the operation of identification code determination is permitted even if error identification code is entered. The limit time period storage region 36 is a region for presetting and storing a predetermined limit time period, the starting time point of the period being the time point of the last erroneous entry of identification code in case of having entered error identification code an effec- tive number of times, during which the determination of validity of identification code subsequently entered is prohibited. This limit time period is selected to a predetermined, relatively shorttime period, for example, 15 minutes, and is utilized for evaluating the time point when prohibition of the determination is removed based on the number of erroneous entries. The limit time period is reported to a customer as necessary. In addition, the limit time period can be differently selected in accordance with user or the kinds of appa---tuses in which the identification code determination apparatus of the embodiment is utilized. The information stored in the effective number of times storage region 31 and the limit time period storage region 32, respectively, may be adapted to be stored in said ROM 15 if the information is fixedly set. Alternatively, in such a situation where the information is preset and stored in the ROM 15, the information is read out upon turning the power source on and transferred to RAM 30 and stored therein.

Figure 6 is a flow chart explaining the operation of other embodiment. Referring to Figures 1, 2, 5 and 6, a concrete operation of the embodiment will be described.

First, it is assumed that an identification code is correctly entered. Prior to the operation of the flow chart shown in Figure 6, a customer inserts a magnetic card into a card inserting slot 25 to manually scan the magnetic card and operates the tenkey 22 to enter his identification code. At this 6 GB 2 150 330 A 6 time, a card reader 21 reads out the data such as a customer code recorded in the magnetic card and provides the same to CPU 11. Correspondingly, CPU 11 initiates the operation shown in Figure 6.

In the step 101, CPU 11 causes each storage area in said buffer region 31 to be cleared and the customer code read out from the magnetic card to be stored in the storage area 311. Subsequently, in the step 102, CPU 11 retrieves in an address sequential manner whetherthe customer code stored in the storage area 311 exists in a storage area 34a of each address in the directory table 34. If and when the customer has not entered error identification code so far, as that time, the program proceeds to the step 103 since the customer code is not stored in any storage area 34a of any address of the directory table 34. In the step 103, it is determined whether the identification code previously entered coincides with a predetermined identification code of the customer's. This determination is made by way of many kinds of determination method as described in the foregoing. Now, assuming that it has been determined that correct identification code is entered, the program proceeds to the step 104. In the step 104, the correctness indicating lamp included in said determination result displaying portion 232 is lighted and a series of operations are terminated.

Incidentally, in the step 104, after indication of the correctness, a transaction processing is permitted and necessary transaction processing as not shown is made.

Next, an operation will be described where no erroneous entry of identification code was made at all in past transaction as far as this particular identification code is concerned, and in the present transaction. a predetermined number of erroneous entries occur at the first time. In this case, in the step 102, upon first entry of an identification code, it is determined that the same customer code as a customer code stored in the storage area 311 does not exist in the storage area of each address in the directory table 34. In the step 103, it is determined that the identification code is not coincident and thereafter the program proceeds to the step 105. In the step 105, CPU 11 evaluates the removed date and hour and renews the number of times in this transaction. The removed date and hour is evaluated based on the following equation.

removed date and hour = current date and hour + limit time period x (accumulated times + 1) More particularly, CPU 11 adds 1 to the accumulated number (initially, 0) stored in the storage area 315, multiplies the value of the result of the addition by the limit time period stored in the storage region 32 and adds to the product value thereof a current date and hour clocked by said timepiece circuit 14, that is, the current date and time point. For example, since an accumulated number is zero if the number of erroneous entries is within an effective number of times, the removed date and hour become the date and hour where a limit time period (for example, 15 minutes) is added to the current date and hour. The removed date and hour thus evaluated is stored in the storage area 316. At the same time, CPU 11 adds 1 to the number of erroneous entries in the present transaction stored in the storage area 314 and causes the result thereof (initially, 1 since the number of times in the present transaction is zero) to be stored in the storage area 314. Subsequently, in the step 106, CPU 11 causes all of the data stored in the directory table 34 to be shifted one address by one address toward a larger address direction, that is, old data storage direction shown in arrow, and thereafter, causes the data stored in each storage area of said buffer region 31 to be stored in each storage area of the first address 341 of the directory table 34. Subsequently, in the step 107, CPU 11 causes the correctness indicating lamp in the deter- mination result displaying portion 23b to be lighted and the buzzer 24 to sound for the purpose of warning.

In such a situation, the customer once again inserts the magnetic card into the card inserting slot 25 to scan the card and enters an identification code by operating the tenkey 22. Correspondingly, CPU 11 effects the same operation as in the above described steps 101 and 102. At that time, since the first erroneous entry has already occurred, CPU 11 determines that the customer code stored in the storage area 33a is stored in the storage area 34a of any address of the directory table 34 and the program proceeds to the step 108. In the step 108, CPU 11 reads out the data stored in other storage areas 34b - 34d corresponding to any address (for example, the first address) of the directory table 34 storing the same customer code as a customer code stored in the storage area 311 and causes the data read out to be stored in the corresponding storage area of the buffer region 31. In addition, CPU 11 causes the data stored in each address of the directory table 34 to be shifted one address by one address toward a smaller address direction. Subsequently, in the step 109, CPU 11 determines whether the current date and hour clocked by the timepiece circuit 14 exceeds the removed date and hour stored in the storage area 33d. At that time, assuming that the second entry of the same customer is made subsequent to the first erroneous entry of his identification code, since the current date and hour does not exceed the removed date and hour, CPU 11 determines to the effect and the program proceeds to the step 110. In the step 110, CPU 11 compares the number of erroneous entries in the present transac- tion stored in the storage area 315 with the effective number of times stored in the storage region 35 and determines the number of error entries in the present transaction is less than the effective number and the program proceeds to the step 103. Then, in the step 103, a determination of the validity of the entered identification code is made in a manner similar to the above described operation. At that time, if the correct identification code is entered at the second time, the program proceeds to the step 104. Contrarily, if the identification code entered at the second time is erroneous, the operations of the above described steps 105 - 107 are repeated.

As described in the foregoing, if the number of error entries of identification code is less than the effective number, the removed date and hour is set 7 GB 2 150 330 A 7 to the time point when a relatively short limit time period passes from the current date and hour. If the number of continuous error entries exceeds the effective number, in the step 110, CPU 11 determines that the number of erroneous entries in the present transaction is larger than the effective number and the program proceeds to the step 105. In this case, the number of erroneous entries in the present transaction is incremented one by one each time entry operation of identification code is made, without determining the entered identification code.

Meanwhile, in case that a customer who tries to make a transaction processing using a magnetic card is an original owner of the magnetic card, he should notice that he erroneously entered his identification code after several times of erroneous entries of identification code, and he would phone to his family, for example, to known a correct identification code. In such a situation, he can known the correct identification code relatively earlier. Then, after a limit time period passed, a transaction processing is made using a magnetic card in a manner similarto the above described operation. In such a case, CPU 11 operates the above described steps 101, 102 and 108, and then, in the step 109, determines that the current date and hour exceeds the removed time point and the program proceeds to the step 111. In the step 111, CPU 11 adds the number of erroneous entries in the present transaction stored in the storage area 314 to the accumulated number stored in the storage area 315 and causes the result of the addition to be stored in the storage area 315 and thereafter the storage area 314 to be cleared. Subsequently, in the step 103, CPU 11 determines validity of the entered identification code. At that time, if correct identification code is entered, the fact is determined and the program proceeds to the step 104.

However, even if a person makes an attempt to make a bad use of other's magnetic card, it is impossible to find out a correct identification code even after the first removed date and hour has passed. The reason is that since there are ten thousands combination in case of using as an identification code the number of four figures, it is difficult to know a correct identification code from the ten thousands combination by entering an identification code within limited times, the number of times being relatively close to the effective number of times. Accordingly, a person who makes a bad use of a magnetic card would erroneously enter the identification code many times. In such a situation, in the step 105, since the value where 1 is added to an accumulated number of error entries so far is multiplied by the limit time period (15 minutes) stored in the storage region 36, the evaluated li-nit time period is increased in proportion to the number of error entries and thus the removed date and hour progressively extends from the present to the future.

Thus, it is advantageous that since an effective number of times is determined to the relatively small number and a predetermined limit time period is determined to be relatively short and is variable according to the number of erroneous entries of identification code, the more a person tries to make a 130 bad use of other's magnetic card, the far the removed date and hour is extended and thus it can prevent the person from making a bad use of other's magnetic card. In addition, in case that an owner of magnetic card uses the magnetic card, earlier transaction processing can be made possible because of shorter waiting time and a lowering of service can be advantageously prevented.

Now, a further embodiment of the present inven- tion will be described in the following. Referring to Figures 7 to 9, the further embodiment of the present invention is adapted to prevent unfair use in case that a transaction processing apparatus is an automatic cash dispenser. More particularly, in accord- ance with this embodiment, a relatively small predetermined number of erroneous entries of identification code is permitted and a record medium is returned unless a correct identification code is entered within the predetermined number of times.

Thereafter, if and when a transaction is made using the record medium within a predetermined time period, the number of entries is accumulated irrespective of whether the entered identification code is correct or erroneous and the record medium is regarded as invalid record medium when the number of entries of identification code exceeds the relatively large number of invalidity, and thus a transaction processing can not be made even in an available time of the record medium after the predetermined time period passes.

The points where the further embodiment as shown in Figures 7 to 9 is different from the embodiment as shown in Figure 4 are that a customer operating portion 20A shown in Figure 7 is used instead of the customer operating portion 20, RAM 30B shown in Figure 8 is used instead of RAM 30, and the further embodiment operates in accordance with a flow chart shown in Figure 9 instead of a flow chart of Figure 4. Incidentally, in this embodi- ment, a bill delivering mechanism 17 and a coin delivering mechanism 18 shown in dotted line in a block diagram of Figure 1 are added.

Figure 7 is a schematic diagram showing a customer operating portion 20A for use in a further embodiment. A card insertir. slot (not shown) is provided in a panel of the customer operating portion 20A or in the vicinity thereof. The said card reader 21 is provided in a rear side of said card inserting slot. This card reader 21 reads out the data recorded in a magnetic card when the inserted magnetic card is transported.

A keyboard 22A provided in said customer operating portion 20A includes a tenkey 221 for entering an identification code and the amount claimed to be dispensed, a correction key 222 for commanding correction of a key entered identification code or the amount claimed to be dispensed, a key 223 for designating that the unit of the account claimed to be dispensed is in ten thousands, a key 224 for designating that the unit of the amount is in thousand, a yen key 225 and a balance inquiring key 226.

A display 23A provided in said customer operating portion 20A includes a procedure displaying portion 233 for displaying an operation procedure of the 8 GB 2 150 330 A keyboard, an amount displaying portion 234 for displaying the amount claimed to be dispensed, a displaying portion 231 for displaying the number of figures of entered identification code, and a determi- nation result displaying portion 232 for displaying a determination result (the result of determining whether a transaction processing is possible or impossible).

In addition, several apertures 26 are provided in the customer operating portion 20A, as necessary.

Figure 8 is a diagram schematically showing storage region of RAM 30B for use in a further embodiment. In Figure 8, RAM 30B includes a storage region 37 for storing the number of invalidi- ties and a directory table 38 for storing invalidated customer code, in addition to RAM 30 shown in Figure 3.

The said number of invalidities storage region 37 stores the predetermined number of erroneous entry times permitted. When the number of erroneous entries reaches the predetermined number, a customer code of recorded in that magnetic card is transferred to a directory table 38 as described subsequently.

Said directory table 38 includes a plurality of customer code storage areas and stores the customer code inherent in that card when said accumulated number of entries exceeds the number of permitted erroneous entry times. The magnetic card having the same customer code as a customer code stored in the directory table 38 is invalidated and thereafter transaction processing is invalidated.

Figure 9 is a flow chart explaining an operation of a further embodiment. Since this flow chart of the embodiment is the same as that of Figure 4 except for the steps 201 - 208, identical portions are labelled with identical step numbers.

Now, referring to Figures 1 and 7 to 9, a concrete operation of this embodiment will be described.

First, it is assumed that an identification code is correctly entered. Prior to explanation of an operation of the flow chart in Figure 9, a customer inserts a magnetic card into said card inserting slot. Correspondingly, the magnetic card is taken into a cash dispenser by way of an appropriate transporting means and is transported to the point where the card reader 21 is disposed. Atthat time, a detector switch (not shown) provided in vicinity of said card inserting slot detects insertion of the card. Corresponding- ly, CPU 11 initiates the operation of the flow chart shown in Figure 9.

More particularly, in the step 201, the data such as a customer code recorded in the magnetic card is read out by said card reader 21. In the step 202, the customer code just read out is stored in the storage area 311 in said buffer region 31. In the step 203, it is determined that the customer code read out from the magnetic card is stored in the directory table 38. If and when the customer code is not stored in the directory table 38, the program proceeds to the step 1 since that magetic card is available. In the step 1, it is determined whetherthe customer code read out from the magnetic card is stored in the storage area 34a of any address of the directory table 34. This determination is made for the purpose of determin- 8 ing whether the number of erroneous entries, although it does not reach the permitted erroneous entry times, exceeds the predetermined number. In such a situation, if and when the customer has not erroneously entered his identification code, the program proceeds to the step 2 since the customer is not stored in any storage area 34a of any address in the directory table 34. In lhe step 2, it is determined whether the entered identification code coincides with a predetermined identification code of that customer's. This determination is made byway of many kinds of determination method as described in the foregoing. Now, assuming that an identification code is correctly entered, in the step 4, a correctness indicating lamp included in said determination result displaying portion 232 is lighted. As a result, a series of operations are terminated in case thatthe correct identification code is entered.

Incidentally, afterthe correctness is determined in the steps 1 to 4, transaction processing is permitted and necessary operation for the transaction processing determined based on the kinds of the transaction processing apparatus, the detail of which is omitted.

Next, it is assumed that the identification code has not been erroneously entered so far and a predetermined number of erroneous entries occur in this transaction. First, in case that the first entry of identification code is effected, the operations in the above described steps 201 to 203 are done and in the step 1, it is determined that the same customer code as a customer code stored in the storage area 33a is not stored in the storage area 34a of each address of the directory table 34. Subsequently, in the step 2, it is determined thatthe identification code is not coincident and the program proceeds to the step 5. In the step 5, it is again determined whether the same customer code as a customer code read out from the magnetic card exists in the directory table 34. In such a situation, the program proceeds to the step 6, since the same customer code is not registered in the directory table 34 at the time of the first erroneous entry. In the step 6, the number of erroneous entries (initially 1) is written into the storage area 313 and a current time clocked by a timepiece 14 is written into the storage area 312. Subsequently, in the step 7, all the data stored in the directory table 34 is shifted one by one address toward a larger address direction. In the step 8, the data stored in the buffer region 31, that is, a customer code, a current time and the number of entries are stored in the address of the directory table 34, that is the first address, in which the newest data is to be stored. Subsequently, in the step 9, the incorrectness indicating lamp of the determination result displaying portion 232 is lighted and the buzzer 24 sounds for warning.

Then, the customer again operates the tenkey 221 and enters his identification code. Correspondingly, the operations as described in the steps 201 to 203 are done, and then, in the step 1, it is determined that a customer code stored in the storage area 311 is stored in the first address of the directory table 34. Subsequently, in the step 10, it is determined whether the number of entry times stored in the 9 GB 2 150 330 A 9 storage area 34c is more or less than the predetermined number, In case that an identification code is again entered after the first erroneous entry, the program proceeds to the step 2 since the number of 5 entry times is less than the predetermined number. In the step 2, it is determined that the entered identification code is again erroneous. Subsequently, in the step 5, it is determined thatthe same customer code is stored in the directory table 34 and the program proceeds to the step 11. In the step 11, the data of the same customer code is transferred to the buffer region 31 and 1 is added to the content of the storage area 313 and a current time is written into the storage area 312. Thereafter, in the step 12, all the data stored in from the newest address (the first address) to the address immediately before the address in which the same customer code is stored, is shifted one address by one address toward a larger address direction. More particularly, if and when the customer code read out from the magnetic card coincides with the customer code stored in the directory table 34, the data of the customer code is erased. Thereafter, the same operations as the above described steps 8 and 9 have been done and a series of operations are terminated.

As described in the foregoing, if and when the identification code is entered more than a predetermined number of times, a check of the identification code is not made even if a correct identification code is entered unless a predetermined time period passes from the time point of the last erroneous entry. In this case, the operations as described in the steps 201 to 204 are done and then, the program proceeds to the step 10. In the step 10, it is determined that the number of entry times has exceeded the predetermined number of times. Subsequently, in the step 13, the content of the storage area 34b of certain of addresses of the directory table 34 storing the same customer code as a customer code stored in the storage area 311, is read out. Then, the time point read out from the directory table 34 is subtracted from a current time clocked by the timepiece circuit 14. Subsequently, it is determined whether a predetermined time period passes from the time point of error entry of identification code. If and when a predetermined time has not passed, the program proceeds to the step 204. In the step 204, it is determined whetherthe accumulated number of entry times so far exceeds the permitted erroneous entry number. If and when the accumulated number has not exceeded the number of entry times, the operations of the above described steps 5, 11, 12, 8 and 9 are done. Thus, in case that identification code is entered just a predetermined number of times, the number of entry times is increased one by one and the current time at that time is newly stored, without further determining validity of entered identification code, even if the identification code is further entered many times before a predetermined time period passes. Accordingly, in case that an attempt will be made to use a stolen card for transaction processing, a matching of identification code can not be made and thus transaction processing is not permitted even if the same identification code as the correct identification is entered by accident after the number of erroneous entries has already exceeded a predetermined number of times. Therefore, it can take a sufficient time to report the loss of the card after he notices that his card is stolen or lost and thus unfair transaction processing by using a stolen card can be advantageously prevented.

Meanwhile, in case that a customer who tries to make a transaction processing using a magnetic card is an original owner of the magnetic card, he should go home and confirm the correct identification code if some troubles as to his identification code occurs. In such a situation, he should again come to make a transaction processing after a predetermined time period from the latest time point of error identification code entry. In such case, the following operations are made.

More particularly, the operations in the above described steps 201 to 204, and 130 are repeated and, in the step 13, it is determined that the predetermined time period has passed. Thereafter, in the step 2, it is determined that the entered identification code is correct. Subsequently, in the step 3, it is determined that the same customer code is stored in the directory table 34. Subsequently, in the step 14, all the data stored in the addresses largerthan the address in which the above described same customer code is stored in the directory table 34 is shifted one address by one address toward a smaller address direction and newly stored therein. As a result, the customer code which was previously stored in a directory table 34 due to erroneous entry, as well as the number of erroneous entries and the latest time point of entry are erased. Thereafter, the operation in the step 4 is done and then a series of operations are terminated.

Now, an operation in case that the number of error entries exceeds the number of permitted erroneous entries will be described in the following. If and when, after a predetermined number of erroneous entries have been made, the accumulated number of entry times exceeds the number of permitted erroneous entries stored in the permitted number storage region 37 within a predetermined time period, it is determined in the --ep 204 and the program proceeds to the step 205. In the step 205, the customer code where identification code is entered over the permitted erroneous entry times is written into a certain address of the table 38.

Subsequently, in the step 206, the contents stored in the address larger than the address in which that customer code is stored in the directory table 34, are shifted one address by one address to a smaller addressdirection. As a result, the data of that customer code where the entry has been made over the permitted erroneous entry times is erased from the directory table 34. Thereafter, in the steps 207 andlor 208, operations for processing unfair use are made based on a detection of unfair use. In an operation of processing this unfair use, for example, in the step 207, an alarm is given in a store, without being known by a customer, to tell an occurrence of invalid card. Alternatively, as other example of processing of unfair use, in the step 208, a television camera ora camera disposed in the vicinity of a GB 2 150 330 A transaction processing apparatus 10 makes a f if m of or takes a picture of a person who unfairly uses a magnetic card based on a detection of unfair use.

Thereafter, in the step 9, a series of operations are terminated after giving the alarm to the customer.

As described in the foregoing, in accordance with the embodiment, unfair use of record medium can be advantageously prevented, since the number of entries within a predetermined time period after more than a predetermined number of error entries is accumulated and, when the accumulated number exceeds the number of permitted erroneous entries, it is determined that the record medium is invali dated and thus necessary processing for preventing unfair use is made. In addition, in case that an owner of record medium uses the same, subsequently processing can be simplified and no processing of officials in charge is required, compared with an apparatus wherein the record medium is taken into the apparatus upon a predetermined number of erroneous entries.

In the above described embodiments shown in Figures 4 and 9, the number of entry times of identification code and the date, hour and minute of entry time are stored in the random access memory or 30B when correct identification code is not entered. However, preferably, the number of entry times of identification code and the date, hour and minute of entrytime may be magnetically recorded in a magnetic card. In such a situation, as shown in 95 the step 15 shown in dotted line of Figures 4 and 9, the operation step may followthe step 9, wherein the data stored in the storage areas 312 and 313 is recorded in the magnetic card. As a result, in a transaction processing apparatus in the form of off-line system, it can be advantageously prevented to make unfair transaction processing by using another transaction processing apparatus disposed in a different location.

Although the present invention has been described and illustrate in detail, it is clearly understood thatthe same is by way of illustration and example only and is notto be taken by way of limitation, the spirit and scope of the present invention being limited only by the terms of the appended claims.

Claims

1. An identification code determining apparatus for use in a transaction processing apparatus, said transaction processing apparatus making a transaction processing by a record medium which readably records customer identifying information for iden- tifying at least a customer, comprising:

reading means for reading out the information recorded in said record medium, entry means for entering an identification code known by only said customer, predetermined time period setting means for setting a predetermined time period determined so that, afterthe identification code is entered by said entry means, a transaction processing is accepted in response to the subsequent entry, number of entry times setting means for setting 130 the predetermined number of unconditionally acceptable entry times, storage means having, at least, the number of erroneous entry times storage region for storing the number of error entries of the identification code entered by said entry means and a time point of erroneous entry storage region for storing the latest time point of the erroneous entry, first determining means for determining whether the number of the same customer's entry times is within said predetermined number set by said setting means each time an identification code is entered by said entry means, second determining means for determining whether the time point of the entry in the present transaction exceeds a time point determined by adding said predetermined time period set by said predetermined time period setting means to the time point stored in said time point of erroneous entry storage region, and third determining means for determining validity of said identification code in response to the determination of said first determining means that the number of the same customer's entry times is within said predetermined number of times, or the determination of said second determining means that the time point now entered exceeds said predetermined time period from the time point stored at the time point of erroneous entry storage region.

2. An identification code determining apparatus in accordance with claim 1, wherein said storage means further includes the number of error entries storage region for storing the number of erroneous entry times and time point of erroneous entry storage region for storing said time point of erroneous entry for each customer code, respectively.

3. An identification code determining apparatus in accordancewith claim 1, which further comprises alarming means for alarming in response to determination of said third determining means that said record medium is not valid.

4. An identification code determining apparatus in accordance with claim 1, which further comprises recording means for recording the number of erroneous entry times stored in said the number of erroneous entry times storage region and the time point of erroneous entry stored in said time point of erroneous entry storage region, in response to determination of said third determining means that said record medium is not valid.

5. An identification code determining apparatus in accordance with claim 1, which further comprises enabling means for enabling a transaction proces- sing of said transaction processing apparatus, in response to determination of said third determining means that said record medium is notvalid.

6. An identification code determining apparatus in accordance with claim 1, wherein said record medium is a magnetic recording medium which is able to magnetically record said customer identifying information, and said reading means comprises a magnetic card reader means for reading out the information magnetically recorded in said magnetic recording 11 GB 2 150 330 A 11 medium.

7. An identification code determining apparatus in accordance with claim 1, wherein said storage means includes the number of erroneous entry times storage region for storing the 70 number of erroneous entry times, and which further comprises means for setting the number of permissible erroneous entry times, the number of which is predetermined to the number relatively larger than said predetermined number, a fourth determining means for determining that the number of erroneous entry times stored in said number of erroneous entry times storage region exceeds the number of permissible erroneous en tries set by said setting means, and means for making processing necessary for copying with unfair transaction, in response to the result of determination of said fourth determining means.

8. An identification code determining apparatus in accordance with claim 7, wherein said record medium is invalidated when the number of erroneous entries exceeds the number of permissible erroneous entries, said storage means includes a plurality of storage regions for storing customer code associated with invalidated record medium, and said processing means for unfair transaction in cludes means for writing a customer code contained in the record medium where said number of erroneous entry times exceeds the number of per missible erroneous entry times into said storage regions for storing the customer code associated with invalidated record medium.

9. Transaction processing apparatus constructed and arranged substantially as herein described with reference to any of Figures 1, 2,7, 8 and 9 of the drawings.

Printed in the U K for HMSO, D8818935,4j85,7102. Published bVThe Patent Office, 25 Southampton Buildings, London, WC2A lAY, from which copies may be obtained.

9. An identification code determining apparatus in accordance with claim 8, wherein said storage means further includes said number of error entry times storage region and said time point of entry storage region for each customer code corresponding to said customer identifying informa tion recorded in said record medium where it is determined that entered identification code is not valid.

10. An identification code determining apparatus110 in accordance with claim 7, wherein said processing means for unfair transaction includes alarm means for alarming in response to determination of said fourth determining means that said record medium is not valid.

11. An identification code determining apparatus in accordance with claim 1, wherein said determination of validity of said identification code is prohibited during said predetermined time period, and said storage means includes removed time point storage region for storing removed time point for removing said prohibition of determining validity of said identification code, and which further com prises fifth determining means for determining whether current time point in the present transaction passed said removed time point, counting means for accumulatively counting the number of erroneous entries of said identification 130 code, and the number of identification entries by way of said entry means until said removed time point is reached, sixth determining means for determining whether the value counted by said counting means is within said effective number of times, and seventh determining means for determining validity of the identification code entered by said entry means, in response to what said number of erroneous entry times is within said effective number of times, or what the number of errobneous entry times exceeds said effective number of times and said current time point passed said removed time point.

12. An identification code determining apparatus in accordance with claim 11, which further corn- prises removed time point renewing means for evaluating said removed time point in response to the value counted by said counting means and for causing said removed time to be stored in said removed time point storage region in a renewing manner, in case the said number of erroneous entry times exceeds said effective number of times and said current time point does not exceed said removed time point.

13. An identification code determining apparatus in accordance with claim 11, wherein said storage means includes storage region for storing an accumulated number of entry times and said removed time point storage region, for each customer code corresponding to said customer identifying information recorded in said record medium where it is determined the entered identification code is not valid.

14. An identification code determining apparatus in accordance with claim 13, which further comprises means for rendering the value counted by said counting means to be stored in said the number of entry times storage region, and clearing means for clearing said count value of said counting means.

Amendments to the claims have been filed, and have the following effect:(a) Claims 1 - 14 above have been deleted or textually amended. (b) New or textually amended claims have been filed as follows:

CLAIMS 1. Transaction processing apparatus, comprising reading means for reading out the information recorded in a record medium in which at least an identification code is recorded, entry means for entering an identification code by a person seeking to perform a transaction, means responsive to the identification code for determining the validity of the record medium, means for storing a predetermined number corresponding to a number of times that unsuccessful entry attempts are permitted and the number of unsuccessful entry attempts made by the person seeking to perform a transaction, means for comparing the stored number of unsuccessful entry 12 GB 2 150 330 A 12 attempts with the stored predetermined number of unsuccessful entry attempts with the stored predetermined number of permitted unsuccessful entry attempts exceeds the predetermined number, means responsive to determination by said comparing means thatthe number of unsuccessful entry attempts exceeds the predetermined number of permitted unsuccessfuly entry attempts and for disabling the validity determining means during a predetermined time period after the time of the most recent unsuccessful entry attempt, and means for storing a number of permissible entry attempts and the number of entry attempts, means for determining whetherthe latter exceeds the former during a predetermined disabling time period and means for disabling the validity determining means if the latter exceeds the former.

2. Apparatus in accordance with claim 2, including means for storing the number of erroneous entry attempts and the time of the most recent unsuccessful entry attempt for each of a plurality of identification codes.

3. Apparatus in accordance with claim 1 or 2, wherein said record medium is a magnetic recording medium which is able to magnetically record the identifying code, and said reading means comprises a magnetic card reader means for reading out the information magnetically recorded in said magnetic recording medium.

4. Apparatus in accordance with claims 1, 2 or3, which further comprises alarm means for alarming in response to the disabling means.

5. Apparatus in accordance with claim 1, 2,3 or 4, which further comprises recording means for -35 recording the number of erroneous entry attempts and time of the most recent unsuccessful entry attempt in response to determination that said record medium is not valid.

6. Apparatus in accordance with anyone of claims 1 to 5, wherein said storing means further includes means for storing invalid identification codes, means for storing a second predetermined number which is larger than said first predetermined number, second means for comparing said number of unsuccessful entry attempts with said stored second predetermined number for determining whetherthe number of unsuccessful entry attempts exceeds the second predetermined number, and means responsive to determination of said second comparing means thatthe number exceeds the second predetermined number and for storing the corresponding identification code, thereby indicating that said corresponding record medium is invalid.

7. Apparatus in accordance with claim 6, which further comprises alarm means operative in response to determination of said comparing means that the record medium is invalid.

8. Apparatus according to any preceding claim, further including means forgiving an alarm unknown to the person.