Finding short integer solutions when the modulus is small
From MaRDI portal
Recommendations
- Hardness of SIS and LWE with small parameters
- Shorter hash-and-sign lattice-based signatures
- On the higher-bit version of approximate inhomogeneous short integer solution problem
- SeaSign: compact isogeny signatures from class group actions
- On the non-existence of short vectors in random module lattices
Cites work
- \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple
- \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon}
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- Factoring polynomials with rational coefficients
- scientific article; zbMATH DE number 1256724 (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
- Lattice attacks on NTRU and LWE: a history of refinements
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- New directions in nearest neighbor searching with applications to lattice sieving
- NTRU Fatigue: How Stretched is Overstretched?
- On Lovász' lattice reduction and the nearest lattice point problem
- On rejection sampling in Lyubashevsky's signature scheme
- Problems and Solutions
- Random sampling revisited: lattice enumeration with discrete pruning
- Shorter hash-and-sign lattice-based signatures
- Shortest vector from lattice sieving: a few dimensions for free
- Sieve algorithms for the shortest vector problem are practical
- The general sieve kernel and new records in lattice reduction
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Cited in
(11)- On Gaussian sampling, smoothing parameter and application to signatures
- Lattice-based threshold, accountable, and private signature
- Polytopes in the Fiat-Shamir with aborts paradigm
- Wagner's algorithm provably runs in subexponential time for \(\mathrm{SIS}^\infty \)
- NTRU+Sign: compact NTRU-based signatures using bimodal distributions
- Cryptanalysis of an efficient signature based on isotropic quadratic forms
- Discrete Gaussian sampling for BKZ-reduced basis
- Phoenix: hash-and-sign with aborts from lattice gadgets
- GPV preimage sampling with weak smoothness and its applications to lattice signatures
- A closer look at \textsc{Falcon}
- Cool + cruel = dual, and new benchmarks for sparse LWE
This page was built for publication: Finding short integer solutions when the modulus is small
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6145944)
