A hash function is constructed based on a three-layer neural network. The three neuron-layers are used to realize data confusion, diffusion and compression respectively, and the multi-block hash mode is presented to support the plaintext with variable length. Theoretical analysis and experimental results show that this hash function is one-way, with high key sensitivity and plaintext sensitivit...

This paper proposes a novel hash function construction based on cascade chaos. Firstly, the L-length original message is divided into a number of blocks according to every character, which are transformed into corresponding ASCII values. Then the ASCII values are normalized into the interval of (0, 1), which compose a big array with the L-length. Regarding the first normalized ASCII value with ...

Recent developments in the field of cryptanalysis of hash functions has inspired NIST to announce a competition for selecting a new cryptographic hash function to join the SHA family of standards. One of the 14 second-round candidates was CubeHash designed by Daniel J. Bernstein. CubeHash is a unique hash function in the sense that it does not iterate a common compression function, and offers a...

In this paper we study two possible approaches to improving existing schemes for constructing hash functions that hash arbitrary long messages. First, we introduce a continuum of function classes that lie between universal one-way hash functions and collision-resistant functions. For some of these classes efficient (yielding short keys) composite schemes exist. Second, we prove that the schedul...

Many practical information authentication techniques are based on such cryptographic means as data encryption algorithms and one-way hash functions. A core component of such algorithms and functions are nonlinear functions. In this paper, we reveal a relationship between nonlinearity and propagation characteristic, two critical indicators of the cryptographic strength of a Boolean function. We ...

A signature scheme constructed according to the hash-andsign paradigm—hash the message and then sign the hash, symbolically σ(H(M))—is no more secure than the hash function H against a collision-finding attack. Recent attacks on standard hash functions call the paradigm into question. It is well known that a simple modification of the hash-and-sign paradigm may replace the collision-resistant h...

1 I n t r o d u c t i o n In this paper, we present and analyze a new public key cryptosystem that is provably secure against adaptive chosen ciphertext attack (as defined by Rackoff and Simon [20]). The scheme is quite practical, requiring just a few exponentiations over a group. Moreover, the proof of security relies only on a standard intractability assumption, namely, the hardness of the Di...

We present a new transformation of chosen-plaintext secure predicate encryption schemes with public index into chosen-ciphertext secure schemes. Our construction requires only a universal one-way hash function and is selectively secure in the standard model. The transformation is not generic but can be applied to various existing schemes constructed from bilinear groups. Using common structural...

In 1999, J. H astad and M. NN aslund 13] could prove that every bit is a hard core of the RSA function. From this work we extract an abstract theorem about the hidden number problem which can be used to prove that every bit is a hard core of many speciic cryptographic functions. Applications are RSA, ElGamal, Rabin, a modiied Diie-Hellman function, Pailler's cryptosystem, the Diie-Hellman funct...

Protocols that provide authentication and key distribution are mainly based on symmetric and asymmetric ciphers. In recent years, some approaches have been introduced that are based on strong one-way hash functions, and further enhancements to these approaches are given in this paper. The lightweight protocols that are presented in this paper are suitable for implementation with simple logic. T...