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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Xiaoyun Wang, X.L., Feng, D., Yu, H.: Collisions for hash functions MD4, MD5, HAVAL-128 and RIPEMD. Cryptology ePrint Archive, Report 2004/199, pp. 1–4 (2004), http://eprint.iacr.org/2004/199
Szydlo, M.: SHA-1 collisions can be found in 263 operations. CryptoBytes Technical Newsletter (2005)
Stevens, M.: Fast collision attack on MD5. ePrint-2006-104, pp. 1–13 (2006), http://eprint.iacr.org/2006/104.pdf
Federal Register / Vol. 72, No. 212 / Friday, November 2 (2007), / Notices, http://csrc.nist.gov/groups/ST/hash/documents/FR_Notice_Nov07.pdf
National Institute of Standards and Technology (NIST): Cryptographic Hash Algorithm Competition, http://www.nist.gov/itl/csd/ct/
Bertoni, G., Daemen, J., Peeters, M., Assche, G.V.: The Keccak SHA-3 Submission version 3, pp. 1–14 (2011), http://keccak.noekeon.org/Keccak-submission-3.pdf
Strömbergson, J.: Implementation of the Keccak Hash Function in FPGA Devices, pp. 1–4 (2008), http://www.strombergson.com/files/Keccak_in_FPGAs.pdf
Baldwin, B., Hanley, N., Hamilton, M., Lu, L., Byrne, A., Neill, M., Marnane, W.P.: FPGA Implementations of the Round Two SHA-3 Candidates. In: 2nd SHA-3 Candidate Conference, Santa Barbara, August 23-24, pp. 1–18 (2010)
Matsuo, S., Knezevic, M., Schaumont, P., Verbauwhede, I., Satoh, A., Sakiyama, K., Ota, K.: How Can We Conduct Fair and Consistent Hardware Evaluation for SHA-3 Candidate? In: 2nd SHA-3 Candidate Conference, Santa Barbara, August 23-24, pp. 1–15 (2010)
Akin, A., Aysu, A., Ulusel, O.C., Savas, E.: Efficient Hardware Implementations of High Throughput SHA-3 Candidates Keccak, Luffa and Blue Midnight Wish for Single and Multi-Message Hashing. In: 2nd SHA-3 Candidate Conference, Santa Barbara, August 23-24, pp. 1–12 (2010)
Gaj, K., Homsirikamol, E., Rogawski, M.: Comprehensive Comparison of Hardware Performance of Fourteen Round 2 SHA-3 Candidates with 512-bit Outputs Using Field Programmable Gate Arrays. In: 2nd SHA-3 Candidate Conference, Santa Barbara, August 23-24, pp. 1–14 (2010)
Homsirikamol, E., Rogawski, M., Gaj, K.: Comparing Hardware Performance of Round 3 SHA-3 Candidates using Multiple Hardware Architectures in Xilinx and Altera FPGAs. In: ECRYPT II Hash Workshop 2011, Tallinn, Estonia, May 19-20, pp. 1–15 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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: Choy, O.C.S., Cheung, R.C.C., Athanas, P., Sano, K. (eds) Reconfigurable Computing: Architectures, Tools and Applications. ARC 2012. Lecture Notes in Computer Science, vol 7199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28365-9_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-28365-9_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28364-2
Online ISBN: 978-3-642-28365-9
eBook Packages: Computer ScienceComputer Science (R0)