Results 1  10
of
14
HAVAL  A OneWay Hashing Algorithm with Variable Length of Output
, 1993
"... A oneway hashing algorithm is a deterministic algorithm that compresses an arbitrary long message into a value of specified length. The output value represents the fingerprint or digest of the message. A cryptographically useful property of a oneway hashing algorithm is that it is infeasible to fi ..."
Abstract

Cited by 55 (18 self)
 Add to MetaCart
A oneway hashing algorithm is a deterministic algorithm that compresses an arbitrary long message into a value of specified length. The output value represents the fingerprint or digest of the message. A cryptographically useful property of a oneway hashing algorithm is that it is infeasible to find two distinct messages that have the same fingerprint. This paper proposes a oneway hashing algorithm called HAVAL. HAVAL compresses a message of arbitrary length into a fingerprint of 128, 160, 192, 224 or 256 bits. In addition, HAVAL has a parameter that controls the number of passes a message block (of 1024 bits) is processed. A message block can be processed in 3, 4 or 5 passes. By combining output length with pass, we can provide fifteen (15) choices for practical applications where different levels of security are required. The algorithm is very efficient and particularly suited for 32bit computers which predominate the current workstation market. Experiments show that HAVAL is 60%...
Hash Functions: From MerkleDamgård to Shoup
 EUROCRYPT
, 2001
"... 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 oneway hash functions and collisionresistant functions. For some of these c ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
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 oneway hash functions and collisionresistant functions. For some of these classes efficient (yielding short keys) composite schemes exist. Second, we prove that the schedule of the Shoup construction, which is the most efficient composition scheme for universal oneway hash functions known so far, is optimal.
A cellular automaton based fast oneway hash function suitable for hardware implementation
 In Public Key Cryptography, number 1431 in Lecture Notes in Computer Science
, 1998
"... Abstract. Oneway hash functions are an important toolinachieving authentication and data integrity. The aim of this paper is to propose anovel oneway hash function based on cellular automata whose cryptographic properties have been extensivelystudiedover the past decade or so. Furthermore, securit ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
Abstract. Oneway hash functions are an important toolinachieving authentication and data integrity. The aim of this paper is to propose anovel oneway hash function based on cellular automata whose cryptographic properties have been extensivelystudiedover the past decade or so. Furthermore, security of the proposed oneway hash function is analyzed by the use of very recently published results on applications of cellular automata in cryptography. The analysis indicates that the oneway hash function is secure against all known attacks. An important feature of the proposed oneway hash function is that it is especially suitable for compact and fast implementation in hardware, which is particularly attractive to emerging security applications that employ smart cards, such asdigital identi cation cards and electronic cash payment protocols, 1
Necessary and Sufficient Conditions for CollisionFree Hashing
 Journal of Cryptology
, 1995
"... This paper determines an exact relationship between collisionfree hash functions and other cryptographic primitives. Namely, it introduces a new concept, the pseudopermutation, and shows that the existence of collisionfree hash functions is equivalent to the existence of clawfree pairs of pseudo ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
(Show Context)
This paper determines an exact relationship between collisionfree hash functions and other cryptographic primitives. Namely, it introduces a new concept, the pseudopermutation, and shows that the existence of collisionfree hash functions is equivalent to the existence of clawfree pairs of pseudopermutations. We also give a simple construction of collisionfree hash functions from everywheredefined clawfree (pseudo) permutations. 1 Introduction Hash functions with various cryptographic properties have been studied extensively, especially with respect to signing algorithms (see [2, 3, 4, 10, 12, 14, 15]). We focus on the most natural of these functions, the collisionfree hash functions. A function h is a collisionfree hash function if jh(x)j jxj \Gamma 1 and it is infeasible, given h and 1 k , to find a pair (x; y) so that jxj = jyj = k and h(x) = h(y). These functions were first carefully studied by Damgard [2] and have found several applications. In particular, they have b...
Duality between two cryptographic primitives
 Papers of Technical Group for Information Security, IEICE of Japan
