US5841866A — Secure token integrated circuit and method of per…

Claim 1

Independent Claim 59 words

A method of operating a circuit which includes the steps of accepting a challenge and a command, generating a first response to the challenge using a first algorithm which operates on at least the challenge and a secret key derived from information relating to the circuit and generating the first response only if the command is successfully carried out.

Claim 2

Independent Claim 59 words

A method of operating a circuit which includes the steps of accepting a challenge and a command, generating a first response to the challenge using a first algorithm which operates on at least the challenge and a secret key derived from information relating to the circuit and generating the first response only if the command is successfully carried out.

Claim 3

Dependent Claim 26 words

A method according to claim 1 wherein the challenge is generated, and accepted, by the circuit, and a corresponding challenge is generated externally of the circuit.

Claim 4

Dependent Claim 18 words

A method according to claim 2 wherein the challenge is generated by a counter means in the circuit.

Claim 5

Dependent Claim 23 words

A method according to claim 3 wherein the counter means is controlled at least partly by means which is external to the circuit.

Claim 6

Dependent Claim 22 words

A method according to claim 1 wherein the challenge is generated externally of the circuit and is then accepted by the circuit.

Claim 7

Dependent Claim 31 words

A method according to claim 5 wherein the challenge includes at one of the following: a number which is at least partly random, a command, and data relating to the circuit.

Claim 8

Dependent Claim 17 words

A method according to claim 1 wherein the information relating to the circuit is circuit identity information.

Claim 9

Dependent Claim 24 words

A method according to claim 1 which includes the step of transmitting the first response to a terminal which is external to the circuit.

Claim 10

Dependent Claim 31 words

A method according to claim 8 which includes the step, at the terminal, of generating a second response using at least data, relating to the circuit, obtained from the first response.

Claim 11

Dependent Claim 35 words

A method according to claim 9 wherein the second response is generated by the operation of the first algorithm on the challenge and on a second key derived at least from the said obtained data.

Claim 12

Dependent Claim 37 words

A method according to claim 10 wherein the second key is derived the operation of a second algorithm on the said information relating to the circuit and on an issuer's key which is stored at the terminal.

Claim 13

Dependent Claim 34 words

A method according to claim 9 which includes the steps of comparing the second response to the first response and, depending on the outcome of the comparison, of validating or rejecting the first response.

Claim 14

Dependent Claim 18 words

A method according to claim 1 which includes the step of storing a token count in the circuit.

Claim 15

Dependent Claim 33 words

A method according to claim 13 which includes the steps of accepting a token count decrement command and only generating the said first response if the token decrement command is successfully carried out.

Claim 16

Dependent Claim 13 words

A method according to claim 1 wherein the circuit is an integrated circuit.

Claim 17

Dependent Claim 15 words

A method according to claim 15 wherein the integrated circuit is carried on a card.

Claim 18

Independent Claim 108 words

A method of programming a circuit which includes the steps of: storing in the circuit a secret transport code which is not readable from outside the circuit; presenting a transport code to the circuit; comparing the presented transport code to the secret transport code and, if the presented transport code is acceptable, carrying out at least one of the following: storing application specific information in the circuit; storing a token counter value in the circuit; storing in the circuit a secret derived key which is derived using information specific to the circuit and a user defined function; and replacing the secret transport code with a derived validation key.

Claim 19

Independent Claim 108 words

A method of programming a circuit which includes the steps of: storing in the circuit a secret transport code which is not readable from outside the circuit; presenting a transport code to the circuit; comparing the presented transport code to the secret transport code and, if the presented transport code is acceptable, carrying out at least one of the following: storing application specific information in the circuit; storing a token counter value in the circuit; storing in the circuit a secret derived key which is derived using information specific to the circuit and a user defined function; and replacing the secret transport code with a derived validation key.

Claim 20

Dependent Claim 19 words

A method according to claim 17 wherein the information which is specific to the circuit is a serial number.

Claim 21

Independent Claim 65 words

A method of operating a circuit which includes the steps of: presenting the circuit to a terminal, accepting a challenge and a command, generating a first response to the challenge using a first algorithm which operates on at least the challenge and a secret key derived from information relating to the circuit, and generating the first response only if the command is successfully carried out.

Claim 22

Independent Claim 65 words

A method of operating a circuit which includes the steps of: presenting the circuit to a terminal, accepting a challenge and a command, generating a first response to the challenge using a first algorithm which operates on at least the challenge and a secret key derived from information relating to the circuit, and generating the first response only if the command is successfully carried out.

Claim 23

Dependent Claim 24 words

A method to claim 19 wherein the challenge is generated, and accepted, by the circuit, and a corresponding challenge is generated by the terminal.

Claim 24

Dependent Claim 21 words

A method according to claim 19 wherein the challenge is generated by the terminal and is then accepted by the circuit.

Claim 25

Dependent Claim 18 words

