Title: Producing Collisions for PANAMA
Authors: Rijmen, Vincent ×
Van Rompay, B
Preneel, Bart
Vandewalle, Joos #
Issue Date: 2002
Publisher: Springer
Series Title: Lecture Notes in Computer Science vol:2355 pages:37-51
Conference: FSE 2001 date:April 02-04, 2001
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.
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IT
Appears in Collections:ESAT - STADIUS, Stadius Centre for Dynamical Systems, Signal Processing and Data Analytics
× corresponding author
# (joint) last author

Files in This Item:
File Status SizeFormat
article-81.pdf Published 148KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science