Random Sampling Revisited: Lattice Enumeration with Discrete Pruning

DOI10.1007/978-3-319-56614-6_3zbMath1415.94404OpenAlexW2601026052WikidataQ57567980 ScholiaQ57567980MaRDI QIDQ5738970

Phong Q. Nguyen, Yoshinori Aono

Publication date: 13 June 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01502051/file/Eprint-155.pdf

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (12)

Dual lattice attacks for closest vector problems (with preprocessing) ⋮ Sieve, Enumerate, Slice, and Lift: ⋮ Shortest vector from lattice sieving: a few dimensions for free ⋮ On the Security of OSIDH ⋮ Predicting the concrete security of LWE against the dual attack using binary search ⋮ Finding short integer solutions when the modulus is small ⋮ Comment on: ``Sum of squares of uniform random variables by I. Weissman ⋮ Approximate Voronoi cells for lattices, revisited ⋮ Learning strikes again: the case of the DRS signature scheme ⋮ A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge ⋮ The randomized slicer for CVPP: sharper, faster, smaller, batchier ⋮ A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram-Schmidt lengths

Uses Software

• BKZ

Cites Work

• Unnamed Item
• Unnamed Item
• Factoring polynomials with rational coefficients
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• Lattice points in high-dimensional spheres
• A mean value theorem in geometry of numbers
• Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator
• Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
• Better Key Sizes (and Attacks) for LWE-Based Encryption
• BKZ 2.0: Better Lattice Security Estimates
• Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
• The Number of Lattice Points in a Set
• Lattice Enumeration Using Extreme Pruning
• Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
• On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications
• Problems and Solutions
• Closest point search in lattices
• Solving BDD by Enumeration: An Update
• On the Extremality of an 80-Dimensional Lattice
• Predicting Lattice Reduction
• Algorithmic Number Theory
• Algorithmic Number Theory

This page was built for publication: Random Sampling Revisited: Lattice Enumeration with Discrete Pruning