Secure parameters for SWIFFT

DOI10.1007/978-3-642-10628-6_1zbMATH Open1273.94343OpenAlexW1557689908WikidataQ21740534 ScholiaQ21740534MaRDI QIDQ3652308FDOQ3652308

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

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

zbMATH Keywords

latticeshash functionspost-quantum cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (6)

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

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)