On the success probability of solving unique SVP via BKZ

DOI10.1007/978-3-030-75245-3_4zbMath1479.94244OpenAlexW3097572003MaRDI QIDQ2061913

Eamonn W. Postlethwaite, Fernando Virdia

Publication date: 21 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-75245-3_4

zbMATH Keywords

cryptanalysislattice-based cryptographylattice reduction

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (5)

Solving the search-LWE problem over projected lattices ⋮ An extension of Kannan's embedding for solving ring-based LWE problems ⋮ NTRU Fatigue: How Stretched is Overstretched? ⋮ Revisiting lower dimension lattice attacks on NTRU ⋮ \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the concrete hardness of learning with errors
• Factoring polynomials with rational coefficients
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• Measuring, simulating and exploiting the head concavity phenomenon in BKZ
• Estimate all the {LWE, NTRU} schemes!
• Slide reduction, revisited -- filling the gaps in SVP approximation
• LWE with side information: attacks and concrete security estimation
• A refined analysis of the cost for solving LWE via uSVP
• The general sieve kernel and new records in lattice reduction
• Revisiting the expected cost of solving uSVP and applications to LWE
• Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator
• Practical, Predictable Lattice Basis Reduction
• New Algorithms for Learning in Presence of Errors
• BKZ 2.0: Better Lattice Security Estimates
• On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• On the Efficacy of Solving LWE by Reduction to Unique-SVP
• Coded-BKW: Solving LWE Using Lattice Codes
• An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices
• MPFR
• A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
• Lattice-based Cryptography
• Minkowski's Convex Body Theorem and Integer Programming
• Solving BDD by Enumeration: An Update
• Lattice Decoding Attacks on Binary LWE
• Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
• Predicting Lattice Reduction
• On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: On the success probability of solving unique SVP via BKZ