658 search results - page 36 / 132 » The Grindahl Hash Functions |
150
Voted
CRYPTOLOGIA
2006
15 years 4 months ago
2006
In this paper, we describe Whirlpool, which is a block-cipher-based secure hash function. Whirlpool produces a hash code of 512 bits for an input message of maximum length less tha...
128
Voted
EUROCRYPT
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We develop a new generic long-message second preimage attack, based on combining the techniques in the second preimage attacks of Dean [8] and Kelsey and Schneier [16] wi...
131
Voted
ACL
2008
15 years 5 months ago
2008
We propose a succinct randomized language model which employs a perfect hash function to encode fingerprints of n-grams and their associated probabilities, backoff weights, or oth...
138
Voted
ASIACRYPT
2009
Springer
15 years 10 months ago
2009
Springer
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...
131
click to vote
FSE
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. In this article, it is discussed how to construct a compression function with 2n-bit output using a component function with n-bit output. The component function is either...