Paper 2006/413
Preimage Attack on Parallel FFT-Hashing
Donghoon Chang
Abstract
Parallel FFT-Hashing was designed by C. P. Schnorr and S. Vaudenay
in 1993. The function is a simple and light weight hash algorithm
with 128-bit digest. Its basic component is a multi-permutation
which helps in proving its resistance to collision attacks.
%
In this work we show a preimage attack on Parallel FFT-Hashing with
complexity
Metadata
- Available format(s)
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Cryptographic Hash FunctionPreimage AttackParallel FFT-Hashing.
- Contact author(s)
- pointchang @ gmail com
- History
- 2007-01-30: last of 4 revisions
- 2006-11-14: received
- See all versions
- Short URL
- https://ia.cr/2006/413
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2006/413, author = {Donghoon Chang}, title = {Preimage Attack on Parallel {FFT}-Hashing}, howpublished = {Cryptology {ePrint} Archive, Paper 2006/413}, year = {2006}, url = {https://eprint.iacr.org/2006/413} }