Construction of Software-Based Digital Physical Clone Resistant Functions

Due to the emerging sophisticated physical attacks on security systems, secure authentication of electronic devices becomes more difficult to attain. Recent research showed alarming vulnerabilities in existing cryptographic systems through side channel and (semi)-invasive attacks. The main challenging problem is the break one break all phenomena. As if one successful attack is found, then it may be deployed automatically on any units incorporating similar implementations. Physical Unclonable Functions (PUFs) were introduced as promising solutions to provide resilient device authentication. However, recent research on PUFs showed that PUFs exhibit several implementation complexity, inconsistency and security drawbacks for long-term use. PUF structures, especially for existing microcontroller low-cost applications showed serious drawbacks and cloning vulnerabilities. The objective of this work is to propose a digital PUF alternative by pure software entities with robustness to side channel attacks. The resulting implementation size is comparable to lightweight cryptographic algorithms. The key implementation idea is based on self-creation of secret unknown cryptographic functions. As the implementation is pure digital, no inconsistency compared to that of conventional PUFs is possible and the resulting system would exhibit a long-term resilient consistency. Due to their pure software implementation the cost per unit may reach zero which is quite attractive for practical cloning-protection in many massproduct applications.

[1]  Stefan Katzenbeisser,et al.  Recyclable PUFs: Logically Reconfigurable PUFs , 2011, CHES.

[2]  Stephen A. Benton,et al.  Physical one-way functions , 2001 .

[3]  Wael Adi,et al.  Deploying FPGA self-configurable cell structure for micro crypto-functions , 2009, 2009 IEEE Symposium on Computers and Communications.

[4]  Bruce Schneier,et al.  Unbalanced Feistel Networks and Block Cipher Design , 1996, FSE.

[5]  Marc F. Witteman,et al.  Reverse Engineering Java Card Applets Using Power Analysis , 2007, WISTP.

[6]  Christophe Clavier.  An Improved SCARE Cryptanalysis Against a Secret A3/A8 GSM Algorithm , 2007, ICISS.

[7]  Roman Novak,et al.  Side-Channel Based Reverse Engineering of Secret Algorithms , 2003 .

[8]  Benoit Feix,et al.  Power Analysis for Secret Recovering and Reverse Engineering of Public Key Algorithms , 2007, Selected Areas in Cryptography.

[9]  Denis Réal,et al.  Defeating Any Secret Cryptography with SCARE Attacks , 2010, LATINCRYPT.

[10]  Boris Skoric,et al.  Read-Proof Hardware from Protective Coatings , 2006, CHES.

[11]  Wael Adi,et al.  Combined HW-SW adaptive clone-resistant functions as physical security anchors , 2013, 2013 NASA/ESA Conference on Adaptive Hardware and Systems (AHS-2013).

[12]  Jacques Patarin.  Luby-rackoff: 7 rounds are enough for 2n(1-ε) security , 2003 .

[13]  Frédéric Valette,et al.  SCARE of the DES , 2005, ACNS.

[14]  Srinivas Devadas,et al.  Silicon physical random functions , 2002, CCS '02.

[15]  Jorge Guajardo,et al.  FPGA Intrinsic PUFs and Their Use for IP Protection , 2007, CHES.

[16]  Jacques Patarin,et al.  Luby-Rackoff: 7 Rounds Are Enough for 2n(1-epsilon)Security , 2003, CRYPTO.

[17]  G. Edward Suh,et al.  Extracting secret keys from integrated circuits , 2005, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[18]  Jean-Jacques Quisquater,et al.  Automatic Code Recognition for Smartcards Using a Kohonen Neural Network , 2002, CARDIS.

[19]  Christof Paar,et al.  Building a Side Channel Based Disassembler , 2010, Trans. Comput. Sci..

[20]  Markku-Juhani O. Saarinen.  Cryptographic Analysis of All 4 x 4 - Bit S-Boxes , 2011, IACR Cryptol. ePrint Arch..

[21]  Blaise L. P. Gassend,et al.  Physical random functions , 2003 .

[22]  Kyoji Shibutani,et al.  Generalized Feistel networks revisited , 2012, Designs, Codes and Cryptography.

[23]  Zheng Gong,et al.  On the Security of 4-Bit Involutive S-Boxes for Lightweight Designs , 2011, ISPEC.