Difference between revisions of "PANAMA"
From The ECRYPT Hash Function Website
(→Collision Attacks) |
|||
| Line 21: | Line 21: | ||
=== Collision Attacks === | === Collision Attacks === | ||
| − | + | <bibtex> | |
| + | @inproceedings{fseRijmenRPV01, | ||
| + | owner = {tnad}, | ||
| + | author = {Vincent Rijmen and Bart Van Rompay and Bart Preneel and Joos Vandewalle}, | ||
| + | title = {Producing Collisions for PANAMA}, | ||
| + | pages = {37-51}, | ||
| + | url = {http://link.springer.de/link/service/series/0558/bibs/2355/23550037.htm}, | ||
| + | editor = {Mitsuru Matsui}, | ||
| + | booktitle = {FSE}, | ||
| + | publisher = {Springer}, | ||
| + | series = {LNCS}, | ||
| + | volume = {2355}, | ||
| + | year = {2002}, | ||
| + | isbn = {3-540-43869-6}, | ||
| + | abstract = {PANAMA is a cryptographic module that was presented at the FSE Workshop in ’98 by Joan Daemen and Craig Clapp. It can serve both as a stream cipher and as a cryptographic hash function, with a hash result of 256 bits. PANAMA achieves high performance (for large amounts of data) because of its inherent parallelism. We will analyse the security of PANAMA when used as a hash function, and demonstrate an attack able to find collisions much faster than by birthday attack. The computational complexity of our current attack is 2^82; the required amount of memory is negligible.}, | ||
| + | } | ||
| + | </bibtex> | ||
---- | ---- | ||
Revision as of 18:59, 10 March 2008
Contents
1 Specification
2 Cryptanalysis
2.1 Best Known Results
2.2 Generic Attacks
2.3 Collision Attacks
Vincent Rijmen, Bart Van Rompay, Bart Preneel, Joos Vandewalle - Producing Collisions for PANAMA
- FSE 2355:37-51,2002
- http://link.springer.de/link/service/series/0558/bibs/2355/23550037.htm
BibtexAuthor : Vincent Rijmen, Bart Van Rompay, Bart Preneel, Joos Vandewalle
Title : Producing Collisions for PANAMA
In : FSE -
Address :
Date : 2002
