JPS58142478A - Transaction processor - Google Patents

Abstract

PURPOSE:To prevent a card from being used illegally and to stabilize the operation of a device, by permitting transactions when a keyword read out of the card, etc., and a keyword in a storage device have a correspondence relation and renewing the card and keyword in the storage device in such a case. CONSTITUTION:A transaction processor consists of a control center 1 having a CPU10 and an information file 11 classified by customers and cash dispensers 2 each having a CPU20, card reader and writer 24, memory 21, etc. The CPU20 of each cash dispenser 2 detects the coincidence between the keyword read out by the reader 24 and a keyword from a customer panel 23 to report it to the CPU10 of the center 10. This CPU10 checks on the coicidence between the keyword from the dispenser 2 and the keyword in the file 11; when they coincide with each other, payment is allowed and the keyword of th card and file 11 are updated. In case of the occurrence of a fault, the keywords are returned to the original keywords according to conversion programs provided to the CPUs 10 and 20 respectively to carry out transactions stably.

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a transaction processing device that performs a predetermined transaction using a card on which various data including a customer's unique PIN number are recorded, such as an automatic cash dispensing device installed in a financial industry such as a bank. It relates to transaction processing devices such as machines and automatic teller machines.

This type of transaction processing device compares the read data of the PIN number magnetically recorded on the card with the PIN number manually entered by the customer, or stores the PIN number in the device in advance and then uses the stored PIN number. The customer's personal identification number is compared with the personal identification number entered by the customer to confirm that the customer is eligible for the transaction. After this confirmation, a predetermined transaction is executed.

In financial industries such as banks, transaction processing devices for cash payments and deposits are already widespread.

It is no exaggeration to say that the magnetic recording format of cards used in this transaction processing device is already widely known. Since encoders for recording data on cards are also commercially available, counterfeiting of cards has become relatively easy. In particular, with devices that do not store the PIN number in the device and compare the read data of one card's PIN number with the PIN entered manually, it is possible for a forger to set the PIN number arbitrarily. , and transactions can be made using this arbitrarily set PIN number.

It is an object of the present invention to detect the use of a counterfeit card at an early stage, and to prevent fraudulent transactions using counterfeit cards.

Another object of the invention is to enable legitimate transactions even if a failure occurs in the means for preventing fraudulent transactions.

DESCRIPTION OF THE PREFERRED EMBODIMENTS Hereinafter, an embodiment in which the present invention is applied to a transaction processing device whose terminal device is an automatic cash dispensing machine will be described in detail with reference to the drawings.

FIG. 1 shows the overall configuration of the transaction processing device.

The transaction processing device consists of a control center (1) and a number of terminals connected online to the one center (1). One of the terminals is an automatic cash dispensing machine (hereinafter abbreviated as CD) (2).

The center (1) has a central processing unit (hereinafter referred to as CPU) that controls communication with each terminal and processes transaction data transmitted from the terminal. A communication control device 02 and a modem Q31 are provided for communication with the terminal, as well as a communication control device 02 and a modem Q31 for communicating with the terminal.In processing transaction data, the CPU Q1 performs card inspection, judgment on whether or not a transaction is possible, transaction processing, etc. Performs arithmetic processing and rewriting CIFQII.

