Professional Documents
Culture Documents
Discussion 1 CS771
Discussion 1 CS771
Discussion 1 CS771
your sensors so
that tampering
can be detected!
0 bit
1
rm
Correct. However, the devices
p ms delay s d do
are consistent, i.e., their delays ela
not change (too much) over time. y
e lay
s d
sm
q ms delay
It is difficult to deliberately
create another mux that
exhibits the same delays
Arbiter PUFs If the top signal reaches the finish line first,
the “answer” to this question is 0, else if the
bottom signal reaches first, the “answer” is 1
Question: 1011
1 0 1 1
?
Arbiter PUFs If the top signal reaches the finish line first,
the “answer” to this question is 0, else if the
bottom signal reaches first, the “answer” is 1
Question: 1011
1 0 1 1
1?
Arbiter PUFs If the top signal reaches the finish line first,
the “answer” to this question is 0, else if the
bottom signal reaches first, the “answer” is 1
Question: 0110
0 1 1 0
0?
Some FAQs
Does it matter whether the “red” signal reaches first or the “blue”?
No, the color does not matter – the color was added just for explanation
Why go into all this fuss of having multiple multiplexers?
It was expected that it would make it more difficult to predict the answers.
Also, it increases the number of possible questions.
Is it compulsory to have only 4 multiplexers?
Absolutely not. It depends on how long are your “questions”
That would make
It is common
the total number
to have 64
of challenges > Good … even if an attacker knows the
multiplexers
18 Quintillion!! responses to a few challenges, there is
no way to guess the other answers.
By the way, people usually call
Right? Right? Hello! Melbo!!
the questions “challenges”
Actually … and the answers “responses”
A Twist in the Tale
is the (unknown) time
An attacker can see responses on a few challenges and at which the upper
use ML to predict responses on all other challenges signal leaves the -th
mux. is the time at
Does not matter if using 32-bit or 64-bit challenges which the lower signal
leaves the -th mux.
All mux-es are different so
𝑐0 𝑐1 𝑐2 𝑐 63
𝑟0
𝑝0
𝑡 𝑢0
𝑟1
𝑝1
𝑡 𝑢1
𝑟2
𝑝2
…
𝑡 𝑢2
𝑟63
𝑝63
𝑡 𝑢63
𝑠0
𝑞0
𝑡 𝑙0 𝑠1
𝑞1
𝑡 𝑙1 𝑠2
𝑞2
𝑡
…𝑙
2
𝑠 63
𝑞63
𝑡 𝑙63
A Twist in the Tale
Observe that the answer is if and otherwise
Also note that and depend on and
dictates which previous delay or will get carried forward in which branch,
and give us the delay introduced by the -th mux itself
𝑐0 𝑐1 𝑐2 𝑐 63
𝑟0
𝑝0
𝑡 𝑢0
𝑟1
𝑝1
𝑡 𝑢1
𝑟2
𝑝2
…
𝑡 𝑢2
𝑟63
𝑝63
𝑡 𝑢63
𝑠0
𝑞0
𝑡 𝑙0 𝑠1
𝑞1
𝑡 𝑙1 𝑠2
𝑞2
𝑡
…𝑙
2
𝑠 63
𝑞63
𝑡 𝑙63
A Twist in the Tale
0
1 01
0
1 1
0
𝑐0 𝑐1
01 𝑐2 𝑐 63
𝑟0
𝑝0
𝑡 𝑢0
𝑟1
𝑝1
𝑡 𝑢1
𝑟2
𝑝2
…
𝑡 𝑢2
𝑟63
𝑝63
𝑡 𝑢63
𝑠0
𝑞0
𝑡 𝑙0 𝑠1
𝑞1
𝑡 𝑙1 𝑠2
𝑞2
𝑡
…𝑙
2
𝑠 63
𝑞63
𝑡 𝑙63
A little bit of Math
Let us use the shorthand to denote the lag
Recall: all that matters is whether the top signal reaches first or not
Thus, all that matters is whether or not
where and
We can safely take (absorb initial delays into )
We can keep going on recursively
(since )
– now plugin value of to get