Skip to main content
Springer Nature Link
Log in

SIMPL Systems as a Keyless Cryptographic and Security Primitive

  • Chapter
Cryptography and Security: From Theory to Applications

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 6805))

Abstract

We discuss a recent cryptographic primitive termed SIMPL system, where the acronym stands for SIMulation Possible, but Laborious. Like Physical Unclonable Functions (PUFs), SIMPL systems are disordered, unclonable physical systems with many possible inputs and a complex input-output behavior. Contrary to PUFs, however, each SIMPL system comes with a publicly known, individual numeric description that allows its slow simulation and output prediction. While everyone can determine a SIMPL system’s output slowly by simulation, only its actual holder can determine the output fast by physical measurement. This added functionality allows new public key like protocols and applications.

But SIMPLs have a second, perhaps more striking advantage: No secret information is, or needs to be, contained in SIMPL systems in order to enable cryptographic security. Neither in the form of a standard digital key, nor as secret information hidden in the random, analog features of some hardware, as it is the case for PUFs. The security of SIMPL systems instead rests on (i) an assumption regarding their physical unclonability, and (ii) a computational assumption on the complexity of simulating their output. This provides SIMPL systems with a natural immunity against any key extraction attacks, including malware, side channel, invasive, and modeling attempts.

In this manuscript, we give a comprehensive discussion of SIMPLs as a cryptographic and security primitive. Special emphasis is placed on the different cryptographic protocols that are enabled by this new tool.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. http://www.cbsnews.com/stories/2010/02/15/business/main6209772.shtml

  2. http://www.bbc.co.uk/news/10569081

  3. http://www.eurosmart.com/images/doc/Eurosmart-in-the-press/2006/cardtechnologytoday_dec2006.pdf

  4. http://www.gsaietsemiconductorforum.com/2010/delegate/documents/GASSELGSALondon20100518presented.pdf. (Slide 23)

  5. Eisenbarth, T., Kasper, T., Moradi, A., Paar, C., Salmasizadeh, M., Manzuri Shalmani, M.T.: On the power of power analysis in the real world: A complete break of the keeLoq code hopping scheme. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 203–220. Springer, Heidelberg (2008)

    Google Scholar 

  6. Kasper, T., Silbermann, M., Paar, C.: All you can eat or breaking a real-world contactless payment system. In: Sion, R. (ed.) FC 2010. LNCS, vol. 6052, pp. 343–350. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  7. Anderson, R.J.: Security Engineering: A Guide to Building Dependable Distributed Systems, 2nd edn. Wiley, Chichester (2008) ISBN: 978-0-470-06852-6

    Google Scholar 

  8. Pappu, R., Recht, B., Taylor, J., Gershenfeld, N.: Physical One-Way Functions. Science 297, 2026–2030 (2002)

    Article  Google Scholar 

  9. Pappu, R.: Physical One-Way Functions, PhD Thesis, MIT

    Google Scholar 

  10. Gassend, B., Clarke, D.E., van Dijk, M., Devadas, S.: Silicon physical random functions. In: ACM Conference on Computer and Communications Security 2002, pp. 148–160 (2002)

    Google Scholar 

  11. Gassend, B., Lim, D., Clarke, D., van Dijk, M., Devadas, S.: Identification and authentication of integrated circuits. Concurrency and Computation: Practice & Experience 16(11), 1077–1098 (2004)

    Article  Google Scholar 

  12. Tuyls, P., Skoric, B.: Strong Authentication with Physical Unclonable Functions. In: Petkovic, M., Jonker, W. (eds.) Security, Privacy and Trust in Modern Data Management. Springer, Heidelberg (2007)

    Google Scholar 

  13. Edward Suh, G., Devadas, S.: Physical Unclonable Functions for Device Authentication and Secret Key Generation. In: DAC 2007, pp. 9–14 (2007)

    Google Scholar 

  14. Gassend, B., van Dijk, M., Clarke, D.E., Torlak, E., Tuyls, P., Devadas, S.: Controlled physical random functions and applications. ACM Trans. Inf. Syst. Secur. 10(4) (2008)

    Google Scholar 

  15. Rührmair, U.: Oblivious Transfer Based on Physical Unclonable Functions. In: Acquisti, A., Smith, S.W., Sadeghi, A.-R. (eds.) TRUST 2010. LNCS, vol. 6101, pp. 430–440. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  16. Rührmair, U.: SIMPL Systems: On a Public Key Variant of Physical Unclonable Functions. Cryptology ePrint Archive, Report 2009/255 (2009)

    Google Scholar 

  17. Rührmair, U., Chen, Q., Lugli, P., Schlichtmann, U., Stutzmann, M., Csaba, G.: Towards Electrical, Integrated Implementations of SIMPL Systems. Cryptology ePrint Archive, Report 2009/278 (2009)

    Google Scholar 

  18. Chen, Q., Csaba, G., Ju, X., Natarajan, S.B., Lugli, P., Stutzmann, M., Schlichtmann, U., Rührmair, U.: Analog Circuits for Physical Cryptography. In: 12th International Symposium on Integrated Circuits (ISIC 2009), Singapore, December 14-16 (2009)

    Google Scholar 

  19. Rührmair, U., Chen, Q., Stutzmann, M., Lugli, P., Schlichtmann, U., Csaba, G.: Towards electrical, integrated implementations of SIMPL systems. In: Samarati, P., Tunstall, M., Posegga, J., Markantonakis, K., Sauveron, D. (eds.) WISTP 2010. LNCS, vol. 6033, pp. 277–292. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  20. Rührmair, U.: SIMPL systems, or: Can we design cryptographic hardware without secret key information? In: Černá, I., Gyimóthy, T., Hromkovič, J., Jefferey, K., Králović, R., Vukolić, M., Wolf, S. (eds.) SOFSEM 2011. LNCS, vol. 6543, pp. 26–45. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  21. Chen, Q., Csaba, G., Lugli, P., Schlichtmann, U., Stutzmann, M., Rührmair, U.: Circuit-based approaches to SIMPL systems. Journal of Circuits, Systems, and Computers, JCSC 20, 107–123 (2011), doi:10.1142/S0218126611007098

    Article  Google Scholar 

  22. Chua, L.O., Roska, T., Kozek, T., Zarandy, A.: CNN Universal Chips crank up the computing power. IEEE Circuits and Devices Magazine 12(4), 18–28 (1996)

    Article  Google Scholar 

  23. Roska, T.: Cellular Wave Computers for Nano-Tera-Scale Technology — beyond spatial-temporal logic in million processor devices. Electronics Letters 43(8) (April 12, 2007)

    Google Scholar 

  24. Beckmann, N., Potkonjak, M.: Hardware-based public-key cryptography with public physically unclonable functions. In: Katzenbeisser, S., Sadeghi, A.-R. (eds.) IH 2009. LNCS, vol. 5806, pp. 206–220. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  25. Koushanfar, F., Potkonjak, M.: CAD-based Security, Cryptography, and Digital Rights Management. In: DAC 2007, pp. 268–269 (2007)

    Google Scholar 

  26. Majzoobi, M., Elnably, A., Koushanfar, F.: FPGA Time-Bounded Unclonable Authentication. In: Böhme, R., Fong, P.W.L., Safavi-Naini, R. (eds.) IH 2010. LNCS, vol. 6387, pp. 1–16. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  27. Rührmair, U., Sölter, J., Sehnke, F.: On the Foundations of Physical Unclonable Functions. IACR Cryptology E-print Archive, Report No. 227/2009 (2009)

    Google Scholar 

  28. Rührmair, U., Busch, H., Katzenbeisser, S.: Strong PUFs: Models, Constructions and Security Proofs. In: Sadeghi, A.-R., Naccache, D. (eds.) Towards Hardware Intrinsic Security: Foundation and Practice. Springer, Heidelberg (2010)

    Google Scholar 

  29. Gassend, B.: Physical Random Functions, MSc Thesis, MIT (2003)

    Google Scholar 

  30. Guajardo, J., Kumar, S.S., Schrijen, G.-J., Tuyls, P.: FPGA Intrinsic PUFs and Their Use for IP Protection. In: Paillier, P., Verbauwhede, I. (eds.) CHES 2007. LNCS, vol. 4727, pp. 63–80. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  31. Rührmair, U., Sehnke, F., Sölter, J., Dror, G., Devadas, S., Schmidhuber, J.: Modeling Attacks on Physical Unclonable Functions. In: 17th ACM Conference on Computer and Communications Security (2010); Previous versions available from Cryptology ePrint Archive, Report 251/2010

    Google Scholar 

  32. Feynman, R.P.: Simulating physics with computers. International Journal of Theoretical Physics (1982)

    Google Scholar 

  33. Naccache, D., Raihi David, M.: Procede de Generation de Signature Numeriques de Messages. French Patent, Publication Number 2733378, National Registration Number 9504753 (1995)

    Google Scholar 

  34. Naccache, D.: Method for the Generation of Electronic Signatures, in particular for Smart Cards. US Patent Number 5,910,989 (1999)

    Google Scholar 

  35. Blum, M.: Coin flipping by telephone. In: Proc. IEEE Spring COMPCOM, pp. 133–137. IEEE, Los Alamitos (1982)

    Google Scholar 

  36. Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proceedings of The Nineteenth Annual ACM Symposium on Theory of Computing (1987)

    Google Scholar 

  37. Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity and a methodology of cryptographic protocol design. In: 27th Annual Symposium on the Foundations of Computer Science, FOCS (1986)

    Google Scholar 

  38. Halevi, S., Krawczyk, H.: MMH: Software Message Authentication in the Gbit/Second Rates. In: Biham, E. (ed.) FSE 1997. LNCS, vol. 1267, pp. 172–189. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  39. DeJean, G., Kirovski, D.: RF-DNA: Radio-Frequency Certificates of Authenticity. In: Paillier, P., Verbauwhede, I. (eds.) CHES 2007. LNCS, vol. 4727, pp. 346–363. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  40. Kariakin, Y.: Authentication of Articles. Patent Writing, WO/1997/024699 (1995), available from http://www.wipo.int/pctdb/en/wo.jsp?wo=1997024699

  41. Vijaywargi, D., Lewis, D., Kirovski, D.: Optical DNA. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol. 5628, pp. 222–229. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  42. Hammouri, G., Dana, A., Sunar, B.: CDs Have Fingerprints Too. In: Clavier, C., Gaj, K. (eds.) CHES 2009. LNCS, vol. 5747, pp. 348–362. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  43. Diffie, W., Hellman, M.E.: New Directions in Cryptography. IEEE Transactions on Information Theory IT-22, 644–654 (1976)

    Google Scholar 

  44. Naor, M., Ostrovsky, R., Venkatesan, R., Yung, M.: Perfect zero-knowledge arguments for NP using any one-way function. Journal of Cryptology 11(2), 87–108 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  45. Savvides, G.: Interactive Hashing and reductions between Oblivious Transfer variants. PhD thesis, McGill University, Montreal (2007)

    Google Scholar 

  46. Haitner, I., Reingold, O.: A new interactive hashing theorem. In: IEEE Conference on Computational Complexity (2007)

    Google Scholar 

  47. Blum, M.: Coin flipping by telephone. In: Gersho, A. (ed.) Advances in Cryptography, pp. 11–15. University of California, Santa Barbara (1982)

    Google Scholar 

  48. Goldreich, O.: The Foundations of Cryptography, vol. 1. Cambridge University Press, Cambridge (2001)

    Book  Google Scholar 

  49. Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the Association for Computing Machinery 38(3), 691–729 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  50. Brassard, G., Chaum, D., Crepeau, C.: Minimum disclosure proofs of knowledge. JCSS 37, 156–189 (1988)

    MathSciNet  MATH  Google Scholar 

  51. Kilian, J.: Founding cryptography on oblivious transfer. In: Proc. 20th ACM Symposium on Theory of Computing, pp. 20–31. ACM Press, Chicago (1988)

    Google Scholar 

  52. Yao, A.C.-C.: Classical physics and the Church-Turing Thesis. Journal of the ACM 50(1), 100–105 (2003)

    Article  MathSciNet  Google Scholar 

  53. Aaronson, S.: NP-complete Problems and Physical Reality. In: Electronic Colloquium on Computational Complexity (ECCC), vol. 026 (2005)

    Google Scholar 

  54. Shor, P.W.: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM J. Comput. 26(5), 1484–1509 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  55. Csaba, G., Ju, X., Ma, Z., Chen, Q., Porod, W., Schmidhuber, J., Schlichtmann, U., Lugli, P., Rührmair, U.: Application of Mismatched Cellular Nonlinear Networks for Physical Cryptography. In: IEEE CNNA (2010)

    Google Scholar 

  56. Lim, D.: Extracting Secret Keys from Integrated Circuits. M.Sc. Thesis, MIT (2004)

    Google Scholar 

  57. Suh, G.E., O’Donnell, C.W., Sachdev, I., Devadas, S.: Design and Implementation of the AEGIS Single-Chip Secure Processor Using Physical Random Functions. In: Proc. 32nd ISCA, New York (2005)

    Google Scholar 

  58. Yu, M. D.M., Devadas, S.: Secure and Robust Error Correction for Physical Unclonable Functions. IEEE Design & Test of Computers 27(1), 48–65 (2010)

    Article  Google Scholar 

  59. Armknecht, F., Maes, R., Sadeghi, A.-R., Sunar, B., Tuyls, P.: Memory Leakage-Resilient Encryption Based on Physically Unclonable Functions. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 685–702. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  60. Rührmair, U., Weiershäuser, A., Urban, S., Hilgers, C., Finley, J.: Secure Integrated Optical Physical Unclonable Functions (2010) (in preparation)

    Google Scholar 

  61. Lipson, S.G.: Optical Physics, 3rd edn. Cambridge University Press, Cambridge (1995) ISBN 0-5214-3631-1

    MATH  Google Scholar 

  62. Demtröder, W.: Experimentalphysik 2: Elektrizität und Optik. Springer, Heidelberg (2004) ISBN-10: 3540202102

    Google Scholar 

  63. Zhou, D., Mawst, L.J.: Two-dimensional phase-locked antiguided vertical-cavity surface-emitting laser arrays. Applied Physics Letters (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department for Electrical Engineering and Information Technology, TU München, Germany

    Ulrich Rührmair

  2. Fraunhofer Institute for Secure Information Technology, Munich, Germany

    Ulrich Rührmair

Authors
  1. Ulrich Rührmair
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Département d’informatique, École normale supérieure, 45 Rue d’Ulm, 75231, Paris Cedex 05, France

    David Naccache

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Rührmair, U. (2012). SIMPL Systems as a Keyless Cryptographic and Security Primitive. In: Naccache, D. (eds) Cryptography and Security: From Theory to Applications. Lecture Notes in Computer Science, vol 6805. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28368-0_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28368-0_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28367-3

  • Online ISBN: 978-3-642-28368-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation