Optimisation of the SHA-2 Family of Hash Functions on FPGAs

McEvoy, Robert P.; Crowe, F.; Murphy, Colin C.; Marnane, William P.

doi:10.1109/isvlsi.2006.70

Cited by 88 publications

(56 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The implementation overhead of our proposed protocol is much less than traditional cryptographic modules. For example, robust hashing implementation of SHA-2 as listed in Table IV requires at least 5492 LUTs of a Virtex-II FPGA [27] and it takes 68 clock cycles to evaluate. This overhead will occur on the top of the clock cycles required for PUF evaluation.…”

Section: Hardware Implementationmentioning

confidence: 99%

Slender PUF Protocol: A Lightweight, Robust, and Secure Authentication by Substring Matching

Majzoobi

Rostami

Koushanfar

et al. 2012

2012 IEEE Symposium on Security and Privacy Workshops

179

138

View full text Add to dashboard Cite

Abstract-We introduce Slender PUF protocol, an efficient and secure method to authenticate the responses generated from a Strong Physical Unclonable Function (PUF). The new method is lightweight, and suitable for energy constrained platforms such as ultra-low power embedded systems for use in identification and authentication applications. The proposed protocol does not follow the classic paradigm of exposing the full PUF responses (or a transformation of the full string of responses) on the communication channel. Instead, random subsets of the responses are revealed and sent for authentication. The response patterns are used for authenticating the prover device with a very high probability. We perform a thorough analysis of the method's resiliency to various attacks which guides adjustment of our protocol parameters for an efficient and secure implementation. We demonstrate that Slender PUF protocol, if carefully designed, will be resilient against all known machine learning attacks. In addition, it has the great advantage of an inbuilt PUF error tolerance. Thus, Slender PUF protocol is lightweight and does not require costly additional error correction, fuzzy extractors, and hash modules suggested in most previously known PUF-based robust authentication techniques. The low overhead and practicality of the protocol are confirmed by a set of hardware implementation and evaluations.

show abstract

Section: Hardware Implementationmentioning

confidence: 99%

Slender PUF Protocol: A Lightweight, Robust, and Secure Authentication by Substring Matching

Majzoobi

Rostami

Koushanfar

et al. 2012

2012 IEEE Symposium on Security and Privacy Workshops

179

138

View full text Add to dashboard Cite

show abstract

“…Another implementation in [9] which consumed 1373 slices for SHA-256 core, and 2726 slices for SHA-512 core with no power results provided. The implementation of [10] used ASIC core for 8-bit SHA-256 core.…”

Section: Related Workmentioning

confidence: 99%

Hardware Performance Evaluation of SHA-3 Candidate Algorithms

Jararweh¹,

Tawalbeh²,

Tawalbeh³

et al. 2012

JIS

View full text Add to dashboard Cite

Secure Hashing Algorithms (SHA) showed a significant importance in today's information security applications. The National Institute of Standards and Technology (NIST), held a competition of three rounds to replace SHA1 and SHA2 with the new SHA-3, to ensure long term robustness of hash functions. In this paper, we present a comprehensive hardware evaluation for the final round SHA-3 candidates. The main goal of providing the hardware evaluation is to: find the best algorithm among them that will satisfy the new hashing algorithm standards defined by the NIST. This is based on a comparison made between each of the finalists in terms of security level, throughput, clock frequancey, area, power consumption, and the cost. We expect that the achived results of the comparisons will contribute in choosing the next hashing algorithm (SHA-3) that will support the security requirements of applications in todays ubiquitous and pervasive information infrastructure.

show abstract

“…In [23], [24] the whole SHA-2 family is implemented in FPGAs and compared in terms of area, frequency of operation and throughput. Some other works [25], [26], [27] provide further comparisons of FPGA-based implementations of hash functions. Also, some optimizations based on pipelining, loop unrolling, operation rescheduling and hardware reutilization are proposed in [28], [29].…”

Section: Related Workmentioning

confidence: 99%

Efficient fault tolerant SHA-2 hash functions for space applications

Juliato

Gebotys

Elbaz

2009

2009 IEEE Aerospace Conference

View full text Add to dashboard Cite

Abstract-Satellites are extensively used by public and private sectors to support a variety of services. Considering the cost and the strategic importance of these spacecrafts, it is fundamental to utilize strong cryptographic primitives to assure their security. However, it is of utmost importance to consider fault tolerance in their designs due to the harsh environment found in space, while keeping low area and power consumption. Therefore, this paper proposes novel fault tolerant schemes for the SHA-2 family of hash functions and analyzes their resistance to SEUs. Results obtained through FPGA implementation show that our best fault tolerant scheme for SHA-512 uses up to 32% less area and consumes up to 43% less power than the commonly used TMR technique. Moreover, its memory and registers are 435 and 175 times more resistant to SEUs than TMR. These results are crucial for supporting low area and low power fault tolerant cryptographic primitives in satellites.

show abstract

Optimisation of the SHA-2 Family of Hash Functions on FPGAs

Cited by 88 publications

References 8 publications

Slender PUF Protocol: A Lightweight, Robust, and Secure Authentication by Substring Matching

Slender PUF Protocol: A Lightweight, Robust, and Secure Authentication by Substring Matching

Hardware Performance Evaluation of SHA-3 Candidate Algorithms

Efficient fault tolerant SHA-2 hash functions for space applications

Contact Info

Product

Resources

About