Cited in
(67)- A new Gaussian sampling for trapdoor lattices with arbitrary modulus
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- 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
- A Modular Design for Hash Functions: Towards Making the Mix-Compress-Mix Approach Practical
- A lattice-based threshold ring signature scheme
- New generic algorithms for hard knapsacks
- Improving BDD cryptosystems in general lattices
- The geometry of lattice cryptography
- Parallel shortest lattice vector enumeration on graphics cards
- Full Lattice Basis Reduction on Graphics Cards
- 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
- An intermediate secret-guessing attack on hash-based signatures
- The extended \(k\)-tree algorithm
- Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
- How to prove knowledge of small secrets
- MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
- Hash Functions from Sigma Protocols and Improvements to VSH
- Construction of family of hash functions based on ideal lattice
- A Parallel GPU Implementation of SWIFFTX
- Algorithm construction of HLI hash function
- NTL
- McEliece
- KEM-DEM
- ETRU
- MaTRU
- NTRU
- NTRUSign
- ring-LWE
- QUAD
- ADSNARK
- Plutus
- SiRiUS
- Lattice-Based Identification Schemes Secure Under Active Attacks
- An efficient post-quantum one-time signature scheme
- Improved Zero-Knowledge Identification with Lattices
- Improved short lattice signatures in the standard model
- 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 ciphertext policy attribute-based encryption scheme without pairings
- A pseudorandom number generator based on worst-case lattice problems
- A characterization of chameleon hash functions and new, efficient designs
- Explicit Hard Instances of the Shortest Vector Problem
- Silver
- Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
- Efficient post-quantum SNARKs for RSIS and RLWE and their applications to privacy
- Making NTRU as secure as worst-case problems over ideal lattices
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Interpreting hash function security proofs
- A toolkit for ring-LWE cryptography
- Improved information set decoding for code-based cryptosystems with constrained memory
- Scalable zero knowledge via cycles of elliptic curves
- FACCT
- CryptoStreams
- EACirc
- Scalable zero knowledge via cycles of elliptic curves
- Post-quantum cryptography: lattice signatures
- CCA updatable encryption against malicious re-encryption attacks
- Towards efficient arithmetic for lattice-based cryptography on reconfigurable hardware
- SWIFFTX
- D-NTRU: more efficient and average-case IND-CPA secure NTRU variant
- Amortized complexity of zero-knowledge proofs revisited: achieving linear soundness slack
- Improved combinatorial algorithms for the inhomogeneous short integer solution problem
This page was built for software: SWIFFT