A large number of terminals are connected to the center (1) via a modem (5) and a terminal controller (4), and communication with the center (1) is controlled by means of a modem (5) and a terminal controller (4). One of the terminals, C D (21, is an operation procedure display (2) that sequentially displays the operations that a customer must perform for a payment transaction, and a key F1 card insertion slot for inputting a PIN number, billed amount, etc. A card reader and writer (hereinafter referred to simply as a card card (referred to as a reader) (241, a slip issuing machine (2) that prints transaction data on a journal and slip for each transaction and imprints the emboss on the card and issues the slip, and counts the bills of the billed amount; It is equipped with a bill dispensing machine ■ as an input/output device.C
The PU- executes predetermined transactions by controlling these input/output devices and communication with the center (1). It is equipped with a CPU (21 is a memory (2) for storing transaction data, etc.). The CPU- is connected to the terminal controller (4) by an input/output control circuit (2). In FIG. 1, the memory that stores the program of CPUQ[l■, etc. is omitted from illustration.

FIG. 2 shows the data recording format of a card used in a transaction processing device. The card has a magnetic stripe, and the magnetic stripe includes an ID code indicating that the card is used by a bank, a bank approval hood indicating the usage category of the card, a customer-specific PIN number, a bank number,
A store number, a customer's account number, a keyword (K1) for determining whether the card is genuine, etc. are magnetically recorded.

FIG. 3 shows the contents of CIFQII provided in the center (1). In CIFQil, for example, each customer with magnetic Zorro has a memory area for the transaction data, and this area contains the account number, balance, PIN, keyword (K2), and if necessary, the previous keyword (
K20) is stored.

Keywords (Kl) and (K2) are mutually converted numerically by a predetermined algorithm, so even if the account number is the same, the card keyword (K1] and CIFQII
(7)-1-ry-do (K2),! - do not match, but are related by the above algorithm. This algorithm may be any arithmetic expression or one that exchanges digits.

The keywords (Kl) (K2) are updated for each transaction as shown later.

Figure 4 shows the customer's operations on CD+21 and the CD
It shows the procedure for +21 transaction processing. The customer first inserts the card into the card slot (step (to)), then manually enters the PIN number using the keyboard (step (to)).
). The data recorded on the inserted card is read by the card reader (to), and the PIN number in this card data is compared with the PIN entered by the key (step (to)). If the numbers match, an instruction to enter the requested payment amount will be displayed on the display, and the customer will enter the requested payment amount (step (goods)).The two PIN numbers do not match. In this case, the card is returned (Step 2), and the process ends.You may have to manually enter the PIN number again without returning the card immediately. If the answer is NO repeatedly, the card will be returned.

Once the payment request amount is entered, the data necessary for the payment transaction is ready, and we move on to communication with the center (1) (step (
35113ffl). In parallel with this center communication, the embossment of the card is imprinted on the journal by the slip issuing machine (c) (step @). CD+2
The message sent from 1 to the center (1) includes the terminal code of the CD (2), a hood indicating the type of message (in this case, a withdrawal message), a key-entered PIN number, the requested payment amount, and a keyword. Card data including (K1) is included. Upon receiving the message from CD+21, the center (1) determines whether the transaction is possible or not, inspects the card 1, creates a new keyword, and performs CIFαυ, as will be detailed later.
Updates, etc. are carried out, and a message indicating these processing results is transmitted to CD (21).
[The message sent to 21 includes the terminal address of CD+21, operation instructions (withdrawal allowed, return of non-withdrawal card, collection of non-withdrawal card), card write/write including new keywords, etc.
Contains data, account number, withdrawal amount and new balance.

After communication with the center and card imprint processing, it is checked whether there is a transmission error, whether there is a reception error, and whether there is an imprint error (steps (to) to (41). Transmission error and reception Regarding errors, if there are still 7 errors even after repeating transmission and reception with the center (1) the required number of times, YES is returned at step C11@. Imprint errors include, for example, when a card is placed on the conveyance path. There are cases where the imprint is not executed due to a blockage and the completion signal is not output.In the case of a transmission error, the transaction data is not sent to the center (1), so the transaction is unsuccessful.
The card is returned () (step @). Receiving errors and imp.
2 In the case of a lint error, the CIFQI) has already been updated, so generally the transaction is successful, but it is not possible to write a new keyword to the card (step (step)). Yes, even if you use a chair, the process will be left to the staff.

If there are no errors in steps (to) to (g),
According to the operation instruction number in the message sent from the center (1), withdrawal is possible (step), transaction data is printed on the slip (step), and a new keyword is written to the card.・Writing data (Sir Step),
Then, the cash equivalent to the withdrawal amount is paid out and the counting process (step (goods)) is performed in parallel.If the withdrawal is not possible, the card is collected or returned (step (451),
Will the cards be collected according to the instructions? (Step Nene)
, or the card is returned (step @].

Step penalty ~ (4I) where it is checked whether an error has occurred in these processes after slip printing, card writing, and cash dispensing counting.

A printing error is detected, for example, when a printing completion signal is not output. Card write errors include cases where the card is jammed and writing to the car F is completely or partially performed, and cases where the card is detected by a read check after writing. Examples of cash dispensing counting errors include jamming of banknotes. Even in the case of Izuwa's error, the transaction has already been completed. In the case of printing errors and cash dispensing counting errors, writing of data including new keywords to the card has been completed. In the case of a card write error, the keyword of the card is not updated. In either case, the matter will be left to the processing by the staff. The clerk hands over the customer's card and cash to complete the transaction. If a card write error occurs, such as when the card becomes jammed during writing, the card is unreadable and must be reissued.

If there are no errors, the card is returned (step 5G), the printed slip and cash are released (step), and the transaction is completed. If a card return error (step 51+) or a cash or slip release error (step 51) occurs, the process will be handled by the staff member.

In the above example, after updating the CIFQυ of center (1), the transaction is determined to be successful, but it is also possible to determine that the transaction is unsuccessful by restoring the center FOυ.

FIG. 5 shows the processing procedure of the center (1).

After receiving the message from the terminal, the message is classified (step (61)). If it is a withdrawal message (step (
62)), proceed to the withdrawal transaction processing from step (65). In the case of a deposit message (step (63)), predetermined deposit transaction processing is performed (step (78)). If the received message is another message, processing corresponding to that message is executed.

Now, in the withdrawal transaction process, first, the format of the received withdrawal message is checked, and the keyword (K1) in the message is converted into a numerical value using a predetermined algorithm. Further, CIFQυ is searched from the account number included in the message (step (65)). If there is an error in the content of the received withdrawal message (step (66)), for example, C
IFaIJ, (If there is no corresponding account number, an error message containing an instruction to return the non-transactionable card is sent to CD+21 (step (67)). If there is no error, next The key-entered PIN included in the message is compared with the PIN stored in the corresponding CIFQII account (step (6B)). If the PINs match, the next step is to check the keyword. Proceed. If the PIN numbers do not match, it means that the card was used fraudulently or a fraudulent code was used.
A telegram containing instructions to collect the non-transactionable card is sent to the CD (step (72)). In step (68), the PIN included in the card data in the telegram is compared with the PIN in the CIFQD. Also,
Since the verification of the personal identification number has already been carried out at the CD (2), the process of step (68) is not necessarily necessary at the center (1).

In the keyword F inspection, first, the numerically converted keyword in the message (corresponding to the card keyword (K is also 1), CIFQI) is compared with the keyword (K2) written in the corresponding account (step (6
9)). If both keywords match, there is no problem and the process proceeds to step (73). If the two keywords do not match, the previous keyword (K
20) is read from the CIFQI) or created from the keyword (K2) (step (70)). The easiest keyword to use is the number of times a card is used. In this case, as described later, +
1, a new keyword is created. Other keyword updating methods include 1, which is calculated using a predetermined function that uses the previous keyword as a variable, and random numbers.
and so on. When the keyword is calculated by a predetermined arithmetic expression, the previous keyword (K2O) can be easily obtained by back-calculating the above arithmetic expression using the current keyword (K2). For example, if the number of times a card has been used is used as a keyword, the previous keyword (K2O) can be found by subtracting -1 from (K2). In addition, when the dispersion number is adopted as a keyword, as shown in Figure 3, the previous keyword (
K2O) is stored in CIF (Ill), so this
All you have to do is read out.

In any case, once the previous keyword (K2O) is obtained, this keyword (K2O) is compared with the keyword in the message (corresponding to the card keyword [K1]) (step (71)).

If both keywords match, it is assumed that a regular card is being used and the process proceeds to step (73). As mentioned above, reception error (step (to)), imprint/
In the case of an error (step (40) and lie) or error (step (goods)), the updated keyword is not written to the card. Therefore, the keyword on the card remains at its previous value. The processes of steps (70) and (71) are provided to deal with the situation where the keyword of the card is not updated due to a failure of CD < 21.If the previous keyword does not match in step (71) , a message containing instructions to collect a card that cannot be used for transactions was sent to C.C. because a fraudulent card (counterfeit card) had been used.
D[21] (step (72)). If the previous keywords do not match, it is also possible to similarly obtain the previous keywords and compare them with the keywords on the card.

If both the password and the keyword match, the requested payment amount and the balance in the CIFQD are compared, and if the balance is greater, withdrawal is possible (step (73)). Step (
73], if the balance is insufficient, a message containing an instruction to return the non-withdrawal card is sent to CD +21 (step (
74)).

If withdrawal is possible, the balance and keyword (K2) in the storage area of the account number subject to the transaction in CIFaη are updated (step (75)).

The new balance is determined by subtracting the requested payment amount (withdrawal amount) from the stored balance. When the number of times a card is used is used as a keyword, a new keyword is created by adding +1 to (K2) as described above. Other keyword updating methods include calculating using a predetermined function using the previous keyword as a variable, and using random numbers. In the above function,
The number of uses, time, etc. can also be used as parameters. The random number is obtained by a random number generator consisting of a pulse generator and a counter that counts the generated pulses. In this way, when a new balance and a new keyword are obtained, these data are stored in the corresponding area of CIFQυ, and if necessary, the keyword (K2) is stored in the same area as the previous keyword. be done. step (71
) and the previous keyword (K2O) matches,
It is preferable that a new keyword is found based on the current keyword (K2) (in the case of an arithmetic expression), and in CIFQυ, it is preferable that the current keyword (K2) is stored as the previous keyword.

Subsequently, the updated keyword is converted into a numerical value using a predetermined algorithm (step (76)).

Then, this new numerically converted keyword replaces the keyword in the card data to create card write data. Finally, a message containing the created write data account number, withdrawal amount, and new balance in the withdrawal tube is edited and sent to the CD+21 (step (77)).

In CD+21, the card write data transmitted from the center (1) is written to the card as described above (step (to)), so the card keyword (K1) is newly created at the center. And it becomes a new keyword converted into a numerical value.

In FIG. 5, the above-mentioned password check and keyword check may also be performed in the deposit processing (step (78)). However, in the case of depositing money, fraudulent use of the card or use of a counterfeit card is unlikely, and even if there is, the customer will not suffer any disadvantage, so this is not necessarily necessary.

If necessary, step C19) +401 f In the case of a card error, send a message from the CD (21) to the center (1) to the effect that it is a card write error.
When the center (1) receives this card write error message, it stores the fact that it is a card write error in the area of the corresponding account number of CIFQυ. Then, execute steps (70) and (71) only if there is memory of this card write error, and if there is no memory of card write error, answer No at step (69). ≧ It is desirable to move to step (72) immediately.

A customer-specific keyword (K1) is recorded on the card. The CIF'α old card stores a keyword (K2) that corresponds one-to-one with the keyword (K1) in the storage area of the customer's account number.Then, when the card is used, the keyword (K2) is stored in the storage area of the customer's account number. (
It is checked whether there is a correct correspondence between the keyword (K1) and the previous keyword (K20).

And the keyword (Kln (K2) (K20) is updated.Keyword (K1) and (K2) (or (K20)
) does not have the correct correspondence, the transaction is prohibited. In addition to conventional card data, keywords are recorded on the card, making the format difficult to understand and making it difficult to counterfeit the card.Even if the card is counterfeited, this If the legitimate card is used at least twice before the counterfeit card is used, the keywords (K2) (K20) of CIFQII will be updated, so the keywords of the counterfeit card are no longer correct with the keywords of CIF (ill). There is no correspondence relationship,
Transactions are prohibited immediately.

If the CIFQll keywords were updated by using the correct card, but the updated keywords were not written to the card due to an error in CD (2), the card will not contain the previous keywords. It remains unrecorded.

In this case, the keyword of the card has a predetermined correspondence with the previous keyword (K20) of CIFaυ. Therefore, even if a card whose keyword has not been updated due to the error of %CD (21) is used, a normal transaction is possible.

In the above example, only the center (1) converts the keyword into a numerical value, but it is possible to install a numerical conversion program or a numerical conversion circuit in both the center (1) and CD+2), and perform numerical conversion of the keyword in both. You can also do this. This situation is shown in FIG. It is assumed that the keywords recorded on the card are 1=3412. This keyword is C
D[21, the first and second digits and the third and fourth digits are exchanged, respectively, resulting in K3=4321.

This keyword (K3 Nga Center (1) and CD (21)
transmitted between. Then, in the center (1), the keyword (K3) is further arranged in the reverse order and becomes 2
=1234. This keyword (K2) is CIFQ
It is stored in ll. In this way, the keyword is CIF
Ql) % Since the value is completely different both on the line and on the card, the value of the keyword is completely unknown from the outside.

Although a CD is shown as the terminal in the above embodiment, it goes without saying that the present invention can also be applied to automatic teller machines and loan machines. In this case, it is preferable to check the balance, make a transfer, or make a transfer. In addition, goods are sold using card-based transaction processing devices other than bank transaction processing devices, such as POS system terminals at gas stations and ECRs (electronic cash registers), unmanned supermarket terminals, and other card-based transaction processing devices. Needless to say, 71. can also be applied to vending machines. It's ugly. Oh, I, 7th movement, O6
．． Oh,. Not only that, but it also applies to devices that operate offline. In this case, the keywords are stored in the memory of the device rather than in the center. Furthermore, the present invention can also be applied to passbooks with magnetic stripes on which transaction data is recorded. Magnetic passbook (just record keywords live).

As explained in detail above, in this invention, the correspondence between keywords stored in a recording medium such as a card and the memory of a device is checked, and if both keywords have a predetermined correspondence, the transaction is permitted and recorded. Media and memory keywords have been updated. Transactions are prohibited if both keywords do not have a predetermined correspondence relationship. Therefore, it is difficult to forge a recording medium, and even if it is forged, it is possible to detect it early.
[i[*Kfm°゛7°"[1ffQ-5 is not possible, and fraudulent transactions are prevented.

Furthermore, if the updated keyword is not recorded on the recording medium due to some failure, the previous keyword F is checked. Therefore, even if the keyword is not updated, transactions are possible, and there is complete protection against failures.

[Brief explanation of drawings]

Figure 1 is a block diagram showing the overall configuration of the transaction processing device, Figure 2 is a diagram showing the card format, Figure 3 is a diagram showing the contents of the customer-specific information file, and Figure 4 is the operation of the terminal. FIG. 5 is a flow chart showing the operation of the center), and FIG. 6 is a diagram showing the state of numerical value conversion of keywords. (1)...Funtrail Center, (2)...Cash dispensing machine, shout■**@CP U s Qυ...Customer information file, (Foundation) 0 car F! reader and writer. Above Figure 4b Figure 6 1

Claims (4)

[Claims] (1) Using a recording medium in which user-specific data is recorded, the data read from the memory accessed by the data read from the recording medium or the data read by Jinko is compared with the data entered manually by the user. Accordingly, in a transaction processing device that confirms a genuine user, the recording medium has a storage area for keywords, and the transaction processing device has a memory that records the key two F for each user, and a memory that can read the data on the recording medium and read the data on the recording medium. Only when there is a predetermined correspondence relationship between a reading/writing device that writes data to be updated in the memory, a keyword read from the recording medium, a keyword in the recording medium, and a keyword in the memory. A transaction processing device, comprising: control means for permitting a transaction, and for creating a new keyword and thereby updating the keyword in a memory and a recording medium. (2) The transaction processing device according to claim (1), wherein past keywords are stored in the memory. (3) The transaction processing device according to claim (1), wherein the past keywords are calculated from keywords stored in the memory using a predetermined arithmetic expression. (4) The transaction processing device according to claim (1), wherein the past keyword is the previous keyword.