Secure parameters for SWIFFT

DOI10.1007/978-3-642-10628-6_1MaRDI QIDQ3652308zbMATH OpenOpenAlexWikidataFDO

Authors Richard Lindner, Johannes Buchmann

Publication date 17 December 2009

Published in Progress in Cryptology - INDOCRYPT 2009 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-10628-6_1

zbMATH Keywords

hash functionslatticespost-quantum cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• SWIFFT: A Modest Proposal for FFT Hashing
• Generalized Compact Knapsacks Are Collision Resistant
• Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
• Theory of Cryptography
• Algorithm construction of HLI hash function

Cited in

(6)

• A pseudorandom number generator based on worst-case lattice problems
• Improved combinatorial algorithms for the inhomogeneous short integer solution problem
• Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
• Algorithm construction of HLI hash function
• SWIFFT: A Modest Proposal for FFT Hashing
• Interpreting hash function security proofs

This page was built for publication: Secure parameters for SWIFFT

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