Paper 2010/457

Improving the performance of Luffa Hash Algorithm

Thomaz Oliveira and Julio López

Abstract

Luffa is a new hash algorithm that has been accepted for round two of the NIST hash function competition SHA-3. Computational efficiency is the second most important evaluation criteria used to compare candidate algorithms. In this paper, we describe a fast software implementation of the Luffa hash algorithm for the Intel Core 2 Duo platform. We explore the use of the perfect shuffle operation to improve the performance of 64-bit implementation and 128-bit implementation with the Intel Supplemental SSSE3 instructions. In addition, we introduce a new way of implementing Luffa based on a Parallel Table Lookup instruction. The timings of our 64-bit implementation (C code) resulted in a 16 to 32% speed improvement over the previous fastest implementation.

Note: Work in progress

Metadata
Available format(s)
PDF
Category
Implementation
Publication info
Published elsewhere. Unknown where it was published
Keywords
hash functions implementation luffa
Contact author(s)
thomaz oliveira @ students ic unicamp br
History
2010-08-31: received
Short URL
https://ia.cr/2010/457
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2010/457,
      author = {Thomaz Oliveira and Julio López},
      title = {Improving the performance of Luffa Hash Algorithm},
      howpublished = {Cryptology ePrint Archive, Paper 2010/457},
      year = {2010},
      note = {\url{https://eprint.iacr.org/2010/457}},
      url = {https://eprint.iacr.org/2010/457}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.