Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
3,829
Keying hash functions for message authentication
, 1996
"... The use of cryptographic hash functions like MD5 or SHA for message authentication has become a standard approach inmanyInternet applications and protocols. Though very easy to implement, these mechanisms are usually based on ad hoc techniques that lack a sound security analysis. We present new cons ..."
Abstract
-
Cited by 611 (39 self)
- Add to MetaCart
The use of cryptographic hash functions like MD5 or SHA for message authentication has become a standard approach inmanyInternet applications and protocols. Though very easy to implement, these mechanisms are usually based on ad hoc techniques that lack a sound security analysis. We present new
Universal One-Way Hash Functions and their Cryptographic Applications
, 1989
"... We define a Universal One-Way Hash Function family, a new primitive which enables the compression of elements in the function domain. The main property of this primitive is that given an element x in the domain, it is computationally hard to find a different domain element which collides with x. We ..."
Abstract
-
Cited by 351 (15 self)
- Add to MetaCart
We define a Universal One-Way Hash Function family, a new primitive which enables the compression of elements in the function domain. The main property of this primitive is that given an element x in the domain, it is computationally hard to find a different domain element which collides with x. We
How to break MD5 and other hash functions
- In EUROCRYPT
, 2005
"... Abstract. MD5 is one of the most widely used cryptographic hash functions nowadays. It was designed in 1992 as an improvement of MD4, and its security was widely studied since then by several authors. The best known result so far was a semi free-start collision, in which the initial value of the has ..."
Abstract
-
Cited by 317 (7 self)
- Add to MetaCart
Abstract. MD5 is one of the most widely used cryptographic hash functions nowadays. It was designed in 1992 as an improvement of MD4, and its security was widely studied since then by several authors. The best known result so far was a semi free-start collision, in which the initial value
CRYPTOGRAPHIC HASH FUNCTIONS
, 1993
"... Hash functions were introduced in cryptology in the late seventies as a tool to protect the authenticity of information. Soon it became clear that they were a very useful building block to solve other security problems in telecommunication and computer networks. This paper sketches the history of th ..."
Abstract
-
Cited by 57 (4 self)
- Add to MetaCart
Hash functions were introduced in cryptology in the late seventies as a tool to protect the authenticity of information. Soon it became clear that they were a very useful building block to solve other security problems in telecommunication and computer networks. This paper sketches the history
A Hash Of Hash Functions
"... In this paper, we present a general review of hash functions in a cryptographic sense. We give special emphasis on some particular topics such as cipher block chaining message authentication code (CBC MAC) and its variants. This paper also broadens the information given in [1], by including more det ..."
Abstract
- Add to MetaCart
In this paper, we present a general review of hash functions in a cryptographic sense. We give special emphasis on some particular topics such as cipher block chaining message authentication code (CBC MAC) and its variants. This paper also broadens the information given in [1], by including more
Standard hash functions Conclusion Outline Varieties of hash function Properties of hash functions
"... Building hash functions ..."
Standard hash functions Conclusion Outline Varieties of hash function Properties of hash functions
, 2010
"... Building hash functions ..."
The Whirlpool Hashing Function
- First open NESSIE Workshop
, 2000
"... Abstract. We present Whirlpool, a 512-bit hash function operating on messages less than 2256 bits in length. The function structure is de-signed according to the Wide Trail strategy and permits a wide variety of implementation tradeoffs. (Revised on May 24, 2003) 1 ..."
Abstract
-
Cited by 58 (1 self)
- Add to MetaCart
Abstract. We present Whirlpool, a 512-bit hash function operating on messages less than 2256 bits in length. The function structure is de-signed according to the Wide Trail strategy and permits a wide variety of implementation tradeoffs. (Revised on May 24, 2003) 1
Results 1 - 10
of
3,829
