US 11,700,136 B2Granted

PUF-IPA: a PUF-based identity preserving lightweight authentication protocol using binary string shuffling

AssigneeKansas State University Research Foundation

InventorsMahmood Azhar Qureshi, Arslan Munir

Life of this patent

Estimating the term…

Loading patent…

Abstract

A computer-implemented method for authentication of a queried device having an electrical circuit exhibiting physically unclonable functions (PUFs). The method includes: at the queried device, generating a first random number based on an initial first counter value; matching the first random number against a first value of a record stored in a database of a querying device, the record including second (shuffled) and third values; at the queried device, generating a second random number based on a once incremented first counter value, deterministically generating a de-shuffled second value based on an initial second counter value, determining that the second random number matches the de-shuffled second value, and submitting sub-challenges corresponding to the second random number to the electrical circuit to generate a response; and, at the querying device, determining that the response matches the third value of the record to complete a first authentication of the queried device.

Claims20

Dependent claims

A system for device authentication enrollment, comprising:

a queried electronic device including a queried memory element and an electrical circuit configured to output electrical signals indicative of a physically unclonable function of the queried electronic device;
and
non-transitory computer-readable media having computer-readable instructions instructing completion of the following steps by at least one processing element—
increment a first counter according to a first set of increments to generate a set of first counter values including a first counter value, the set of first counter values being in a sequential order,
generate a set of random numbers at least in part by performing a hashing operation on each of the set of first counter values, whereby the set of random numbers is ordered to preserve the sequential order,
logically pair off the set of random numbers to generate a plurality of pairs, each of the plurality of pairs comprising a first-indexed one of the set of random numbers and a second-indexed one of the set of random numbers,
store the first-indexed ones of the set of random numbers in a database,
submit sub-challenges respectively corresponding to the second-indexed ones of the set of random numbers to the electrical circuit to generate a set of responses,
perform, using a set of second counter values including an initial second counter value as input, a deterministic shuffling operation on the second-indexed ones of the set of random numbers to generate a set of shuffled second-indexed ones of the set of random numbers,
store the set of shuffled second-indexed ones of the set of random numbers in the database, the set of shuffled second-indexed ones of the set of random numbers being stored respectively in relation to corresponding first-indexed ones of the set of random numbers to preserve the logical pairing of the plurality of pairs,
store each of the responses of the set of responses in the database so as to form a group or record with a corresponding first-indexed one of the set of random numbers and a corresponding shuffled second-indexed one of the set of random numbers,
store the initial first counter value and the initial second counter value in the queried memory element.

9 more elements

A computer-implemented method for authentication of a queried device having a queried memory element, a queried processing element, a queried communication element, and an electrical circuit configured to output electrical signals indicative of a physically unclonable function of the queried device, the method comprising:

retrieving, via the queried processing element, a first value from the queried memory element;
generating, via the queried processing element, a first random number based on the first value at least in part by performing a hashing operation on the first value;
transmitting, via the queried communication element, the first random number to a querying device, the querying device having a querying communication element, a querying memory element and a querying processing element;
matching, via the querying processing element, the first random number against a first value of a record, the record being stored in a database of the querying memory element and also corresponding to second and third values;
transmitting, via the querying communication element and the queried communication element, the second value corresponding to the record to the queried device;
incrementing, via the queried processing element, the first value according to a first increment to generate a once incremented first value;
generating, via the queried processing element, a second random number at least in part by performing a hashing operation on the once incremented first value;
retrieving, via the queried processing element, a second value from the queried memory element;
performing, via the queried processing element and based on the second value, a deterministic de-shuffling operation on the second value of the record received from the querying device to generate a de-shuffled second value of the record;
determining, via the queried processing element, that the second random number generated by the queried device matches the de-shuffled second value of the record;
submitting, based on the matching determination and via the queried processing element, sub-challenges corresponding to the second random number to the electrical circuit to generate a response;
transmitting, via the querying communication element and the queried communication element, the response to the querying device;
and
determining, via the querying processing element, that the response generated by the queried device matches the third value of the record to complete a first authentication of the queried device.

11 more elements

Dependencies are inferred from the claim text.

Facts

Application: 17/296,863Filed 21 Nov 2019 · us provisional application
Priority: 26 Nov 2018
Published: US 2022/0029836 A127 Jan 2022
Granted: 11 Jul 2023
Term ends: Not estimatedThe source records don’t support an estimate.

Classification6 codes

H04L 9/0643
The encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions;…
H04L 9/3278
Using challenge-response: using physically unclonable functions [PUF]
G06F 21/44
Authentication, i.e. establishing the identity or authorisation of security principals: program or device authentication
H04L 9/0662
Pseudorandom key sequence combined element-for-element with data sequence, e.g. one-time-pad [OTP] or Vernam's cipher: with particular…