Title

Efficient and Concurrent Reliable Realization of the Secure Cryptographic SHA-3 Algorithm

Document Type

Article

Publication Date

7-2014

Keywords

application-specific integrated circuit (ASIC), high performance, reliability, secure hash algorithm (SHA)-3, security

Digital Object Identifier (DOI)

https://doi.org/10.1109/TCAD.2014.2307002

Abstract

The secure hash algorithm (SHA)-3 has been selected in 2012 and will be used to provide security to any application which requires hashing, pseudo-random number generation, and integrity checking. This algorithm has been selected based on various benchmarks such as security, performance, and complexity. In this paper, in order to provide reliable architectures for this algorithm, an efficient concurrent error detection scheme for the selected SHA-3 algorithm, i.e., Keccak, is proposed. To the best of our knowledge, effective countermeasures for potential reliability issues in the hardware implementations of this algorithm have not been presented to date. In proposing the error detection approach, our aim is to have acceptable complexity and performance overheads while maintaining high error coverage. In this regard, we present a low-complexity recomputing with rotated operands-based scheme which is a step-forward toward reducing the hardware overhead of the proposed error detection approach. Moreover, we perform injection-based fault simulations and show that the error coverage of close to 100% is derived. Furthermore, we have designed the proposed scheme and through ASIC analysis, it is shown that acceptable complexity and performance overheads are reached. By utilizing the proposed high-performance concurrent error detection scheme, more reliable and robust hardware implementations for the newly-standardized SHA-3 are realized.

Was this content written or created while at USF?

Yes

Citation / Publisher Attribution

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, v. 33, issue 7, p. 1105-1109