Parallel FFT-hashing

DOI10.1007/3-540-58108-1_18MaRDI QIDQ4499405zbMATH OpenFDO

Authors Serge Vaudenay, Claus Peter Schnorr

Publication date 30 August 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-58108-1_18

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• SWIFFT: A Modest Proposal for FFT Hashing
• scientific article; zbMATH DE number 708835
• Preimage Attack on the Parallel FFT-Hashing Function
• scientific article; zbMATH DE number 503325

Cited in

(8)

• \textsc{KangarooTwelve}: fast hashing based on \({\mathrm {KECCAK}\mathrm{-}p}{}\)
• Fast hash functions and convolution product
• Generalization of Siegenthaler inequality and Schnorr-Vaudenay multipermutations
• SWIFFT: A Modest Proposal for FFT Hashing
• Preimage Attack on the Parallel FFT-Hashing Function
• scientific article; zbMATH DE number 503326 (Why is no real title available?)
• CS-Cipher
• PARSHA-256 -- a new parallelizable hash function and a multithreaded implementation.

This page was built for publication: Parallel FFT-hashing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4499405)