Linear cryptanalysis method for DES cipher
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Silicon physical random functions
Proceedings of the 9th ACM conference on Computer and communications security
Reusable cryptographic fuzzy extractors
Proceedings of the 11th ACM conference on Computer and communications security
Security with Noisy Data: Private Biometrics, Secure Key Storage and Anti-Counterfeiting
Security with Noisy Data: Private Biometrics, Secure Key Storage and Anti-Counterfeiting
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
SIAM Journal on Computing
FPGA Intrinsic PUFs and Their Use for IP Protection
CHES '07 Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems
Efficient Helper Data Key Extractor on FPGAs
CHES '08 Proceeding sof the 10th international workshop on Cryptographic Hardware and Embedded Systems
Extended abstract: The butterfly PUF protecting IP on every FPGA
HST '08 Proceedings of the 2008 IEEE International Workshop on Hardware-Oriented Security and Trust
Power-Up SRAM State as an Identifying Fingerprint and Source of True Random Numbers
IEEE Transactions on Computers
New shielding functions to enhance privacy and prevent misuse of biometric templates
AVBPA'03 Proceedings of the 4th international conference on Audio- and video-based biometric person authentication
Context weighting for general finite-context sources
IEEE Transactions on Information Theory
The context-tree weighting method: extensions
IEEE Transactions on Information Theory
The context-tree weighting method: basic properties
IEEE Transactions on Information Theory
Physically unclonable functions: manufacturing variability as an unclonable device identifier
Proceedings of the 21st edition of the great lakes symposium on Great lakes symposium on VLSI
A practical device authentication scheme using SRAM PUFs
TRUST'11 Proceedings of the 4th international conference on Trust and trustworthy computing
Recyclable PUFs: logically reconfigurable PUFs
CHES'11 Proceedings of the 13th international conference on Cryptographic hardware and embedded systems
Comparison of SRAM and FF PUF in 65nm technology
NordSec'11 Proceedings of the 16th Nordic conference on Information Security Technology for Applications
Converse PUF-Based authentication
TRUST'12 Proceedings of the 5th international conference on Trust and Trustworthy Computing
PUF-enhanced offline RFID security and privacy
Journal of Network and Computer Applications
CHES'12 Proceedings of the 14th international conference on Cryptographic Hardware and Embedded Systems
Anti-counterfeiting with hardware intrinsic security
Proceedings of the Conference on Design, Automation and Test in Europe
Comparative analysis of SRAM memories used as PUF primitives
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
Bias-based modeling and entropy analysis of PUFs
Proceedings of the 3rd international workshop on Trustworthy embedded devices
An accurate probabilistic reliability model for silicon PUFs
CHES'13 Proceedings of the 15th international conference on Cryptographic Hardware and Embedded Systems
On the effectiveness of the remanence decay side-channel to clone memory-based PUFs
CHES'13 Proceedings of the 15th international conference on Cryptographic Hardware and Embedded Systems
| Hi-index | 0.00 |
In this paper we describe the results of our investigations Supported by EU FP7 project UNIQUE on the randomness and reliability of D flip-flops when used as a Physically Unclonable Function (PUF). These D flip-flops are hardware components which present a random start-up value when powered up. We show that against all odds, enough randomness exists in such elements when implemented on an Application-Specific Integrated Circuit (ASIC) to turn the responses of a number of D flip-flops into a secret random sequence allowing to derive keys for use in conjunction with cryptographic algorithms. In addition to being unpredictable, these flip-flops have the advantage that they can be spread over random locations in an ASIC. This makes them very difficult to reverse-engineer when used to hide a secret key in a design at a relatively small cost in resources.