Name
Abstract | ||
|---|---|---|
PUF-PRFs are Pseudorandom Functions (PRFs) constructed using Physically Unclonable Functions (PUFs) as a hardware building block to provide the random input-output mapping. Since PUF-PRFs inherit all the principal properties of PUFs such as memory-leakage resilience, unclonablity, tampering-resistance, pseudo-randomness, and provable security, PUF-PRFs hold great promise as an extremely useful cryptographic hardware primitive. In this paper, we evaluate the security of PUF-PRFs against Side Channel Attacks. Two different attacks based on analysis of power side channel are developed, and demonstrated through the experiments on Xilinx FPGAs. In addition, we reduce the complexity of Correlation Power Analysis (CPA) to recover n-bit secret, from O(2 2n) to O(3n 2n). Based on our experimental results, we conclude that the security of PUF-PRFs, when subjected to side channel attacks, depends on not only the security of the used PUFs, but also the PUF-PRF architecture. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/DSD.2017.79 | 2017 Euromicro Conference on Digital System Design (DSD) |
Keywords | Field | DocType |
Cryptographic hardware primitive,Field Programmable Gate Array (FPGA),Physically Unclonable Function (PUF),Pseudorandom Function,Side Channel Attack | Correlation power analysis,Computer security,Computer science,Parallel computing,Field-programmable gate array,Side channel attack,Physical unclonable function,Cryptographic hardware,Pseudorandom permutation,Computer engineering,Provable security,Pseudorandom number generator | Conference |
ISBN | Citations | PageRank |
978-1-5386-2147-9 | 0 | 0.34 |
References | Authors | |
14 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Durga Prasad Sahoo | 1 | 52 | 8.39 |
| Phuong Ha Nguyen | 2 | 84 | 12.41 |
| Debapriya Basu Roy | 3 | 57 | 15.68 |
| Debdeep Mukhopadhyay | 4 | 921 | 123.07 |
| Rajat Subhra Chakraborty | 5 | 1029 | 81.56 |