A Low-Complexity Multiple Error Correcting Architecture Using Novel Cross Parity Codes Over GF $(2^{m})$

This paper presents a novel low-complexity cross parity code, with a wide range of multiple bit error correction capability at a lower overhead, for improving the reliability in circuits over GF(2m). For an m input circuit, the proposed scheme can correct m ≤ Dw ≤ 3m/2 -1 multiple error combinations out of all the possible 2m - 1 errors, which is superior to many existing approaches. From the mathematical and practical evaluations, the best case error correction is m/2 bit errors. Tests on 80-bit parallel and, for the first time, on 163-bit Federal Information Processing Standard/National Institute of Standards and Technology (FIPS/NIST) standard word-level Galois field (GF) multipliers, suggest that it requires only 106% and 170% area overheads, respectively, which is lower than the existing approaches, while error injection-based behavioral analysis demonstrates its wider error correction capability.

[1]  Cecilia Metra,et al.  Function-Inherent Code Checking: A New Low Cost On-Line Testing Approach for High Performance Microprocessor Control Logic , 2008, 2008 13th European Test Symposium.

[2]  Marcelo Lubaszewski,et al.  A cryptography core tolerant to DFA fault attacks , 2006, SBCCI '06.

[3]  Christof Paar,et al.  Optimum Digit Serial GF(2^m) Multipliers for Curve-Based Cryptography , 2006, IEEE Transactions on Computers.

[4]  Salvatore Pontarelli,et al.  On the use of Karatsuba formula to detect errors in GF((2(sup)n(/sup))(sup)2(/sup)) multipliers , 2012, IET Circuits Devices Syst..

[5]  Jimson Mathew,et al.  Low complexity cross parity codes for multiple and random bit error correction , 2012, Thirteenth International Symposium on Quality Electronic Design (ISQED).

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

[7]  Ingrid Verbauwhede,et al.  A Hybrid Scheme for Concurrent Error Detection of Multiplication over Finite Fields , 2010, 2010 IEEE 25th International Symposium on Defect and Fault Tolerance in VLSI Systems.

[8]  Dhiraj K. Pradhan,et al.  Fault tolerant bit parallel finite field multipliers using LDPC codes , 2008, 2008 IEEE International Symposium on Circuits and Systems.

[9]  Chin-Chen Chang,et al.  Concurrent Error Detection and Correction in Gaussian Normal Basis Multiplier over GF(2^m) , 2009, IEEE Transactions on Computers.

[10]  Heinrich Theodor Vierhaus,et al.  On-line error detection and correction in storage elements with cross-parity check , 2002, Proceedings of the Eighth IEEE International On-Line Testing Workshop (IOLTW 2002).

[11]  Dhiraj K. Pradhan,et al.  BCH code based multiple bit error correction in finite field multiplier circuits , 2011, 2011 12th International Symposium on Quality Electronic Design.

[12]  Chiou-Yng Lee.  Error-Correcting Codes for Concurrent Error Correction in Bit-Parallel Systolic and Scalable Multipliers for Shifted Dual Basis of GF(2^m) , 2010, International Symposium on Parallel and Distributed Processing with Applications.

[13]  Michael Gössel,et al.  A new method for correcting time and soft errors in combinational circuits , 2013, 2013 IEEE 16th International Symposium on Design and Diagnostics of Electronic Circuits & Systems (DDECS).

[14]  Richard J. Lipton,et al.  On the Importance of Eliminating Errors in Cryptographic Computations , 2015, Journal of Cryptology.

[15]  J.F. Wakerly.  Microcomputer reliability improvement using triple-modular redundancy , 1976, Proceedings of the IEEE.

[16]  N Alves.  State-of-the-Art Techniques for Detecting Transient Errors in Electrical Circuits , 2011, IEEE Potentials.

[17]  Ramesh Karri,et al.  Low cost concurrent error detection for the advanced encryption standard , 2004 .

[18]  Dhiraj K. Pradhan,et al.  Single error correctable bit parallel multipliers over GF(2m) , 2009, IET Comput. Digit. Tech..

[19]  Chih-Hsiang Chang,et al.  Concurrent error detection and correction in a polynomial basis multiplier over GF(2m) , 2010, IET Inf. Secur..