SWIFFT: A Modest Proposal for FFT Hashing
From MaRDI portal
Recommendations
Cited in
(54)- BLOOM: bimodal lattice one-out-of-many proofs and applications
- Augmented Learning with Errors: The Untapped Potential of the Error Term
- A new Gaussian sampling for trapdoor lattices with arbitrary modulus
- When NTT meets Karatsuba: preprocess-then-NTT technique revisited
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Rigorous and Efficient Short Lattice Vectors Enumeration
- The geometry of lattice cryptography
- Memory lower bounds of reductions revisited
- Computing generator in cyclotomic integer rings. A subfield algorithm for the principal ideal problem in \(L_{|\varDelta_\mathbb {K}|}\left(\frac{1}{2}\right)\) and application to the cryptanalysis of a FHE scheme
- Survey of information security
- An intermediate secret-guessing attack on hash-based signatures
- The extended \(k\)-tree algorithm
- How to prove knowledge of small secrets
- On the security of homomorphic encryption on approximate numbers
- MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
- Analysis of Multivariate Hash Functions
- Fast hash functions and convolution product
- Hash Functions from Sigma Protocols and Improvements to VSH
- Efficient lattice-based inner-product functional encryption
- Dakota – Hashing from a Combination of Modular Arithmetic and Symmetric Cryptography
- Asymptotically Efficient Lattice-Based Digital Signatures
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- A Parallel GPU Implementation of SWIFFTX
- \textsc{KangarooTwelve}: fast hashing based on \({\mathrm {KECCAK}\mathrm{-}p}{}\)
- Algorithm construction of HLI hash function
- Vive Galois! I: Optimal SIMD packing and packed bootstrapping for FHE
- SWIFFT
- Discriminants of number fields
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Really fast syndrome-based hashing
- An efficient post-quantum one-time signature scheme
- Improved Zero-Knowledge Identification with Lattices
- Pseudorandom functions: three decades later
- On the complexity of the BKW algorithm on LWE
- Cryptography from learning parity with noise
- ETRU: NTRU over the Eisenstein integers
- Cryptographic functions from worst-case complexity assumptions
- A pseudorandom number generator based on worst-case lattice problems
- Secure parameters for SWIFFT
- A characterization of chameleon hash functions and new, efficient designs
- Efficient post-quantum SNARKs for RSIS and RLWE and their applications to privacy
- Interpreting hash function security proofs
- Improved information set decoding for code-based cryptosystems with constrained memory
- Scalable zero knowledge via cycles of elliptic curves
- Lossy cryptography from code-based assumptions
- How to Build a Hash Function from Any Collision-Resistant Function
- Post-quantum cryptography: lattice signatures
- CCA updatable encryption against malicious re-encryption attacks
- D-NTRU: more efficient and average-case IND-CPA secure NTRU variant
- Lossy cryptography from code-based assumptions dense-sparse LPN: a new subexponentially hard LPN variant in SZK
- Lattice Point Enumeration on Block Reduced Bases
- Amortized complexity of zero-knowledge proofs revisited: achieving linear soundness slack
- Two-message authenticated key exchange from public-key encryption
- Improved combinatorial algorithms for the inhomogeneous short integer solution problem
This page was built for publication: SWIFFT: A Modest Proposal for FFT Hashing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525661)
