Predicting module-lattice reduction
From MaRDI portal
closest vector problem oraclecryptographic designGauss' algorithmlattice reduction algorithmsmodule lattices
Lattices and convex bodies (number-theoretic aspects) (11H06) Number-theoretic algorithms; complexity (11Y16) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Cites work
- \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple
- \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon}
- A hierarchy of polynomial time lattice basis reduction algorithms
- A mean value theorem in geometry of numbers
- A refined hardness estimation of LWE in two-step mode
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Advanced lattice sieving on GPUs, with tensor cores
- Algorithms in HElib
- An LLL algorithm for module lattices
- Analyzing blockwise lattice algorithms using dynamical systems
- BKZ 2.0: Better lattice security estimates
- Cyclotomic modular lattices
- Efficient public key encryption based on ideal lattices (extended abstract)
- Factoring polynomials with rational coefficients
- Fast Fourier orthogonalization
- Faster exponential time algorithms for the shortest vector problem
- Finding dense submodules with algebraic lattice reduction
- Finding short lattice vectors within Mordell's inequality
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 3760283 (Why is no real title available?)
- scientific article; zbMATH DE number 1962809 (Why is no real title available?)
- Improved progressive BKZ algorithms and their precise cost estimation by sharp simulator
- Large FHE gates from tensored homomorphic accumulator
- Lattice attacks on NTRU and LWE: a history of refinements
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP
- LWE with side information: attacks and concrete security estimation
- Making NTRU as secure as worst-case problems over ideal lattices
- Measuring, simulating and exploiting the head concavity phenomenon in BKZ
- New directions in nearest neighbor searching with applications to lattice sieving
- NTRU Fatigue: How Stretched is Overstretched?
- On Gaussian sampling, smoothing parameter and application to signatures
- On ideal lattices and learning with errors over rings
- On Lovász' lattice reduction and the nearest lattice point problem
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography
- On the Poisson distribution of lengths of lattice vectors in a random lattice
- On the success probability of solving unique SVP via BKZ
- Practical, Predictable Lattice Basis Reduction
- Predicting Lattice Reduction
- Progressive lattice sieving
- Recovering short generators of principal ideals in cyclotomic rings
- Ring-LWE in polynomial rings
- Second order statistical behavior of LLL and BKZ
- Short bases of lattices over number fields
- Shortest vector from lattice sieving: a few dimensions for free
- Sieving for shortest vectors in ideal lattices: a practical perspective
- The closest vector problem in tensored root lattices of type A and in their duals
- The general sieve kernel and new records in lattice reduction
- The Number of Lattice Points in a Set
- Tours de corps de classes et estimations de discriminants
- Worst-case to average-case reductions for module lattices
This page was built for publication: Predicting module-lattice reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7228242)
