emph{ Smooth Projective Hash Functions } ( SPHFs ) as a specific pattern of zero knowledge proof system are fundamental tools to build many efficient cryptographic schemes and protocols. As an application of SPHFs, emph { Password - Based Authenticated Key Exchange } ( PAKE ) protocol is well-studied area in the last few years. In 2009, Katz and Vaikuntanathan described the first lattice-based ...

Abstract We present the implementation of Grover’s algorithm in a quantum simulator to perform search for preimages two scaled hash functions, whose design only uses modular addition, word rotation and bitwise exclusive or. Our provides means assess with precision scaling number gates depth full-fledged circuit designed find given digest. The detailed construction oracle shows that presence AND...

In this paper, we propose a new hash function based on RC4 and we call it RC4-Hash. This proposed hash function produces variable length hash output from 16 bytes to 64 bytes. Our RC4-Hash has several advantages over many popularly known hash functions. Its efficiency is comparable with widely used known hash function (e.g., SHA-1). Seen in the light of recent attacks on MD4, MD5, SHA-0, SHA-1 ...

The protection of information authentication is based on cryptographically secure hash function. A function that compresses an arbitrarily large message into a fixed small size message digest' is known as a hash function. The most currently used hash functions are based on block ciphers and the dedicated hash functions e. g. MD5, SHA-0 and SHA-1 etc. A hash function is said to be broken if...