Abstract
In this paper we describe a family of highly parameterized hash functions. This parameterization results in great flexibility between performance and security of the algorithm. The three basic functions, HaF-256, HaF-512 and HaF-1024 constitute this hash function family. Lengths of message digests are 256, 512 and 1024 bits respectively. The paper discusses the details of functions structure. The method used to generate function S-box is also described in detail.
Highlights
In this paper we describe a family of highly parameterized hash functions
A lot of recent cryptographic research has been devoted to methods of generating new hash functions which resulted for example in 64 proposals being submitted to the NIST SHA-3 competition for a new hash function in 2008 [1]
The objective while designing the HaF family of hash function was obviously the highest security while maintaining the best possible performance, at the same time the function should allow a flexible balance between security and performance which was achieved through parameterization
Summary
The following assumptions were taken into account during the design process:. flexibility between performance and security should be guaranteed; iteration structure and compression function should be resistant to known. Its iteration mode should be HAIFA (it provides resistance to long message second preimage attacks, and handles hashing with a salt) [2, 3]
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.
