scientific article; zbMATH DE number 1962809
From MaRDI portal
Publication:4418644
Recommendations
- A hierarchy of polynomial time lattice basis reduction algorithms
- scientific article; zbMATH DE number 3958726
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- A sieve algorithm for the shortest lattice vector problem
- scientific article; zbMATH DE number 1643923
Cited in
(61)- On the asymptotic complexity of solving LWE
- Second order statistical behavior of LLL and BKZ
- NTRU prime: reducing attack surface at low cost
- Random lattices, threshold phenomena and efficient reduction algorithms.
- Analysis of DeepBKZ reduction for finding short lattice vectors
- On the success probability of solving unique SVP via BKZ
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)
- Improved lattice enumeration algorithms by primal and dual reordering methods
- A physical study of the LLL algorithm
- Revisiting orthogonal lattice attacks on approximate common divisor problems
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance
- Solving the search-LWE problem over projected lattices
- An extension of Kannan's embedding for solving ring-based LWE problems
- \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption
- Dynamic self-dual DeepBKZ lattice reduction with free dimensions and its implementation
- A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram-Schmidt lengths
- Practical \(\mathsf{MP} \text{- }\mathsf{LWE}\)-based encryption balancing security-risk versus efficiency
- Fast LLL-type lattice reduction
- A lattice reduction algorithm based on sublattice BKZ
- scientific article; zbMATH DE number 1676629 (Why is no real title available?)
- Lattice Point Enumeration on Block Reduced Bases
- A practical post-quantum public-key cryptosystem based on spLWE
- Better key sizes (and attacks) for LWE-based encryption
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- An experimental study of Kannan's embedding technique for the search LWE problem
- Explicit Hard Instances of the Shortest Vector Problem
- Recursive lattice reduction
- scientific article; zbMATH DE number 1405803 (Why is no real title available?)
- A survey of solving SVP algorithms and recent strategies for solving the SVP challenge
- Sieve, Enumerate, Slice, and Lift:
- Analysis of decreasing squared-sum of Gram-Schmidt lengths for short lattice vectors
- Algorithms and Computation
- Speeding-Up Lattice Reduction with Random Projections (Extended Abstract)
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- Random sampling revisited: lattice enumeration with discrete pruning
- On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL
- Algorithmic Number Theory
- Generalized attack on ECDSA: known bits in arbitrary positions
- On the measurement and simulation of the BKZ behavior for \(q\)-ary lattices
- Development and analysis of massive parallelization of a lattice basis reduction algorithm
- Finding short integer solutions when the modulus is small
- BS: Blockwise Sieve Algorithm for Finding Short Vectors from Sublattices
- New NTRU Records with Improved Lattice Bases
- Concrete analysis of quantum lattice enumeration
- Provable dual attacks on learning with errors
- Assessing the impact of a variant of MATZOV's dual attack on Kyber
- On tiny-probability lattice enumeration
- A new random sampling method and its application in improving progressive BKZ algorithm
- Attacking ECDSA with nonce leakage by lattice sieving: bridging the gap with Fourier analysis-based attacks
- Discrete Gaussian sampling for BKZ-reduced basis
- Current paradigms for construction of lattice-based digital signature schemes
- Finding dense submodules with algebraic lattice reduction
- Guidance for efficient selection of secure parameters for fully homomorphic encryption
- Improved provable reduction of NTRU and hypercubic lattices
- Towards a modern LLL implementation
- Fast slicer for Batch-CVP: making lattice hybrid attacks practical
- Predicting module-lattice reduction
- A new BKZ-type reduction with provable termination and development of its self-dual variant
- Cross-paradigm models of restricted syndrome decoding with application to CROSS
- Refined modelling of the primal attack, and variants against Module-LWE
- Finding shortest lattice vectors faster using quantum search
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4418644)
