Method of debiting an electronic payment means

• US 5,907,832 A
• Filed: 11/15/1996
• Issued: 05/25/1999
• Est. Priority Date: 11/15/1995
• Status: Expired due to Term

• Current Assignee: Koninklijke KPN NV
• Original Assignee: Koninklijke Philips N.V.
• Inventors: Pieterse, Rob, Rombaut, Willem
• Primary Examiner(s): Trammell, James P.
• Application Number:
  US08/751,156
• Time in Patent Office: 921 Days
• Field of Search: 380/3, 380/4, 380/21, 380/22, 380/24, 380/35, 380/38, 380/44, 380/45, 380/51, 705/39, 705/40, 705/41, 705/42, 705/44
• US Class Current: 705/39
• CPC Class Codes: G06Q 20/10 specially adapted for electronic funds transfer [EFT] systems; specially adapted for home banking systems
• CPC Class Codes: G06Q 20/341 Active cards, i.e. cards including their own processing means, e.g. including an IC or chip
• CPC Class Codes: G06Q 20/3674 involving authentication
• CPC Class Codes: G06Q 20/3676 Balancing accounts
• CPC Class Codes: G06Q 20/4093 Monitoring of device authentication
• CPC Class Codes: G07F 7/082 Features insuring the integrity of the data on or in the card
• CPC Class Codes: G07F 7/0866 by active credit-cards adapted therefor G07F7/1008 takes precedence
• CPC Class Codes: G07F 7/1008 Active credit-cards provided with means to personalise their use, e.g. with PIN-introduction/comparison system

Abstract

The invention provides a method for protectedly debiting an electronic payment mechanism, such as a telephone card. In the communication protocol between the payment mechanism and payment station, an authentication is used to identify the payment mechanism during various steps of the protocol. According to the invention, the authentications are mutually related by states of a cryptographic process in order to be capable of detecting an interference in the protocol. The method may be applied to existing payment cards having a dynamic memory, it being guaranteed that the contents of the dynamic memory, in which there is located information related to the authentication, is not lost during the protocol.

Claims

1. A method of performing a transaction between an electronic payment mechanism and a payment station, comprising:

requesting, by said payment station, payment data from said payment mechanism;

generating a plurality of authentication codes in which each authentication code of said plurality of authentication codes is linked to a preceding authentication code in a same transaction between said payment mechanism and said payment station; and

transmitting, by said payment mechanism, said requested payment data including a respective authentication code of said plurality of authentication codes, to said payment station.

2. The method according to claim 1, wherein said step of generating said plurality of authentication codes generates at least one authentication code using an initial value derived from a final state of a previously generated authentication code.

3. The method according to claim 1, wherein said step of generating said plurality of authentication codes generates at least one authentication code using a key.

4. The method according to claim 1, wherein said step of generating said plurality of authentication codes generates at least one authentication code using a random value.

5. A method of performing a transaction between an electronic payment mechanism and a payment station, comprising:

transferring, by said payment station, a first random value to said payment mechanism;

determining a first authentication code using at least a first value, the first random value, and a first balance of said payment mechanism;

generating a first end value corresponding to said first authentication code;

transferring, by said payment mechanism in response to said first random value transferred by said payment station, said first authentication code to said payment station;

transferring, by said payment station, a debiting command to said payment mechanism;

reducing said first balance of said payment mechanism to a second balance using said debiting command;

transferring, by said payment station, a second random value to said payment mechanism;

determining a second authentication code using at least a second start value, the second random value, and said second balance of said payment mechanism; and

transferring, by said payment mechanism in response to said second random value transferred by said payment station, said second authentication code to said payment station,

wherein in said step of determining said second authentication code, said second start value is based on said first end value.

6. The method according to claim 5, wherein in said step of determining said second authentication code, said second start value is identical to said first end value.

7. The method according to claim 5, further comprising:

determining at least one of said first authentication code and said second authentication code using a key and an identification code.

8. The method according to claim 5, further comprising:

determining said first end value, said first authentication code, and said second authentication code using a cryptographic function.

9. The method according to claim 5, further comprising:

transferring, by the payment mechanism, said first balance and said second balance to said payment station; and

recording, by the payment station, a difference between said first balance and said second balance.

10. The method according to claim 5, further comprising:

setting said second random value to be identical to said first random value before transferring said second random value.

11. The method according to claim 5, further comprising:

repeatedly writing at least one of said first balance and said second balance to a rewritable memory of said payment mechanism in accordance with predetermined clock pulses such that contents of a dynamic memory of said payment mechanism are maintained, said contents of the dynamic memory including at least one of said first authentication code, said second authentication code, said first random number and said second random number.

12. The method according to claim 11, wherein said step of repeatedly writing writes said at least one of said first balance and said second balance to said rewritable memory between 50 and 150 times.

13. The method according to claim 11, further comprising:

increasing a frequency of said predetermined clock pulses.

14. The method according to claim 11, further comprising:

adjusting a shape of said predetermined clock pulses to comprise an asymmetric 1/0 ratio.

15. A smart card, comprising:

a memory which stores data corresponding to a balance of said smart card;

a feedback shift register which produces at least one authentication code for said smart card;

a logic circuit connected to the memory and the feedback shift register, said logic circuit combines data from said memory and feedback data from said feedback shift register and inputs said combined data to said feedback shift register; and

a clock generator which generates a clock pulse which controls an operation of said memory and said feedback shift register,

wherein contents of said feedback shift register are maintained by varying at least one of a frequency and a ratio of said generated clock pulses.

16. A smart card according to claim 15, further comprising:

a register connected to said logic circuit, said register stores a random value.

17. A smart card, comprising:

a memory which stores data corresponding to a balance of said smart card;

a feedback shift register which produces at least one authentication code for said smart card;

a logic circuit connected to the memory and the feedback shift register, said logic circuit combines data from said memory and feedback data from said feedback shift register and inputs said combined data to said feedback shift register; and

a clock generator which generates a clock pulse which controls an operation of said memory and said feedback shift register,

wherein contents of said feedback shift register are maintained by repeatedly writing said data corresponding to said balance to said memory between 50 and 150 times.