← Back to Patent Explorer
US4864110A Expired / Lapsed US ⏱️ 0.0 years remaining

Electronic payment process using a smart card

Assignee: ETAT FRANCAIS/TELEDIFFUSION DE FRANCE
•
Filing: 1987-10-13
•
Granted: 1989-09-05
•
Expires: 2007-10-13
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The storage cells are grouped into elements grouping at least two cells, each element being locatable by an address and having a parity. The balance of the card is the number of non-zero even elements with an address below the address of the odd element with the lowest address and which is called the "terminal". In order to debit the card and reduce said balance, the terminal is moved towards a lower address, while creating a new old element of lower address than the terminal to be displaced. In order to credit the card and increase this balance, the terminal is moved towards a higher address, while again giving to possible odd elements with a higher address than the terminal to be displaced an even character and while creating a new odd element with a higher address than the terminal to be displaced.

Inventors

  • 👤 Claude L. Guillou

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-27 16:24
CPC Classifications
G; G07; G07F; G07F7/00; G07F7/08; G07F7/0866; G06; G06Q; G06Q20/00; G06Q20/30; G06Q20/34; G06Q20/343; G06Q20/3433; G07F7/02

Claims Analysis

Total Claims: 6
Claim 1
Independent Claim 345 words
Electronic payment process using an Eprom card incorporating binary storage cells with a logic content equal either to 0 or to 1, whereby each cell can be electrically laced by irreversibly passing its content from one state to another, said process being characterized in that: the storage cells are grouped into elements grouping at least two cells, each element being locatable by an address and having a parity, one element being said to be even when the number of its cells in state 1 is even and is said to be odd when the number of its cells in state 1 is odd, the balance of the card is the number of non-zero elements having a first parity and an address below the address of the element of opposite parity with the lowest address and which is called a "terminal" or, if the latter element does not exist, the number of non-zero elements of said first parity in the memory, to debit the card and reduce said balance, the terminal is moved towards a lower address whilst creating a new opposite parity element with a lower address than the terminal to be displaced, whereby said new element becomes the new terminal, the number P of debited units being equal to the number of first parity elements located between the old terminal and the new terminal, plus 1, to credit the card and increase the balance, the terminal is moved towards a higher address, whilst again giving to possible elements which already have said opposite parity and having an address higher than the terminal to be displaced said first parity and this takes place by lacing a new cell and by creating a new element having the second parity with a higher address than the terminal to be displaced, unless said element already has said parity, in which case it is left as it is, the number K of units credited to the card being equal to the number of elements having the first parity located between the old terminal and the new terminal, plus 1.
Claim 2
Dependent Claim 345 words
Electronic payment process using an Eprom card incorporating binary storage cells with a logic content equal either to 0 or to 1, whereby each cell can be electrically laced by irreversibly passing its content from one state to another, said process being characterized in that: the storage cells are grouped into elements grouping at least two cells, each element being locatable by an address and having a parity, one element being said to be even when the number of its cells in state 1 is even and is said to be odd when the number of its cells in state 1 is odd, the balance of the card is the number of non-zero elements having a first parity and an address below the address of the element of opposite parity with the lowest address and which is called a "terminal" or, if the latter element does not exist, the number of non-zero elements of said first parity in the memory, to debit the card and reduce said balance, the terminal is moved towards a lower address whilst creating a new opposite parity element with a lower address than the terminal to be displaced, whereby said new element becomes the new terminal, the number P of debited units being equal to the number of first parity elements located between the old terminal and the new terminal, plus 1, to credit the card and increase the balance, the terminal is moved towards a higher address, whilst again giving to possible elements which already have said opposite parity and having an address higher than the terminal to be displaced said first parity and this takes place by lacing a new cell and by creating a new element having the second parity with a higher address than the terminal to be displaced, unless said element already has said parity, in which case it is left as it is, the number K of units credited to the card being equal to the number of elements having the first parity located between the old terminal and the new terminal, plus 1.
Claim 3
Dependent Claim 35 words
Process according to claim 1, characterized in that the first parity is the even parity and the opposite parity is the odd parity, the terminal being constituted by the odd element with the lowest address.
Claim 4
Dependent Claim 30 words
Process according to claim 1, characterized in that the storage elements can either be pairs, or nibbles, or bytes, or more complex words, or a combination of these various elements.
Claim 5
Dependent Claim 67 words
Process according to claim 1, characterized in that the card is of the microprocessor type with a memory having a reserved zone constituted by bytes, the basic byte of address A and the following byte of address A+1 not being available for payment, the zone reserved to the payments and to reloading operations ranging from the byte of address A+2 to the last byte of address Amax.
Claim 6
Dependent Claim 70 words
Process according to claim 3, characterized in that the reserved zone comprises M words constituted in each case by N bytes, each word starting with a first byte, whose most significant nibble is determined and the same for all the words, the elements usable for the payment thus being constituted by the least significant nibble belonging to the first byte of each word and the following bytes of each word.

References Cited (Backward Citations)

FR2403597A1 Cited
FR2503423A1 Cited
US4810862A Cited
BE904689A Cited
EP0227532A1 Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1992-09-04 1993-03-06 1993-09-05 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1996-09-04 1997-03-06 1997-09-05 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2000-09-04 2001-03-06 2001-09-05 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag