Hash functions are used to generate a short form of an original message of any size. This short form is called a hash of a message or a message digest and is used in many cryptographic applications including message integrity verification and message authentication, in which case a keyed hash function is used. Hash function h operates on a message m of an arbitrary length. The result is a hash ...

We propose a new hash function, the unique-permutation hash function, and a performance analysis of its hash computation. Following the notations of [15], the cost of a hash function h is denoted by Ch(k,N) and stands for the expected number of table entries that are checked when inserting the (k + 1) key to a hash table of size N , where k out of N table entries are filled by previous insertio...

The security of many cryptographic protocols relies on the hardness of some computational problems. Besides discrete logarithm or integer factorization, other problems are regularly proposed as potential hard problems. The factorization problem in finite groups is one of them. Given a finite group G, a set of generators S for this group and an element g ∈ G, the factorization problem asks for a...

Quantum information and quantum computation have achieved a huge success during the last years. In this paper, we investigate the capability of quantum Hash function, which can be constructed by subtly modifying quantum walks, a famous quantum computation model. It is found that quantum Hash function can act as a hash function for the privacy amplification process of quantum key distribution sy...

To maintain data integrity hash functions are generally used. Hash function is one type of cryptographic primitives, which provide an assurance for data integrity. NAS has designed SHA hash functions which are the set of cryptographic hash function. There are so many SHA function existing in which SHA-1 produces message digest that is of 160 bits long. Later in SHA-1 has been identified securit...

Several fast software hash functions have been proposed since the hash function MD4 was introduced by R. Rivest in 1990. At the moment, SHA-1, RIPEMD-160, and HAVAL are known as secure dedicated hash functions in MDx-family hash functions. In this paper, we propose a new hash function based on advantages of these three hash functions, which keeps the maximum security of them and is more efficie...

To understand the viability of using hash functions to verify integrity and source of information, one must first examine the properties and origin of the basic hash function. The standard hash function serves as a basis for the discussion of Cryptographic Hash Functions. There are several hash functions currently in use today, including MD5 and SHA1. By examining the history and security avail...

Graph Theory has been realized as one of the most useful branches of Mathematics of recent origin, finding widest applications in all most all branches of sciences, social sciences, and engineering and computer science. Nathanson[8] was the pioneer in introducing the concepts of NumberTheory, particularly, the “Theory of congruences” i n Graph Theory, thus paving way for the emergence of a new ...