, 1990
"... This paper reveals a duality between constructions of two basic cryptographic primitives, pseudorandom string generators and oneway hash functions. Applying the duality, we present a construction for universal oneway hash functions assuming the existence of oneway permutations. Under a stronger ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
(Show Context)
This paper reveals a duality between constructions of two basic cryptographic primitives, pseudorandom string generators and oneway hash functions. Applying the duality, we present a construction for universal oneway hash functions assuming the existence of oneway permutations. Under a stronger assumption, the existence of distinctionintractable permutations, we prove that the construction constitutes a collisionintractable hash function. Using ideas behind the construction, we propose practical oneway hash functions, the fastest of which compress nearly 2nbit long input into nbit long output strings by applying only twice a oneway function. 1
Differential Attack on Message Authentication Codes
, 1994
"... We discuss the security of Message Authentication Code (MAC) schemes from the viewpoint of differential attack, and propose an attack that is effective against DESMAC and FEALMAC. The attack derives the secret authentication key in the chosen plaintext scenario. For example, DES(8round)MAC can b ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We discuss the security of Message Authentication Code (MAC) schemes from the viewpoint of differential attack, and propose an attack that is effective against DESMAC and FEALMAC. The attack derives the secret authentication key in the chosen plaintext scenario. For example, DES(8round)MAC can be broken with 2 34 pairs of plain text, while FEAL8MAC can be broken with 2 22 pairs. The proposed attack is applicable to any MAC scheme, even if the 32bits are randomly selected from among the 64bits of ciphertext generated by a cryptosystem vulnerable to differential attack in the chosen plaintext scenario.
A Family of Fast Dedicated OneWay Hash Functions Based on Linear Cellular Automata over GF(q)
, 1999
"... This paper proposes a novel oneway hash function that can serve as a tool in achieving authenticity and data integrity. The oneway hash function can be viewed as a representative of a family of fast dedicated oneway hash functions whose construction is based on linear cellular automata over GF(q) ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This paper proposes a novel oneway hash function that can serve as a tool in achieving authenticity and data integrity. The oneway hash function can be viewed as a representative of a family of fast dedicated oneway hash functions whose construction is based on linear cellular automata over GF(q). The design and analysis of security of the function is accomplished by the use of very recently published results on cellular automata and their applications in cryptography. The analysis indicates that the oneway hash function is secure against all known attacks. A promising property of the proposed oneway hash function is that it is especially suitable for compact and fast implementation.
A Novel Approach for Light Weight User Authentication Scheme in Wireless Sensor Network
"... operated in hostile unattended environment so authentication is one of the important security requirements. Because of the resource constrained characteristics of WSN, the authentication scheme should sustain a lesser amount of computational as well as communication overhead. Some schemes proposed i ..."
Abstract
 Add to MetaCart
(Show Context)
operated in hostile unattended environment so authentication is one of the important security requirements. Because of the resource constrained characteristics of WSN, the authentication scheme should sustain a lesser amount of computational as well as communication overhead. Some schemes proposed in literature are vulnerable to node compromised attack. Some schemes do not provide sessionkey agreement. In this paper, we concentrate on improvement of authentication schemes to withstand against the node compromise attack. Additionally, our scheme also provides mutual authentication, session key agreement and protection against replay attack.
A Fast Cryptographic Hash Function Based on Linear Cellular Automata over GF(q)
"... Oneway hash functions are an important tool in achieving authentication and data integrity. The aim of this paper is to propose a novel oneway hash function based on linear cellular automata over GF(q). Design and security analysis of the proposed oneway hash function are based on the use of very ..."
Abstract
 Add to MetaCart
Oneway hash functions are an important tool in achieving authentication and data integrity. The aim of this paper is to propose a novel oneway hash function based on linear cellular automata over GF(q). Design and security analysis of the proposed oneway hash function are based on the use of very recently published results on cellular automata and its applications in cryptography. The analysis indicates that the oneway hash function is secure against all known attacks. An important feature of the proposed oneway hash function is that it is especially suitable for compact and fast implementation.