A method according to claim 19 which includes the stop of transmitting the first response to the terminal.

Claim 26

Dependent Claim 61 words

A method according to claim 22 which includes the step, at the terminal, of generating a second response by the operation of the first algorithm on the challenge and on a second key which is derived by the operation of a second algorithm on the said information relating to the circuit and an issuer's key which is stored at the terminal.

Claim 27

Dependent Claim 34 words

A method according to claim 23 which includes the steps of comparing the second response to the first response and, depending on the outcome of the comparison, of validating or rejecting the first response.

Claim 28

Dependent Claim 46 words

A method according to claim 19 which includes the steps of storing a token count in the circuit, issuing a token count decrement command from the terminal to the circuit, and only generating the said first response if the token decrement command is successfully carried out.

Claim 29

Independent Claim 165 words

A method of operating a token card which includes the steps of: (a) on the card, storing a card serial number, a token count and a first secret key derived from at least the card serial number; (b) at a terminal, storing a card issuer's key; (c) presenting the card to the terminal; (d) at the terminal, reading the card serial number, and issuing to the card a challenge and a token count decrement command; (e) on the card, if the token count decrement command is successfully carried out, operating a first algorithm on the first secret key and the challenge to produce a first response; (f) transferring the first response to the terminal; (g) at the terminal, operating the first algorithm on the challenge and on a second key derived from at least the card issuer's key and information obtained from the transferred first response, to produce a second response; and (h) at the terminal, comparing the transferred first response to the second response.

Claim 30

Independent Claim 165 words

A method of operating a token card which includes the steps of: (a) on the card, storing a card serial number, a token count and a first secret key derived from at least the card serial number; (b) at a terminal, storing a card issuer's key; (c) presenting the card to the terminal; (d) at the terminal, reading the card serial number, and issuing to the card a challenge and a token count decrement command; (e) on the card, if the token count decrement command is successfully carried out, operating a first algorithm on the first secret key and the challenge to produce a first response; (f) transferring the first response to the terminal; (g) at the terminal, operating the first algorithm on the challenge and on a second key derived from at least the card issuer's key and information obtained from the transferred first response, to produce a second response; and (h) at the terminal, comparing the transferred first response to the second response.

Claim 31

Dependent Claim 41 words

A method according to claim 26 wherein the second key is produced by the operation of a second algorithm on the card issuer's key and on the card serial number extracted from the said information obtained from the transferred first response.

Claim 32

Dependent Claim 32 words

A method according to claim 26 which includes the stop of accepting the card and the token transaction as valid if the transferred first response is successfully compared to the second response.

Claim 33

Dependent Claim 58 words

A circuit which includes means for accepting a challenge and a command, means for generating a first response to the challenge using a first algorithm which operates on at least the challenge and a secret key derived from information relating to the circuit, and means for generating the first response only if the command is successfully carried out.

Claim 34

Dependent Claim 58 words

A circuit which includes means for accepting a challenge and a command, means for generating a first response to the challenge using a first algorithm which operates on at least the challenge and a secret key derived from information relating to the circuit, and means for generating the first response only if the command is successfully carried out.

Claim 35

Dependent Claim 13 words

A circuit according to claim 29 which includes means for generating the challenge.

Claim 36

Dependent Claim 14 words

A circuit according to claim 30 wherein the challenge generating means includes counter means.

Claim 37

Dependent Claim 23 words

A circuit according to claim 31 wherein the counter means is controlled at least partly by means which is external to the circuit.

Claim 38

Dependent Claim 32 words

A circuit according to claim 29 wherein the challenge includes at least one of the following: a number which is at least partly random, a command, and data relating to the circuit.

Claim 39

Dependent Claim 17 words

A circuit according to claim 29 wherein the information relating to the circuit is a serial number.

Claim 40

Dependent Claim 17 words

A circuit according to claim 29 which includes means for transmitting the first response to a terminal.

Claim 41

Dependent Claim 14 words

A circuit according to claim 29 which includes means for storing a token count.

Claim 42

Dependent Claim 35 words

A circuit according to claim 36 which includes means for receiving a token count decrement command and control means for generating the said first response only if the token decrement command is successfully carried out.

Claim 43

Dependent Claim 11 words

A circuit according to claim 29 which is an integrated circuit.

Claim 44

Dependent Claim 15 words

A circuit according to claim 38 wherein the integrated circuit is carried on a card.

Claim 45

Independent Claim 90 words

A method of operating a circuit, the method including the steps of: programming a token counter; programming a serial number; deriving a secret key from the serial number and storing the secret key; submitting a challenge and a command to the circuit; the circuit responding to the challenge in a secret manner using at least one of the following: the token counter; the secret key; an encoding algorithm; and information relating to the circuit; executing the command; and producing a response that is evaluated to present an indication of validity.

Claim 46

Independent Claim 90 words

