INTERNATIONALLY STANDARDIZED EFFICIENT CRYPTOGRAPHIC HASH FUNCTION
Danilo Gligoroski, Svein J. Knapskog, Jørn Amundsen, Rune Erlend Jensen
Abstract
Danilo Gligoroski, Svein J. Knapskog, Jørn Amundsen, Rune Erlend Jensen
Abstract
We claim that the European research and development community can initiate and sustain a process of designing a secure cryptographic hash function that will be widely accepted by the industry due to its superior performances in software compared to any of the hash functions MD5, SHA-1, SHA-2 or SHA-3. We base our claim on three main arguments: 1. The industry demands very fast cryptographic hash functions due to the increased volume of information that needs to be processed in a secure way. 2. The current trends of increased degree of instructional level parallelism and development of vector extensions of recent CPUs have a potential for being efficiently exploited by new cryptographic hash designs. 3. The list of the SHA-3 finalists does not contain algorithms which are significantly faster than SHA-2.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We claim that the European research and development community can initiate and sustain a process of designing a secure cryptographic hash function that will be widely accepted by the industry due to its superior performances in software compared to any of the hash functions MD5, SHA-1, SHA-2 or SHA-3. We base our claim on three main arguments: 1. The industry demands very fast cryptographic hash functions due to the increased volume of information that needs to be processed in a secure way. 2. The current trends of increased degree of instructional level parallelism and development of vector extensions of recent CPUs have a potential for being efficiently exploited by new cryptographic hash designs. 3. The list of the SHA-3 finalists does not contain algorithms which are significantly faster than SHA-2.
Key concepts: Hash function, Cryptographic hash function, SHA-2, Security of cryptographic hash functions, Computer science, Secure Hash Algorithm, Cryptography, Cryptographic primitive