Producing Collisions for PANAMA
| Venue: | Preproceedings of FSE2001, 8th Fast Software Encryption Worksop, Yokohama Japan, 2001. Copyright Copyright © 2000, 2001 2001 Hitachi, Hitachi, Ltd. Ltd. All All Rights Rights Reserved Reserved. Reserved |
| Citations: | 1 - 0 self |
BibTeX
@INPROCEEDINGS{Rijmen_producingcollisions,
author = {Vincent Rijmen and Bart Van Rompay and Bart Preneel and Joos V},
title = {Producing Collisions for PANAMA},
booktitle = {Preproceedings of FSE2001, 8th Fast Software Encryption Worksop, Yokohama Japan, 2001. Copyright Copyright © 2000, 2001 2001 Hitachi, Hitachi, Ltd. Ltd. All All Rights Rights Reserved Reserved. Reserved},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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. 1
Citations
No citations identified.
