Difference between revisions of "PANAMA"
From The ECRYPT Hash Function Website
(→Best Known Results) |
(→Best Known Results) |
||
| Line 28: | Line 28: | ||
=== Best Known Results === | === Best Known Results === | ||
| − | The best collision attack on PANAMA was presented by | + | The best collision attack on PANAMA was presented by Daemen and Van Assche. The attack has a complexity of about attack 2<sup>6</sup> evaluations of the state updating function. |
---- | ---- | ||
Revision as of 12:55, 11 March 2008
Contents
1 Specification
- digest size: 256 bits
- max. message length: arbitrary length
- compression function: 256-bit message block, > 1 Kbyte chaining state
- Specification:
Joan Daemen, Craig S. K. Clapp - Fast Hashing and Stream Encryption with PANAMA
- FSE 1372:60-74,1998
- http://link.springer.de/link/service/series/0558/bibs/1372/13720060.htm
BibtexAuthor : Joan Daemen, Craig S. K. Clapp
Title : Fast Hashing and Stream Encryption with PANAMA
In : FSE -
Address :
Date : 1998
2 Cryptanalysis
2.1 Best Known Results
The best collision attack on PANAMA was presented by Daemen and Van Assche. The attack has a complexity of about attack 26 evaluations of the state updating function.
2.2 Generic Attacks
- PANAMA is not a design follwing the Merkle-Damgaard construction principle. Generic Attacks on Hash Functions
2.3 Collision Attacks
Joan Daemen, Gilles Van Assche - Producing Collisions for Panama, Instantaneously
- FSE 4593:1-18,2007
- http://dx.doi.org/10.1007/978-3-540-74619-5_1
BibtexAuthor : Joan Daemen, Gilles Van Assche
Title : Producing Collisions for Panama, Instantaneously
In : FSE -
Address :
Date : 2007
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
