Novel arithmetic architecture for high performance implementation of SHA-3 finalist Keccak on FPGA platforms

7Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose high speed architecture for Keccak using Look-Up Table (LUT) resources on FPGAs, to minimize area of Keccak data path and to reduce critical path lengths. This approach allows us to design Keccak data path with minimum resources and higher clock frequencies. We show our results in the form of chip area consumption, throughput and throughput per area. At this time, the design presented in this work is the highest in terms of throughput for any of SHA-3 candidates, achieving a figure of 13.67Gbps for Keccak-256 on Virtex 6. This can enable line rate operation for hashing on 10Gbps network interfaces. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Latif, K., Rao, M. M., Mahboob, A., & Aziz, A. (2012). Novel arithmetic architecture for high performance implementation of SHA-3 finalist Keccak on FPGA platforms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7199 LNCS, pp. 372–378). https://doi.org/10.1007/978-3-642-28365-9_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free