Concurrent error detection in GF(2m) multiplication and its application in elliptic curve cryptography

A novel approach to achieve concurrent error detection in finite-field multiplication over GF(2 m ) that uses multiple-bit interlaced parity codes is presented. These codes are implemented as a generic parity checker, which means they can be used with any multiplier architecture. Relative to the number of parity bits used, much improved delay and error-detection performance are achieved compared to previously reported results, yet for the examples considered the area overhead did not exceed 12%. The proposed work is particularly important for cryptography implementations employing GF(2 m ) multipliers and requiring reliability and protection against adversarial attacks that use fault induction.

[1]  Yiqi Dai,et al.  Fast Bit-Parallel GF(2^n) Multiplier for All Trinomials , 2005, IEEE Trans. Computers.

[2]  M. Anwar Hasan,et al.  Low complexity bit parallel architectures for polynomial basis multiplication over GF(2m) , 2004, IEEE Transactions on Computers.

[3]  M. Anwar Hasan,et al.  Error Detection in Polynomial Basis Multipliers over Binary Extension Fields , 2002, CHES.

[4]  M. Anwar Hasan,et al.  Fault Detection Architectures for Field Multiplication Using Polynomial Bases , 2006, IEEE Transactions on Computers.

[5]  M. Anwar Hasan,et al.  On Concurrent Detection of Errors in Polynomial Basis Multiplication , 2007, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[6]  David Naccache,et al.  The Sorcerer's Apprentice Guide to Fault Attacks , 2006, Proceedings of the IEEE.

[7]  Gadiel Seroussi,et al.  Table of low-weight binary irreducible polynomials , 1998 .

[8]  Jim-Min Lin,et al.  Concurrent Error Detection in a Bit-Parallel Systolic Multiplier for Dual Basis of GF(2m) , 2005, J. Electron. Test..

[9]  Jim-Min Lin,et al.  Concurrent Error Detection in Montgomery Multiplication over GF(2m) , 2006, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[10]  Michael Gössel,et al.  On-Line Error Detection for Bit-Serial Multipliers in GF(2m) , 1998, J. Electron. Test..

[11]  Bernd Meyer,et al.  Differential Fault Attacks on Elliptic Curve Cryptosystems , 2000, CRYPTO.

[12]  Marc Joye,et al.  Elliptic Curve Cryptosystems in the Presence of Permanent and Transient Faults , 2005, Des. Codes Cryptogr..

[13]  C. Chiou.  Concurrent error detection in array multipliers for GF(2/sup m/) fields , 2002 .

[14]  M. Anwar Hasan,et al.  Towards fault-tolerant cryptographic computations over finite fields , 2004, TECS.

[15]  M. Anwar Hasan,et al.  Concurrent error detection of polynomial basis multiplication over extension fields using a multiple-bit parity scheme , 2005, 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (DFT'05).

[16]  Sergei Skorobogatov,et al.  Semi-invasive attacks: a new approach to hardware security analysis , 2005 .

[17]  Jim-Min Lin,et al.  Concurrent Error Detection in a Polynomial Basis Multiplier over GF(2m) , 2006, J. Electron. Test..

[18]  Huapeng Wu,et al.  Bit-Parallel Finite Field Multiplier and Squarer Using Polynomial Basis , 2002, IEEE Trans. Computers.

[19]  Francisco Rodríguez-Henríquez,et al.  Parallel Multipliers Based on Special Irreducible Pentanomials , 2003, IEEE Trans. Computers.