On the success probability of solving unique SVP via BKZ
type: Item
instance of: scholarly article
title: On the success probability of solving unique SVP via BKZ
zbMATH Open document ID: 1479.94244
DOI: 10.1007/978-3-030-75245-3_4
author: Eamonn W. Postlethwaite
author: Fernando Virdia
publication date: 2021-12-21T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 7450176
zbMATH Keywords: cryptanalysis
zbMATH Keywords: lattice-based cryptography
zbMATH Keywords: lattice reduction
MaRDI profile type: Publication
full work available at URL: 978-3-030-75245-3 4
OpenAlex ID: W3097572003
cites work: Estimate all the {LWE, NTRU} schemes!
cites work: Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
cites work: The general sieve kernel and new records in lattice reduction
cites work: On the Efficacy of Solving LWE by Reduction to Unique-SVP
cites work: New Algorithms for Learning in Presence of Errors
cites work: Revisiting the expected cost of solving uSVP and applications to LWE
cites work: On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL
cites work: Slide reduction, revisited -- filling the gaps in SVP approximation
cites work: On the concrete hardness of learning with errors
cites work: Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator
cites work: Lattice Decoding Attacks on Binary LWE
cites work: A refined analysis of the cost for solving LWE via uSVP
cites work: Measuring, simulating and exploiting the head concavity phenomenon in BKZ
cites work: BKZ 2.0: Better Lattice Security Estimates
cites work: LWE with side information: attacks and concrete security estimation
cites work: MPFR
cites work: Coded-BKW: Solving LWE Using Lattice Codes
cites work: Q3549702
cites work: Predicting Lattice Reduction
cites work: A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
cites work: Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
cites work: Minkowski's Convex Body Theorem and Integer Programming
cites work: An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices
cites work: Q5810209
cites work: Factoring polynomials with rational coefficients
cites work: On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
cites work: Solving BDD by Enumeration: An Update
cites work: Lattice-based Cryptography
cites work: Practical, Predictable Lattice Basis Reduction
cites work: On lattices, learning with errors, random linear codes, and cryptography
cites work: Q4418644
cites work: Q4266548
cites work: Lattice basis reduction: Improved practical algorithms and solving subset sum problems
cites work: Q2783518
description: scientific article; zbMATH DE number 7450176