Title：Optimizing Physical Unclonable Function's Secret Extraction
Speaker：Gang Qu，Associate Professor，Department of Electrical and Computer Engineering，University of Maryland，U.S
Time： 2010-07-21 9：O0am
Place： 10-103，East Main Building
Organizer：EDA Lab，Department Computer Science and Technology
The silicon physica1 unclonable Functions(PUF) measure uncontrollable varialions of the integrated circuit fabrication process to facilitate chip authentication and other security related applications, One of the most popular silicon PUF structure is the ring oscillator(RO)PUF；however，the lack of reliable and efficient secret extraction schemes causes very high hardware implementation cost, diminishing its practicality.
In this talk, we first propose a temperature-aware cooperative approach to enhance the hardware utilization. The basic idea is to accept the unreliable bits generated by the ring oscillators as long as we can find means to convert them to reliable bits. Then we report a longest increasing subsequence-based grouping algorithm to maximize the secrecy Extraction power of RO PUF. We also introduce a hybrid architecture for RO PUF and study its hardware cost and delay. Finally, we present the results that validate our claims by a proof-of-the-concept FPGA-based implementation.
Gang Qu received the B. S. and M. S. in Mathematics from the University of Science and Technology of China, and Ph. D. in Computer Science from the Universily of California, Los Angeles. He joined the Department of Electrical and Computer Engineering in the University of Maryland at College Park in 2000, where he is currently an Associate Professor. His current research interests include low power system design, wireless sensor network, security and trusted system design，intelletual property reuse and protection. He has published more than 100 journal and conference papers in these areas and won 2 best paper awards. He has served the technical program committee for numerous conferences and is an active reviewer for many scientific journals.