1 2 m 1 2 k 1 2 n Hash bin address in binary hash Key Compress to a shorter binary code Figure 1: Architecture of Neuro-Hasher consists of a two layer feedforward neural net. The generic function of a feedforward multilayer perceptron (MLP) network is to map patterns from one space to another. This mapping function, determined by the set of examples used to train the network, may be viewed as a...

At SAC 2009, Gennaro and Halevi showed that a key wrapping scheme using a universal hash function and ECB mode (a HtECB scheme) is broken, and the security of a scheme based on a universal hash function and CBC mode (a HtCBC scheme) has been left as an open problem. In this paper, we first generalize classical notions of universal and uniform hash functions, and propose two new notions, where w...

With the succumbing of various Hash functions to collision attacks, there have been serious research efforts to design new Hash functions which are robust against various contemporary attacks. MAYHAM is one such hash function that has been designed keeping in view the cryptographic properties needed yet resistant to all the publically known attacks. MAYHAM is designed as a simple and efficient ...

Recent advances in hash functions cryptanalysis provide a strong impetus to explore new designs. This paper describes a new hash function mq-hash that depends for its security on the difficulty of solving randomly drawn systems of multivariate equations over a finite field. While provably achieving pre-image resistance for a hash function based on multivariate equations is relatively easy, näıv...

SHA-3 Cryptographic Hash Algorithm Competition is a competition raised by NIST in response to recent advances of cryptanalysis, aiming at selecting new hash algorithm instead of SHA-2 like AES selection. The compression function of a hash function could be written in the form of multivariate boolean function. In this paper, we introduce our algorithms of evaluating boolean function and applied ...

A cryptographic hash function is a deterministic procedure that compresses an arbitrary block of numerical data and returns a fixed-size bit string. There exists many hash functions: MD5, HAVAL, SHA, ... It was reported that these hash functions are no longer secure. Our work is focused on the construction of a new hash function based on composition of functions. The construction used the NP-co...

A “strong” cryptographic hash function suitable for practical applications should simultaneously satisfy many security properties, like pseudo-randomness, collision resistance and unforgeability. This paper shows how to combine two hash function families each satisfying different security property into one hash function family, which satisfies both properties. In particular, given two hash func...

In this paper, the composite order Cayley graph Cay(G, S) is introduced, where G is a group and S is the set of all composite order elements of G. Some graph parameters such as diameter, girth, clique number, independence number, vertex chromatic number and domination number are calculated for the composite order Cayley graph of some certain groups. Moreover, the planarity of composite order Ca...

In the conference PKC’98, Shin et al. proposed a dedicated hash function of the MD family. In this paper, we study the security of Shin’s hash function. We analyze the property of the Boolean functions, the message expansion, and the data dependent rotations of the hash function. We propose a method for finding the collisions of the modified Shin’s hash function and show that we can find collis...