JPS59180686A - Paying system with card - Google Patents

Abstract

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

Description

DETAILED DESCRIPTION OF THE INVENTION Technical Field The present invention relates to a payment method using a credit card so that payment processing can be performed using a card such as a debit card or a credit card.

BACKGROUND TECHNOLOGY Debit cards and credit cards have traditionally had a single secret code corresponding to the card, and payment processing is performed when the recorded contents of the card match the entered secret code. It is configured like this. In this prior art, if a person who picks up a lost card happens to present the correct secret code, the payment process will be processed. Once this secret is shared with others] IJll! Once cleared, the card can be used for any number of subsequent payment transactions.

Purpose The purpose of the present invention is to provide a payment method for using a card four times a month, which prevents card abuse as much as possible as described above.

Structure and effect of the invention The non-inventive feature is that multiple sets of combinations of secret codes and their names -r, 1- are loaded with 71 cards, and after the recorded contents of the cards are retrieved using a terminal, the terminal The unconnected host computer selects the name stored in advance and displays the terminal p% 1l11. When using a card, the user enters a secret code corresponding to the displayed name on the terminal 111j (thereby, the host computer determines the secret code and processes the payment). This is the payment method that was used.

According to the present invention, a plurality of combinations of a secret code and its name are set corresponding to the card number 111-, and the name is selectively displayed in the host computer, so that the name corresponding to the displayed name is set. Since payment processing P1 cannot be performed without entering the secret code, even if one secret code is solved by the hermit, the same secret code will be used for subsequent payment processing. This reduces the chance that the card will be misused.

Embodiment FIG. 1 is an overall system diagram of an example of the present invention. (g) 4 end 1←11, comprising a keyboard 2 including a numeric keypad etc., a display 3, and a reading means 5 for reading and taking a debit card 4. This terminal is protected by the host computer 7 installed in the 1 and 14 directions via communication lines 6 such as low i and tlj communication lines. A hand operated means 9 called a pin pad or the like is connected to the l through a flexible line 8. The hand operated means 9 includes an input means 10 including a numeric keypad, etc., and an input means 10 for displaying numbers and other characters. It is configured as a flat, hand-held type.

Is it compatible with Ishi's debit card 4? 1. ' As shown in Table 1, a plurality of combinations of secret codes and their names are prepared in advance, and the contents shown in Table 1 are stored in advance in the host computer 7. ing.

(Left below) Referring to Table 1 and Figure 2, the process moves from step n1 to step n2, where the record on the debit card 4 is read by the reading means 5, and in step n3, the keyboard 2 is operated to calculate the amount to be paid. and the store's count number 4F, etc., manually. In step n4, the data read by the reading means 5 of the debit card 4 is sent from the terminal 1 to the host computer 7 via communication I7+16. step.

At n5, the host computer 7 randomly selects one of the secret codes using the random number t>. In step n6, the host computer 7 assigns the name corresponding to the selected secret code to the terminal 1 + [(
1 via the communication line 6, and the name is displayed on the display 11 of the hand operating means 9 in step n7. The customer reads the name displayed on the display 11 and inputs the secret code shown in Table 1 corresponding to the name using the input means 10. This secret code is, for example, a four-digit number as shown in Table 1.

In step n9, the secret code input from the terminal l to the host computer 7 is transmitted. As a result, in step nlO, Ht! '1 It is determined whether the secret code input by the customer and transmitted to the host computer 7 matches the secret code selected by the host computer 7 in step n5. If it is determined in step n11 that they match, the process moves to step n12, where the host computer 7 (c) performs payment processing by transferring money from the bank account of the holder of the debit card 4. In step n1.3, host computer 7 sends terminal $1
to transmit signals indicating payment processing. At step nl4, the display 3 of the terminal 1 displays that the payment process is incomplete, and the series of operations ends at step n1'5.

If it is detected in step nI L'l/C that the input secret codes do not match, the host computer 7 selects one other secret code corresponding to the debit card 4 in step n16. and derives a signal representing the second name. C'! This name can be displayed on the display 11 by L.The cardholder enters the secret code corresponding to the name written on the table in step n17, and in step n
At step 18, the host computer 7 determines whether the files match. When there is only one secret code, in step n19, the number 1 representing the name corresponding to the previously unmatched secret code is derived to the terminal 1, and the unmatched name is displayed on the display 11. indicate. This allows the cardholder to manually input the code corresponding to the name that does not match. This allows step n2
0 and d, mismatched name VrC: (;j It is determined whether the corresponding secret code has been input to IE Lo.

- When attacked, the VC moves to step n21, selects another code from 13) and 171 days ago, and displays the name corresponding to the other secret code on the display 11.

As a result, when the second secret code is input by the card holder, a match is determined in step n22. Step n19. 1 on n21.・The operation to move is +'+iJ: 17B, step 15~. n
+ 0's □, made by ljj and 1rjj4Q, Q.

Only when there is a match in step n22, payment processing is performed in step n22.

In step n18, if it is determined that the secret code inputted corresponding to the second name (bum) does not match the secret code selected in the host computer 7, the process proceeds to step n23.
Then, the host computer 7 informs on the display 3 that L'N4 Kiiso 1 Kibari 1 is impossible.

If it is determined in step n 204 n 22 that there is also a mismatch, the process proceeds to step n 24 and similarly the host computer 7 is loaded. In step n25, the host computer 7 records the things that should be paid in addition to the use of the debit card 4 in a blank list. is displayed as 't<:j:3, and the process moves to step n26 to end the series of operations.

The present invention can be implemented not only with debit cards, but also with credit cards.
At this time, the payment processing may include billing, preparation of an account, and the like.

4. Figure 2 is a flowchart of the entire system diagram of an embodiment of the present invention; .

1...9: M end gate, 1...debit card, 5.
...Anti" (zo means, 7... host computer, 9.
・Manipulator (Monger agent) ``Buried soil West relief trial part - envy''.

Claims (1)

[Claims] For multiple combinations of secret code and its name, select [
After t corresponds to a single card and the terminal reads the contents of the card, the host computer connected to the terminal changes the pre-stored name to J'.
Select N and display it on the terminal 4, and on the Z:A terminal side, manually enter the secret code corresponding to the displayed name, the host computer will judge the secret code and process the payment. A payment method using a card that is patented.