13 search results - page 2 / 3 » Slide Attacks on a Class of Hash Functions |
FSE
2003
Springer
13 years 10 months ago
2003
Springer
Until now in cryptography the term collision was mainly associated with the surjective mapping of diļ¬erent inputs to an equal output of a hash function. Previous collision attack...
CRYPTO
2010
Springer
13 years 3 months ago
2010
Springer
We show that the widely deployed RSA-OAEP encryption scheme of Bellare and Rogaway (Eurocrypt 1994), which combines RSA with two rounds of an underlying Feistel network whose hash...
ASIACRYPT
2010
Springer
13 years 3 months ago
2010
Springer
We revisit narrow-pipe designs that are in practical use, and their security against preimage attacks. Our results are the best known preimage attacks on Tiger, MD4, and reduced SH...
CRYPTO
2007
Springer
13 years 11 months ago
2007
Springer
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}ā...
CRYPTO
2005
Springer
13 years 11 months ago
2005
Springer
The Full-Domain Hash (FDH) signature scheme [3] forms one the most basic usages of random oracles. It works with a family F of trapdoor permutations (TDP), where the signature of m...