An SHA-3 Hardware Architecture against Failures Based on Hamming Codes and Triple Modular Redundancy

• Main Authors: Algredo-Badillo, I. (Author), Lobato-Báez, M. (Author), López-Huerta, F. (Author), López-Pimentel, J.C (Author), Morales-Rosales, L.A (Author), Torres-Alvarado, A. (Author)
• Format: Article
• Language: English
• Published: MDPI 2022
• Subjects: Block codes; Comparative analyzes; Errors; fault tolerance; Fault tolerance; Field programmable gate arrays (FPGA); FPGA architectures; Hamming code; Hardware architecture; Hardware implementations; Hash functions; Internet of things; Internet of things industries; security; Security; SHA-3; Triple modular redundancy; VANET
• Online Access: View Fulltext in Publisher

 Cryptography has become one of the vital disciplines for information technology such as IoT (Internet Of Things), IIoT (Industrial Internet Of Things), I4.0 (Industry 4.0), and automotive applications. Some fundamental characteristics required for these applications are confidentiality, authentication, integrity, and nonrepudiation, which can be achieved using hash functions. A cryptographic hash function that provides a higher level of security is SHA-3. However, in real and modern applications, hardware implementations based on FPGA for hash functions are prone to errors due to noise and radiation since a change in the state of a bit can trigger a completely different hash output than the expected one, due to the avalanche effect or diffusion, meaning that modifying a single bit changes most of the desired bits of the hash; thus, it is vital to detect and correct any error during the algorithm execution. Current hardware solutions mainly seek to detect errors but not correct them (e.g., using parity checking or scrambling). To the best of our knowledge, there are no solutions that detect and correct errors for SHA-3 hardware implementations. This article presents the design and a comparative analysis of four FPGA architectures: two without fault tolerance and two with fault tolerance, which employ Hamming Codes to detect and correct faults for SHA-3 using an Encoder and a Decoder at the step-mapping functions level. Results show that the two hardware architectures with fault tolerance can detect up to a maximum of 120 and 240 errors, respectively, for every run of KECCAK-p, which is considered the worst case. Additionally, the paper provides a comparative analysis of these architectures with other works in the literature in terms of experimental results such as frequency, resources, throughput, and efficiency. © 2022 by the authors. Licensee MDPI, Basel, Switzerland.