Common hash value (can be found using for example "openssl sha file.bin"
after creating a binary file containing any of the messages)
c9f160777d4086fe8095fba58b7e20c228a4006b
This was done by using a generalization of the attack presented at Crypto'98
by Chabaud and Joux. This generalization takes advantage of the iterative
structure of SHA-0. We also used the "neutral bit" technique of Biham and
Chen (To be presented at Crypto'2004).
The computation was performed on TERA NOVA (a 256 Intel-Itanium2 system
developped by BULL SA, installed in the CEA DAM open laboratory
TERA TECH). It required approximatively 80 000 CPU hours.
The complexity of the attack was about 2^51.
[^] # Re: Hashing et collisions
Posté par passant·e . En réponse au journal Deux Cryptage cassé ???. Évalué à 10.
http://www.mail-archive.com/cryptography%40metzdowd.com/msg02554.ht(...)
Common hash value (can be found using for example "openssl sha file.bin"
after creating a binary file containing any of the messages)
c9f160777d4086fe8095fba58b7e20c228a4006b
This was done by using a generalization of the attack presented at Crypto'98
by Chabaud and Joux. This generalization takes advantage of the iterative
structure of SHA-0. We also used the "neutral bit" technique of Biham and
Chen (To be presented at Crypto'2004).
The computation was performed on TERA NOVA (a 256 Intel-Itanium2 system
developped by BULL SA, installed in the CEA DAM open laboratory
TERA TECH). It required approximatively 80 000 CPU hours.
The complexity of the attack was about 2^51.
- une explication technique par ici : http://eprint.iacr.org/2004/199.pdf(...) ()
- une autre explication : http://www.rtfm.com/movabletype/archives/2004_08.html#001051(...)
- le code source : http://www.rtfm.com/md5coll.tar.gz(...)
- http://www.rtfm.com/movabletype/archives/2004_08.html(...)
bonne lecture et journée :-)
Je trolle dès quand ça parle business, sécurité et sciences sociales