PHYSICALLY UNCLONABLE FUNCTIONS USING PULSE WIDTH CHAOTIC MAPS
Technologies are provided for clockless physically unclonable functions (PUFs) in reconfigurable devices. Embodiments of the disclosed technologies include processing circuitry configured to perform numerous operations. The operations can include receiving a challenge continuous pulse signal, and generating a response continuous pulse signal by iteratively extending the challenge continuous pulse signal in time-domain. In some configurations, the iteratively extending includes generating a next continuous pulse signal by operating on a prior continuous pulse signal according to a stretching function, and generating a second next continuous pulse width signal by operating on the next continuous pulse signal according to a folding function.
1 . A method, comprising:
receiving a challenge signal that defines parameters of components of a device, an input width of a pulse, or a combination of the two; and
generating, based on iteratively performing a plurality of stretching operations causing an amplification of the input width of the pulse and a plurality of folding operations causing a reduction of the input width less than the amplification, a binary sequence used to identify the device among nominally identical counterparts of the device.
2 . The method of claim 1 , wherein the parameters of the components of the device are associated with a wiring configuration of the device.
3 . The method of claim 1 , wherein the input width of the pulse comprises a first duration, wherein the plurality of stretching operations causes the first duration of the input width to increase to a second duration, wherein the plurality of folding operations causes the second duration of the input width to decrease to a third duration that is less than a reference time interval.
4 . The method of claim 1 , further comprising iteratively performing the plurality of stretching operations and the plurality of folding operations a defined number of iterations.
5 . The method of claim 4 , further comprising generating the binary sequence after the defined number of iterations.
6 . The method of claim 1 , further comprising iteratively performing the plurality of stretching operations causing the amplification of the input width of the pulse and the plurality of folding operations causing the reduction of the input width less than the amplification according to a chaotic map.
7 . The method of claim 6 , wherein the chaotic map comprises one of a Bernoulli shift map, a tent map, or a logistic map.
8 . The method of claim 1 , further comprising iteratively performing the plurality of stretching operations and the plurality of folding operations until a termination criterion is satisfied.
9 . The method of claim 1 , wherein the binary sequence used to identify the device comprises construct keys or tables of bits of the binary sequence.
10 . The method of claim 1 , wherein each bit of the binary sequence is generated based on performing each iteration of the plurality of stretching operations and the plurality of folding operations.
11 . An apparatus comprising:
one or more processors; and
a memory storing processor-executable instructions that, when executed by the one or more processors, cause the apparatus to:
receive a challenge signal that defines parameters of components of a device, an input width of a pulse, or a combination of the two; and
generate, based on iteratively performing a plurality of stretching operations causing an amplification of the input width of the pulse and a plurality of folding operations causing a reduction of the input width less than the amplification, a binary sequence used to identify the device among nominally identical counterparts of the device.
12 . The apparatus of claim 11 , wherein the parameters of the components of the device are associated with a wiring configuration of the device.
13 . The apparatus of claim 11 , wherein the input width of the pulse comprises a first duration, wherein the plurality of stretching operations causes the first duration of the input width to increase to a second duration, wherein the plurality of folding operations causes the second duration of the input width to decrease to a third duration that is less than a reference time interval.
14 . The apparatus of claim 11 , wherein the processor-executable instructions, when executed by the one or more processors, further cause the apparatus to iteratively perform the plurality of stretching operations and the plurality of folding operations a defined number of iterations.
15 . The apparatus of claim 14 , wherein the processor-executable instructions, when executed by the one or more processors, further cause the apparatus to generate the binary sequence after the defined number of iterations.
16 . The apparatus of claim 11 , wherein the processor-executable instructions, when executed by the one or more processors, further cause the apparatus to iteratively perform the plurality of stretching operations causing the amplification of the input width of the pulse and the plurality of folding operations causing the reduction of the input width less than the amplification according to a chaotic map.
17 . The apparatus of claim 16 , wherein the chaotic map comprises one of a Bernoulli shift map, a tent map, or a logistic map.
18 . The apparatus of claim 11 , wherein the processor-executable instructions, when executed by the one or more processors, further cause the apparatus to iteratively perform the plurality of stretching operations and the plurality of folding operations until a termination criterion is satisfied.
19 . The apparatus of claim 11 , wherein the binary sequence used to identify the device comprises construct keys or tables of tables of bits of the binary sequence.
20 . The apparatus of claim 11 , wherein each bit of the binary sequence is generated based on performing each iteration of the plurality of stretching operations and the plurality of folding operations.