A method of operating a circuit, the method including the steps of: programming a token counter; programming a serial number; deriving a secret key from the serial number and storing the secret key; submitting a challenge and a command to the circuit; the circuit responding to the challenge in a secret manner using at least one of the following: the token counter; the secret key; an encoding algorithm; and information relating to the circuit; executing the command; and producing a response that is evaluated to present an indication of validity.

Claim 47

Dependent Claim 37 words

A method according to claim 40 which includes the steps of including in the challenge a command and a count, deducting the count from the token counter, and calculating a response using the new token counter value.

Claim 48

Dependent Claim 24 words

A method according to claim 40 which includes the step of controlling a second counter from a terminal, the second counter controlling the challenge.

Claim 49

Dependent Claim 24 words

A method according to claim 41 which includes the step of controlling a second counter from a terminal, the second counter controlling the challenge.

Claim 50

Dependent Claim 27 words

A method according to claim 40 which includes the step of storing the challenge in memory until the next time a challenge is submitted to the circuit.

Claim 51

Dependent Claim 95 words

A circuit which includes: means for programming a token counter with a value; means for programming a serial number; means for deriving a secret key from the serial number; means for storing the secret key; means for accepting a challenge and a command; means for responding to the challenge in a secret manner using at least one of the following: the token counter; the secret key; an encoding algorithm; and information relating to the circuit; means for executing the command; and means for producing a response that is evaluated to present an indication of validity.

Claim 52

Dependent Claim 95 words

A circuit which includes: means for programming a token counter with a value; means for programming a serial number; means for deriving a secret key from the serial number; means for storing the secret key; means for accepting a challenge and a command; means for responding to the challenge in a secret manner using at least one of the following: the token counter; the secret key; an encoding algorithm; and information relating to the circuit; means for executing the command; and means for producing a response that is evaluated to present an indication of validity.

Claim 53

Dependent Claim 46 words

A circuit according to claim 45 which includes means for extracting a count from the challenge, means for deducting the count from a value in the token counter to produce a new token value, and means for calculating a response using the new token counter value.

Claim 54

Dependent Claim 20 words

A circuit according to claim 45 which includes means for accepting a count, from a terminal, which controls the challenge.

Claim 55

Dependent Claim 23 words

A circuit according to claim 45 produced as an integrated circuit, which is bonded on a card to form a secure token card.

Claim 56

Independent Claim 75 words

A method of performing a transaction on a circuit which includes the steps of: (a) presenting the circuit to a terminal; (b) transferring a challenge and a decrement command from the terminal to the circuit; (c) implementing the decrement command on the circuit; (d) if the decrement command has been successfully implemented, transferring a response from the circuit to the terminal; (e) validating the response; and (f) if the response is valid, accepting the transaction.

Claim 57

Independent Claim 75 words

A method of performing a transaction on a circuit which includes the steps of: (a) presenting the circuit to a terminal; (b) transferring a challenge and a decrement command from the terminal to the circuit; (c) implementing the decrement command on the circuit; (d) if the decrement command has been successfully implemented, transferring a response from the circuit to the terminal; (e) validating the response; and (f) if the response is valid, accepting the transaction.

Claim 58

Dependent Claim 118 words

A circuit which includes: first storage means for storing a serial number; second storage means for storing a secret derived key derived from the serial number, an issuer's key and a first encoding function; token counter means; interface means for receiving a challenge and a decrement command; means for decrementing a count in the token counter means in response to the decrement command; means, in response to a successful count decrement, for producing an encoded value, from the secret derived key, the challenge and a second encoding function; means for providing an encoded response based on the challenge, a key, an algorithm and information on the circuit; and means for presenting the encoded value to the interface means.

Claim 59

Dependent Claim 118 words

A circuit which includes: first storage means for storing a serial number; second storage means for storing a secret derived key derived from the serial number, an issuer's key and a first encoding function; token counter means; interface means for receiving a challenge and a decrement command; means for decrementing a count in the token counter means in response to the decrement command; means, in response to a successful count decrement, for producing an encoded value, from the secret derived key, the challenge and a second encoding function; means for providing an encoded response based on the challenge, a key, an algorithm and information on the circuit; and means for presenting the encoded value to the interface means.

Annuity Stage	Window Opens	Payment Deadline	Surcharge Period Until	Estimated Fee	Status
3.5 Years (Year 4)	2001-11-23	2002-05-25	2002-11-24	$2000.00	Window Closed / Lapsed
7.5 Years (Year 8)	2005-11-23	2006-05-25	2006-11-24	$3760.00	Window Closed / Lapsed
11.5 Years (Year 12)	2009-11-23	2010-05-25	2010-11-24	$7700.00	Window Closed / Lapsed

Secure token integrated circuit and method of performing a secure authentication function or transaction

Abstract

Inventors

Bibliographic Details

Claims Analysis

References Cited (Backward Citations)

USPTO Annuity & Maintenance Windows

Assigned Categories & Tags

Assign Category Tag