SWIFFT: A Modest Proposal for FFT Hashing
From MaRDI portal
Publication:3525661
DOI10.1007/978-3-540-71039-4_4zbMath1154.68403OpenAlexW1525538795WikidataQ21681000 ScholiaQ21681000MaRDI QIDQ3525661
Chris Peikert, Vadim Lyubashevsky, Alon Rosen, Daniele Micciancio
Publication date: 18 September 2008
Published in: Fast Software Encryption (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-71039-4_4
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Numerical methods for discrete and fast Fourier transforms (65T50) Theory of software (68N99)
Related Items (44)
Efficient Post-quantum SNARKs for RSIS and RLWE and Their Applications to Privacy ⋮ An intermediate secret-guessing attack on hash-based signatures ⋮ Cryptography from Learning Parity with Noise ⋮ Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory ⋮ Survey of information security ⋮ Memory lower bounds of reductions revisited ⋮ Faster Gaussian sampling for trapdoor lattices with arbitrary modulus ⋮ Post-quantum cryptography: lattice signatures ⋮ A pseudorandom number generator based on worst-case lattice problems ⋮ When NTT meets Karatsuba: preprocess-then-NTT technique revisited ⋮ Lattice Point Enumeration on Block Reduced Bases ⋮ Augmented Learning with Errors: The Untapped Potential of the Error Term ⋮ Scalable zero knowledge via cycles of elliptic curves ⋮ Dakota – Hashing from a Combination of Modular Arithmetic and Symmetric Cryptography ⋮ MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity ⋮ BLOOM: bimodal lattice one-out-of-many proofs and applications ⋮ D-NTRU: more efficient and average-case IND-CPA secure NTRU variant ⋮ Efficient lattice-based inner-product functional encryption ⋮ CCA updatable encryption against malicious re-encryption attacks ⋮ The extended \(k\)-tree algorithm ⋮ Improved combinatorial algorithms for the inhomogeneous short integer solution problem ⋮ Analysis of Multivariate Hash Functions ⋮ How to Build a Hash Function from Any Collision-Resistant Function ⋮ A characterization of chameleon hash functions and new, efficient designs ⋮ ETRU: NTRU over the Eisenstein integers ⋮ On the complexity of the BKW algorithm on LWE ⋮ Computing Generator in Cyclotomic Integer Rings ⋮ Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack ⋮ Improved Zero-Knowledge Identification with Lattices ⋮ Interpreting Hash Function Security Proofs ⋮ Cryptographic Functions from Worst-Case Complexity Assumptions ⋮ Hash Functions from Sigma Protocols and Improvements to VSH ⋮ Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems ⋮ Rigorous and Efficient Short Lattice Vectors Enumeration ⋮ Lattice-Based Identification Schemes Secure Under Active Attacks ⋮ Asymptotically Efficient Lattice-Based Digital Signatures ⋮ An Efficient Post-Quantum One-Time Signature Scheme ⋮ On the security of homomorphic encryption on approximate numbers ⋮ SWIFFT ⋮ The Geometry of Lattice Cryptography ⋮ How to Prove Knowledge of Small Secrets ⋮ A new Gaussian sampling for trapdoor lattices with arbitrary modulus ⋮ A Parallel GPU Implementation of SWIFFTX ⋮ Pseudorandom Functions: Three Decades Later
Uses Software
This page was built for publication: SWIFFT: A Modest Proposal for FFT Hashing
