Reliable Inversion in GF(28) With Redundant Arithmetic for Secure Error Detection of Cryptographic Architectures
Open Access
- 20 June 2017
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 37 (3) , 696-704
Abstract
In secure cryptographic primitives, such as block ciphers, the reliability of hardware implementations needs to be closely considered because faults in the hardware implementations can potentially reduce or impact on the underlying security. In this paper, we present approaches to detect errors in hardware implementations of the inversion in GF(2 8 ). The proposed approaches are based on both nonredundant and redundant arithmetic, utilizing normal basis (nonredundant) and two redundant Galois field representations, i.e., polynomial ring representation and redundantly represented basis through tower fields. To the best of our knowledge, this is the first work focusing on the error detection architectures for redundant arithmetic-based inversion in GF(2 8 ). The presented signature-based schemes in this paper are general and can be applied to block ciphers with 8-bit S-boxes, such as Camellia, SMS4, the advanced encryption standard, and CLEFIA. We present the results of error simulations and application-specific integrated circuit implementations to demonstrate the utility of the presented schemes. Based on the specific implementation's security/reliability objectives and the overhead/degradation tolerance for implementation/performance metrics, one can fine-tune and tailor the proposed work to achieve more reliable inversions in GF(2 8 ).Keywords
Funding Information
- National Institute of Standards and Technology through the U.S. Federal Agency (60NANB16D245)
This publication has 23 references indexed in Scilit:
- Highly Efficient $GF(2^8)$ G F ( 2 8 ) Inversion Circuit Based on Redundant GF Arithmetic and Its Application to AES Design2015
- A Biased Fault Attack on the Time Redundancy Countermeasure for AES2015
- Reliable and Error Detection Architectures of Pomaranch for False-Alarm-Sensitive Cryptographic ApplicationsIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2015
- Security analysis of concurrent error detection against differential fault analysisJournal of Cryptographic Engineering, 2014
- Mixed Bases for Efficient Inversion in ${{\mathbb F}{((2^2)^2)}{2}}$ and Conversion Matrices of SubBytes of AES2010
- A Reliable Architecture for Parallel Implementations of the Advanced Encryption StandardJournal of Electronic Testing, 2009
- A Very Compact S-Box for AES2005
- Fault-based side-channel cryptanalysis tolerant Rijndael symmetric block cipher architecture2002
- A Compact Rijndael Hardware Architecture with S-Box Optimization2001
- A fast algorithm for computing multiplicative inverses in GF(2m) using normal basesInformation and Computation, 1988