Comparison of power consumption in pipelined implementations of the BLAKE3 cipher in FPGA devices

Authors

Abstract

This article analyzes the dynamic power losses generated by various hardware implementations of the BLAKE3 hash function. Estimations of the parameters were based on the results of post-route simulations of designs implemented in Xilinx Spartan-7 FPGAs. The algorithm was tested in various hardware organizations: based on a standard iterative architecture with one round instance in the programmable array, various derived versions with pipeline processing were elaborated, which ultimately led to a set of 6 architectural variants of the cipher, from the iterative case (without pipeline) to one with maximum of 6 pipeline stages. Moreover, the results obtained for the iterative architecture were compared with analogous implementations of the BLAKE2 (direct predecessor) and Keccak (the foundation of the current SHA-3 standard) algorithms. This case study illustrates the differences (or lack thereof) in the power requirements of these three hash functions when they are implemented on an FPGA platform, and illustrate the significant savings that can be achieved by introducing pipeline to the processing of the BLAKE round.

References

K. Gaj, J.P. Kaps, V. Amirineni, M. Rogawski, E. Homsirikamol, B.Y. Brewster, “ATHENa – Automated Tool for Hardware EvaluatioN: Toward Fair and Comprehensive Benchmarking of Cryptographic Hardware Using FPGAs”, in Proc. 20th International Conference on Field Programmable Logic and Applications, Milano, pp. 414-421, 2010. https://doi.org/10.1109/FPL.2010.86

J. Sugier, “FPGA Implementations of BLAKE3 Compression Function with Intra-Round Pipelining”, in W. Zamojski et al. (eds) New Advances in Dependability of Networks and Systems, Lecture Notes in Networks and Systems, vol. 484, pp. 319-330, Springer, Cham, 2022. https://doi.org/10.1007/978-3-031-06746-4_31

J. Sugier, “Power Analysis of BLAKE3 Pipelined Implementations in FPGA Devices”, in W. Zamojski et al. (eds) Dependable Computer Systems and Networks, Lecture Notes in Networks and Systems, vol. 737, pp. 295-308, Springer, Cham, 2023. https://doi.org/10.1007/978-3-031-37720-4_27

J.P. Aumasson, L. Henzen, W. Meier, R.C.-W. Phan “SHA-3 proposal BLAKE, version 1.3”, https://www.aumasson.jp/blake/blake.pdf, 2010, last accessed Sept. 2023.

J.P. Aumasson, S. Neves, Z. Wilcox-O’Hearn, C. Winnerlein “BLAKE2: Simpler, Smaller, Fast as MD5”, in M. Jacobson, M. Locasto, P. Mohassel, R. Safavi-Naini (eds) Applied Cryptography and Network Security 2013, Lecture Notes in Computer Science, vol. 7954, pp. 119-135, Springer, Berlin-Heidelberg, 2013. https://doi.org/10.1007/978-3-642-38980-1_8

J. O’Connor, J.P. Aumasson, S. Neves, Z. Wilcox-O’Hearn, “BLAKE3: one function, fast everywhere”, Real World Crypto 2020 (lightning talk), available at https://github.com/BLAKE3-team/BLAKE3-specs/blob/ master/blake3.pdf, last accessed Sept. 2023.

S. Sinha, S. Anand, K.P. K, “Improving Smart Contract Transaction Performance in Hyperledger Fabric”, in Proc. 2021 Emerging Trends in Industry 4.0 (ETI 4.0), pp. 1-6, IEEE Xplore, 2021. https://doi.org/10.1109/ETI4.051663.2021.9619202

I.T. Ciocan, E.A. Kelesidis, D. Maimuţ, L. Morogan, “A Modified Argon2i Using a Tweaked Variant of Blake3”, in Proc. 2021 26th IEEE Asia-Pacific Conference on Communications (APCC), Kuala Lumpur, pp. 271-274, IEEE Xplore, 2021. https://doi.org/10.1109/APCC49754.2021. 9609933

J. Sugier, “Simplifying FPGA Implementations of BLAKE Hash Algorithm with Block Memory Resources”, Procedia Engineering, vol. 178, pp. 33–41, 2017. https://doi.org/10.1016/j.proeng.2017.01.057

G. Bertoni, J. Daemen, M. Peeters, G. Van Assche, “The Keccak reference”, SHA-3 competition (round 3), available at https://keccak.team /papers.html, 2011, last accessed Sept. 2023.

National Institute of Standards and Technology, “SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions”, FIPS pub. 202, https://csrc.nist.gov/publications/detail/fips/202/final, last accessed Sept. 2023. https://doi.org/10.6028/NIST.FIPS.202

J. Sugier, “Low cost FPGA devices in high speed implementations of Keccak-f hash algorithm”, in W. Zamojski et al. (eds) Proc. Ninth International Conference on Dependability and Complex Systems, Advances in Intelligent Systems and Computing, vol. 286, pp. 319-330, Springer, Cham, 2014. https://doi.org/10.1007/978-3-319-07013-1_42

Xilinx, Inc., “7 Series FPGAs Data Sheet: Overview”, DS180.PDF available at www.xilinx.com, last accessed Sept. 2023.

Xilinx, Inc., “Vivado Design Suite User Guide: Power Analysis and Optimization”, UG907.PDF available at www.xilinx.com, last accessed Sept. 2023.

E. Boemo, J. Oliver, G. Caffarena, “Tracking the pipelining-power rule along the FPGA technical literature”, in Proc. 10th FPGAworld Conference, FPGAworld, 2013. https://doi.org/10.1145/2513683. 2513692

N. Grover, M.K. Soni, “Reduction of Power Consumption in FPGAs - An Overview”, International Journal of Information Engineering and Electronic Business, vol. 4, no. 5, pp. 50-69, 2012. https://doi.org/ 10.5815/ijieeb.2012.05.07

S.J.E. Wilton, S.S. Ang, W. Luk, “The Impact of Pipelining on Energy per Operation in Field-Programmable Gate Arrays”, in J. Becker, M. Platzner, S. Vernalde (eds) Field Programmable Logic and Application 2004, Lecture Notes in Computer Science, vol 3203. Springer, Berlin- Heidelberg, 2004. https://doi.org/10.1007/978-3-540-30117-2_73

Downloads

Published

2024-04-15

Issue

Section

ARTICLES / PAPERS / General