In this paper, a design space exploration is performed aiming at developing high-performance hardware architectures for the new cryptographic hash function Skein-512. Three well-known design optimization techniques namely, the loop unrolling, the structural and functional pipeline, are applied, while several design alternatives have been explored to derive optimized FPGA implementations. The pr...

In this paper, to match a lightweight digital signing scheme of which the length of modulus is between 80 and 160 bits, a lightweight hash function called JUNA is proposed. It is based on the intractabilities MPP and ASPP, and regards a short message or a message digest as an input which is treated as only one block. The JUNA hash contains two algorithms: an initialization algorithm and a compr...

Speirs II, William Robert Ph.D., Purdue University, May, 2007. Dynamic Cryptographic Hash Functions. Major Professor: Samuel S. Wagstaff, Jr. This dissertation introduces a new type of cryptographic hash function, the dynamic cryptographic hash function. Dynamic cryptographic hash functions differ from traditional hash functions because they require a second parameter, the security parameter. T...

Sorting and hashing are two completely different concepts in computer science, and appear mutually exclusive to one another. Hashing is a search method using the data as a key to map to the location within memory, and is used for rapid storage and retrieval. Sorting is a process of organizing data from a random permutation into an ordered arrangement, and is a common activity performed frequent...

Iterated hash functions based on block ciphers are treated. Five attacks on an iterated hash function and on its round function are formulated. The wisdom of strengthening such hash functions by constraining the last block of the message to be hashed is stressed. Schemes for constructing m-bit and 2m-bit hash round functions fromm-bit block ciphers are studied. A principle is formalized for eva...

GOST-R is a Russian Standard Cryptographic Hash function which was first introduced in 1994 by Russian Federal for information processing, information security and digital signature. In 2012, it was updated to GOSTR 34.11-2012 and replaced older one for all its applications from January 2013. GOST-R is based on modified Merkle-Damg̊ard construction. Here, we present a modified version of GOST-R ...

1 Known designs Let n be a natural number and M denotes the message represented by n-bit In case the message length is not a multiple of n, it should be padded somehow. We do not specify how at this point. Most of the known hash functions are based on the Merkle-Damg ˙ ard construction. First, a compression function f (h, m) is determined, where m is an n-bit input and another input h is of the...

Cryptographic hash function is a function that takes an arbitrary length as an input and produces a fixed size of an output. The viability of using cryptographic hash function is to verify data integrity and sender identity or source of information. This paper provides a detailed overview of cryptographic hash functions. It includes the properties, classification, constructions, attacks, applic...