114 search results - page 19 / 23 » Improved Collision Attack on Hash Function MD5 |
104
click to vote
CHES
2010
Springer
15 years 26 days ago
2010
Springer
The need for lightweight (that is, compact, low-power, low-energy) cryptographic hash functions has been repeatedly expressed by application designers, notably for implementing RFI...
STOC
2005
ACM
16 years 1 days ago
2005
ACM
We present a new constant round protocol for non-malleable zero-knowledge. Using this protocol as a subroutine, we obtain a new constant-round protocol for non-malleable commitmen...
100
click to vote
EUROCRYPT
2008
Springer
15 years 1 months ago
2008
Springer
We provide attacks and analysis that capture a tradeoff, in the ideal-permutation model, between the speed of a permutation-based hash function and its potential security. For coll...
CRYPTO
2009
Springer
15 years 6 months ago
2009
Springer
RSA-FDH and many other schemes secure in the Random-Oracle Model (ROM) require a hash function with output size larger than standard sizes. We show that the random-oracle instanti...
CANS
2005
Springer
15 years 5 months ago
2005
Springer
In Eurocrypt’05, Wang et al. presented new techniques to find collisions of Hash function MD4. The techniques are not only efficient to search for collisions, but also applicabl...