Cited in
(77)- Application of mixed integer quadratic program to shortest vector problems
- Hawk
- Exact result in \(\mathcal{N} = 4\) SYM theory: generalised double-logarithmic equation
- A polynomial-time algorithm for solving the hidden subset sum problem
- Fast reduction of algebraic lattices over cyclotomic fields
- Dynamic self-dual DeepBKZ lattice reduction with free dimensions and its implementation
- Solving thousand-digit Frobenius problems using Gröbner bases
- Arithmetic software libraries
- Analysis of DeepBKZ reduction for finding short lattice vectors
- Sieve, Enumerate, Slice, and Lift:
- Cryptanalysis of a homomorphic encryption scheme over integers
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Six-loop anomalous dimension of twist-two operators in planar \( \mathcal{N}=4 \) SYM theory
- Handbook of floating-point arithmetic
- On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem
- On the security of OSIDH
- A formalization of the LLL basis reduction algorithm
- Just a Little Bit More
- Algorithms for the shortest and closest lattice vector problems
- Lattice Reduction for Modular Knapsack
- Algorithms for CRT-variant of approximate greatest common divisor problem
- NTL
- BLISS
- Frobby
- VMWare
- HElib
- BKZ
- DeepLLL
- PotLLL
- ETRU
- MaTRU
- NTRU
- NTRUSign
- SWIFFT
- SoftFloat
- NTRUEncrypt
- CAMPARY
- FLIP
- CR-LIBM
- fhe
- doubledouble
- DPE
- LLL Factorization
- Verified LLL
- Vector Spaces
- Falcon
- Ed25519
- fpylll
- Computations of the Mertens function and improved bounds on the Mertens conjecture
- The general sieve kernel and new records in lattice reduction
- An extension of Kannan's embedding for solving ring-based LWE problems
- mitmproxy
- On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL
- Rigorous and Efficient Short Lattice Vectors Enumeration
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)
- 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
- Improving convergence and practicality of slide-type reductions
- A lattice reduction algorithm based on sublattice BKZ
- The irreducible vectors of a lattice: some theory and applications
- An improved method for predicting truncated multiple recursive generators with unknown parameters
- (In)security of ring-LWE under partial key exposure
- Bounding basis reduction properties
- G6K
- Self-dual DeepBKZ for finding short lattice vectors
- Analysis of Gauss-sieve for solving the shortest vector problem in lattices
- Lattice-packing by spheres and eutactic forms
- A tale of three signatures: practical attack of ECDSA with wNAF
- A verified efficient implementation of the LLL basis reduction algorithm
- Lower bounds on lattice enumeration with extreme pruning
- Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme
- Practical cryptanalysis of a public-key encryption scheme based on new multivariate quadratic assumptions
- Solving the search-LWE problem over projected lattices
- LWE with side information: attacks and concrete security estimation
- Computing genus 1 Jacobi forms
- Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices
- Coppersmith's lattices and ``focus groups: an attack on small-exponent RSA
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance
This page was built for software: fpLLL
