ACM Home Page
Please provide us with feedback. Feedback
Physical unclonable function and true random number generator: a compact and scalable implementation
Full text PdfPdf (558 KB)
Source
Great Lakes Symposium on VLSI archive
Proceedings of the 19th ACM Great Lakes symposium on VLSI table of contents
Boston Area, MA, USA
POSTER SESSION: Poster session 2 table of contents
Pages 425-428  
Year of Publication: 2009
ISBN:978-1-60558-522-2
Authors
Abhranil Maiti  Virginia Tech, Blacksburg, VA, USA
Raghunandan Nagesh  Virginia Tech, Blacksburg, VA, USA
Anand Reddy  Virginia Tech, Blacksburg, VA, USA
Patrick Schaumont  Virginia Tech, Blacksburg, VA, USA
Sponsors
ACM: Association for Computing Machinery
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 23,   Downloads (12 Months): 76,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1531542.1531639
What is a DOI?

ABSTRACT

Physical Unclonable Functions (PUF) and True Random Number Generators (TRNG) are two very useful components in secure system design. PUFs can be used to extract chip-unique signatures and volatile secret keys, whereas TRNGs are used for generating random padding bits, initialization vectors and nonces in cryptographic protocols.

This paper proposes a scalable design technique to implement both a delay-based PUF and a jitter-based TRNG using ring oscillators. By sharing and reusing a significant amount of hardware resources, we achieve nearly 50% area reduction as compared to discrete implementations. We also propose and demonstrate a co-processor-based design that renders the circuit portable across various embedded processor platforms on FPGAs. Multiple scaled designs using 32 to 128 ring oscillators have been implemented and verified on Xilinx Spartan3S500E FPGA. A representative design uses 32 3-inverter ring oscillators, 64 flip-flops/latches, 31 2-input XOR gates and control circuitry giving a 3.2Mbps truly random stream and 31-bit unique device signature.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
J. Guajardo, S. S. Kumar, G.-J. Schrijen and P. Tuyls. Physical unclonable functions and public-key crypto for FPGA IP protection. In Proceedings of the International Conference on Field Programmable Logic and Applications, August 2007.
 
3
 
4
 
5
 
6
 
7
D. Schellekens, B. Preneel, and I. Verbauwhede. FPGA Vendor Agnostic True Random Number Generator International Conference on Field Programmable Logic and Applications, FPL'06. pages 1--6, August 2006.
 
8
Sang-Kyung Yoo, Berk Sunar, Deniz Karakoyunlu, Berk Birand. A Robust and Practical Random Number Generator, under review. Pre-print
 
9
G. Marsaglia. DieHard: A Battery of Tests of Randomness, http://stat.fsu.edu/_geo,1996.
 
10
NIST Special Publication 800-22 A Statistical Test Suite for Random and Pseudorandom Numbers, 2000.

Collaborative Colleagues:
Abhranil Maiti: colleagues
Raghunandan Nagesh: colleagues
Anand Reddy: colleagues
Patrick Schaumont: colleagues