Abstract
In this paper, we propose a method of efficient software implementation for the cryptographic hash function LSH with single instruction multiple data (SIMD). The method is based on word-wise permutations of LSH. Using the modified functions Step j ' = P o Step j o P -1 and MsgExp' instead of the original step function Stepj and message expansion function MsgExp, where P is a permutation and P -1 is the inverse permutation of P, we show that the number of the SIMD instructions for implementing LSH is reduced. For efficient implementation of LSH in other environments (e.g., MIMD), various types of word permutations are listed.
Highlights
Cryptographic hash functions are necessary for constructing a system of information security
A cryptographic hash function is used in various fields, such as a message authentication code (MAC), key derivation function (KDF), and a pseudo-random number generator
We show how to implement a cryptographic hash function LSH efficiently with single instruction multiple data (SIMD) by representing the LSH using P and P−1, where P is a permutation and P−1 is the inverse of P
Summary
Cryptographic hash functions are necessary for constructing a system of information security. We show how to implement a cryptographic hash function LSH efficiently with SIMD by representing the LSH using P and P−1, where P is a permutation and P−1 is the inverse of P. If a word-wise permutation is operated in a register, only a single SIMD instruction is needed, ‘‘_mm_shuffle_epi32’’. If the word-wise permutation is the identity, there is no need for an SIMD instruction In another example, assuming that two 64-bit words compose a register, if a word-wise permutation is operated. In two mixed registers, three SIMD instructions are needed as follows: ‘‘_mm_unpacklo_epi64’’, ‘‘_mm_unpackhi_epi64’’, and ‘‘_mm_shuffle_epi32’’. If each of the two 64-bit words still remain in their same registers, ‘‘_mm_unpacklo_epi64’’ and ‘‘_mm_unpackhi_epi64’’ are not needed for a word-wise permutation.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
