Cited in
(only showing first 100 items - show all)- RLizard
- Quantum hardness of learning shallow classical circuits
- Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes
- An experimental study of Kannan's embedding technique for the search LWE problem
- Learning strikes again: the case of the DRS signature scheme
- Revisiting orthogonal lattice attacks on approximate common divisor problems
- Analysis of error terms of signatures based on learning with errors
- A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack
- Post-quantum cryptography: state of the art
- Improved broadcast attacks against subset sum problems via lattice oracle
- Predicting truncated multiple recursive generators with unknown parameters
- Attacking ECDSA leaking discrete bits with a more efficient lattice
- A physical study of the LLL algorithm
- Secure statistical analysis using RLWE-based homomorphic encryption
- On pairwise Gaussian bases and LLL algorithm for three dimensional lattices
- A signature scheme from the finite field isomorphism problem
- Flattening NTRU for evaluation key free homomorphic encryption
- Recovering secrets from prefix-dependent leakage
- A lattice reduction algorithm based on sublattice BKZ
- The irreducible vectors of a lattice: some theory and applications
- A trace map attack against special ring-LWE samples
- Shortest vectors in lattices of Bai-Galbraith's embedding attack on the LWR problem
- Improved lattice enumeration algorithms by primal and dual reordering methods
- A tale of three signatures: practical attack of ECDSA with wNAF
- Practical FHE parameters against lattice attacks
- Hawk
- Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices
- \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance
- Systematics of aligned axions
- A polynomial-time algorithm for solving the hidden subset sum problem
- Towards faster polynomial-time lattice reduction
- TFHE: fast fully homomorphic encryption over the torus
- Estimation of the hardness of the learning with errors problem with a restricted number of samples
- The Bussard-Bagga and Other Distance-Bounding Protocols under Attacks
- Lattice-based SNARGs and their application to more efficient obfuscation
- LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme
- Analysis of DeepBKZ reduction for finding short lattice vectors
- An improved compression technique for signatures based on learning with errors
- Secret computation of purchase history data using somewhat homomorphic encryption
- Post-quantum key exchange for the Internet and the open quantum safe project
- Sieve, Enumerate, Slice, and Lift:
- One-shot verifiable encryption from lattices
- Random sampling revisited: lattice enumeration with discrete pruning
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Gauss sieve algorithm on GPUs
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- Faster algorithms for approximate common divisors: breaking fully-homomorphic-encryption challenges over the integers
- Lattice-based fault attacks on deterministic signature schemes of ECDSA and EdDSA
- Hardness of SIS and LWE with small parameters
- Modular lattice signatures, revisited
- ETRU: NTRU over the Eisenstein integers
- PotLLL: a polynomial time version of LLL with deep insertions
- Quantum-walk speedup of backtracking algorithms
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Lattice Reduction for Modular Knapsack
- Coded-BKW: solving LWE using lattice codes
- Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
- NTL
- BLISS
- HElib
- CFS
- DeepLLL
- PotLLL
- ETRU
- MaTRU
- NTRU
- NTRUSign
- SWIFFT
- fpLLL
- NTRUEncrypt
- McBits
- FHEW
- ring-LWE
- fhe
- liboqs
- Saber
- Falcon
- fpylll
- OTRU
- TFHE
- FrodoKEM
- Parallel implementation of \textsf{BDD} enumeration for \textsf{LWE}
- Improved security for a ring-based fully homomorphic encryption scheme
- Estimating key sizes for high dimensional lattice-based systems
- The general sieve kernel and new records in lattice reduction
- BLAZE
- PALISADE
- Multiparty Computation from Somewhat Homomorphic Encryption
- A non-commutative cryptosystem based on quaternion algebras
- Choosing parameters for NTRUEncrypt
- On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL
- Homomorphic AES evaluation using the modified LTV scheme
- Predicting the concrete security of LWE against the dual attack using binary search
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)
- Lattice-based blind signatures, revisited
- Homomorphic Encryption Standard
- Improving convergence and practicality of slide-type reductions
- An efficient lattice reduction using reuse technique blockwisely on NTRU
This page was built for software: BKZ
