Lattice enumeration using extreme pruning
From MaRDI portal
Recommendations
Cited in
(83)- Quantum lattice enumeration and tweaking discrete pruning
- Shortest vector from lattice sieving: a few dimensions for free
- On the asymptotic complexity of solving LWE
- Sieving for closest lattice vectors (with preprocessing)
- Comment on: ``Sum of squares of uniform random variables by I. Weissman
- Second order statistical behavior of LLL and BKZ
- Lower bounds on lattice enumeration with extreme pruning
- Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme
- Analysis of DeepBKZ reduction for finding short lattice vectors
- Approximate Voronoi cells for lattices, revisited
- The randomized slicer for CVPP: sharper, faster, smaller, batchier
- On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem
- Advanced lattice sieving on GPUs, with tensor cores
- 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
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance
- Towards faster polynomial-time lattice reduction
- Lower bounds on lattice sieving and information set decoding
- Solving the search-LWE problem over projected lattices
- An extension of Kannan's embedding for solving ring-based LWE problems
- On a dual/hybrid approach to small secret LWE. A dual/enumeration technique for learning with errors and application to security estimates of FHE schemes
- \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption
- Self-dual DeepBKZ for finding short lattice vectors
- Improved broadcast attacks against subset sum problems via lattice oracle
- Dynamic self-dual DeepBKZ lattice reduction with free dimensions and its implementation
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- On the complexity of the BKW algorithm on LWE
- Modular lattice signatures, revisited
- Estimation of the hardness of the learning with errors problem with a restricted number of samples
- Predicting the concrete security of LWE against the dual attack using binary search
- The irreducible vectors of a lattice: some theory and applications
- Just a Little Bit More
- Parallel implementation of \textsf{BDD} enumeration for \textsf{LWE}
- A sieve algorithm based on overlattices
- A fast phase-based enumeration algorithm for SVP challenge through \(y\)-sparse representations of short lattice vectors
- Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing
- Gauss sieve algorithm on GPUs
- Algorithms for the shortest and closest lattice vector problems
- Better key sizes (and attacks) for LWE-based encryption
- Analysis of Gauss-sieve for solving the shortest vector problem in lattices
- A Parallel Implementation of GaussSieve for the Shortest Vector Problem in Lattices
- Partially Known Nonces and Fault Injection Attacks on SM2 Signature Algorithm
- Rigorous and Efficient Short Lattice Vectors Enumeration
- Another 80-dimensional extremal lattice
- Solving BDD by enumeration: an update
- 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
- Fast lattice point enumeration with minimal overhead
- Random sampling revisited: lattice enumeration with discrete pruning
- On the hardness of the finite field isomorphism problem
- Development and analysis of massive parallelization of a lattice basis reduction algorithm
- Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation
- Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation
- Lattice-based cryptography: a survey
- BS: Blockwise Sieve Algorithm for Finding Short Vectors from Sublattices
- New NTRU Records with Improved Lattice Bases
- Concrete analysis of quantum lattice enumeration
- Memory-efficient attacks on small LWE keys
- On the concrete security of LWE with small secret
- Memory-efficient attacks on small LWE keys
- Further improvements of the estimation of key enumeration with applications to solving LWE
- Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems
- Quantum lattice enumeration in limited depth
- On counterexamples to the Mertens conjecture
- A complete analysis of the BKZ lattice reduction algorithm
- On the smallest ratio problem of lattice bases
- On the ability to approximate k-DSP of HKZ, BKZ and slide reduction
- A quasi-polynomial time algorithm for the extrapolated dihedral coset problem over power-of-two moduli
- On tiny-probability lattice enumeration
- Main approaches in post-quantum cryptography: description, a comparative study
- 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
- A new quantum oracle model for a hybrid quantum-classical attack on post-quantum lattice-based cryptosystems
- Improved classical and quantum algorithms for the shortest vector problem via bounded distance decoding
- Analyzing pump and jump BKZ algorithm using dynamical systems
- Improved provable reduction of NTRU and hypercubic lattices
- Towards a modern LLL implementation
- Improved (provable) algorithms for the shortest vector problem via bounded distance decoding
- A new BKZ-type reduction with provable termination and development of its self-dual variant
- Towards large-scale lattice attack: new lattice records by disk-based sieving
- Cross-paradigm models of restricted syndrome decoding with application to CROSS
- Finding shortest lattice vectors faster using quantum search
This page was built for publication: Lattice enumeration using extreme pruning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3563839)
