Authors:
Harris E. Michail
1
;
George S. Athanasiou
2
;
Andreas Gregoriades
3
;
George Theodoridis
2
and
Costas E. Goutis
2
Affiliations:
1
Cyprus University of Technology, Cyprus
;
2
University of Patras, Greece
;
3
European University of Cyprus, Cyprus
Keyword(s):
Cryptography, Hash Functions, SHA-1, Totally Self-checking, Concurrent Error Detection.
Related
Ontology
Subjects/Areas/Topics:
Applied Cryptography
;
Authentication
;
Cryptographic Techniques and Key Management
;
Data Engineering
;
Databases and Data Security
;
Information and Systems Security
;
Network Security
;
Obstacles
;
Reliability and Dependability
;
Security Engineering
;
Security in Information Systems
;
Security Protocols
;
Sensor Networks
Abstract:
Hash functions are among the major blocks of modern security schemes, used in many applications to provide authentication services. To meet the applications’ real-time constraints, they are implemented in hardware offering high-performance and increased security solutions. However, faults occurred during their operation result in the collapse of the authentication procedure, especially when they are used in security-critical applications such as military or space ones. In this paper, a Totally Self-Checking (TSC) design is introduced for the currently most-used hash function, namely the SHA-1. A detailed description concerning the TSC development of the data- and control-path is provided. To the best of authors’ knowledge, it is the first time that a TSC hashing core is presented. The proposed design has been implemented in 0.18μm CMOS technology and experiments on fault caverage, performance, and area have been performed. It achieves 100% coverage in the case of odd erroneous bits.
The same coverage is also achieved for even erroneous bits, if they are appropriately spread. Compared to the corresponding Duplicated-with-Checking (DWC) design, the proposed one is more area-efficient by almost 15% keeping the same frequency.
(More)