Skip to main content

A Comprehensive Set of Schemes for PUF Response Generation

  • Conference paper
  • First Online:
Applied Reconfigurable Computing (ARC 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9625))

Included in the following conference series:

  • 1202 Accesses

Abstract

In this work we present a comprehensive set of schemes to generate Physical Unclonable Functions (PUF) responses. Software scripts have been developed to generate the PUF IDs using five different schemes. We also propose a new set of PUF metrics that are based on the Worst Case (WC) PUF performance. Values of these metrics, for the Ring Oscillator (RO) PUF and SR-Latch PUF, have been presented and analyzed in the paper.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Maiti, A., Schaumont, P.: Improved ring oscillator PUF: an FPGA friendly secure primitive. J. Cryptology 24(2), 375–397 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  2. Hori, Y., Yoshida, T., Katashita, T., Satoh, A.: Quantitative and statistical performance evaluation of arbiter physical unclonable functions on FPGAs. In: Proceedings of International Conference on Recongurable Computing and FPGAs (ReConFig) 2010, pp. 298–303 (2010)

    Google Scholar 

  3. Maes, R., Van Herrewege, A., Verbauwhede, I.: PUFKY: a fully functional PUF-based cryptographic key generator. In: Prouff, E., Schaumont, P. (eds.) CHES 2012. LNCS, vol. 7428, pp. 302–319. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  4. Maiti, A., Kim, I., Schaumont, P.: A robust physical unclonable function with en-hanced challenge-response set. IEEE Trans. Inf. Forensics Secur. 7(1), 333–345 (2012)

    Article  Google Scholar 

  5. Ganta, D., Nazhandali, L.: Easy-to-build arbiter physical unclonable function with enhanced challenge/response set. In: 14th International Symposium on Quality Electronic Design Proceedings of Quality Electronic Design (ISQED) (2013)

    Google Scholar 

  6. Maiti, A., Gunreddy, V., Schaumont, P.: A systematic method to evaluate and compare the performance of physical unclonable functions. In: Athanas, P., Pnevmatikatos, D., Sklavos, N. (eds.) Embedded Systems Design with FPGAs, pp. 245–267. Springer, New York (2013)

    Chapter  Google Scholar 

  7. http://rijndael.ece.vt.edu/puf/detailed.php

  8. Habib, B., Kaps, J.-P., Gaj, K.: Efficient SR-latch PUF. In: Sano, K., Soudris, D., Hübner, M., Diniz, P. (eds.) ARC 2015. LNCS, vol. 9040, pp. 205–216. Springer, Heidelberg (2015)

    Google Scholar 

  9. https://staff.aist.go.jp/hori.y/en/puf/index.html

  10. https://cryptography.gmu.edu/puf

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bilal Habib .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Habib, B., Gaj, K. (2016). A Comprehensive Set of Schemes for PUF Response Generation. In: Bonato, V., Bouganis, C., Gorgon, M. (eds) Applied Reconfigurable Computing. ARC 2016. Lecture Notes in Computer Science(), vol 9625. Springer, Cham. https://doi.org/10.1007/978-3-319-30481-6_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-30481-6_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-30480-9

  • Online ISBN: 978-3-319-30481-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics