On bounded distance decoding with predicate: breaking the ``lattice barrier'' for the hidden number problem
type: Item
instance of: scholarly article
title: On bounded distance decoding with predicate: breaking the ``lattice barrier'' for the hidden number problem
zbMATH Open document ID: 1479.94108
DOI: 10.1007/978-3-030-77870-5_19
author: Martin R. Albrecht
author: Nadia Heninger
publication date: 2021-12-08T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7440591
zbMATH Keywords: lattice-based algorithms
zbMATH Keywords: search problem
describes a project that uses: fpylll
describes a project that uses: G6K
describes a project that uses: fpLLL
MaRDI profile type: Publication
full work available at URL: 978-3-030-77870-5 19
OpenAlex ID: W3114185936
cites work: A sieve algorithm for the shortest lattice vector problem
cites work: Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)
cites work: On the complexity of the BKW algorithm on LWE
cites work: The general sieve kernel and new records in lattice reduction
cites work: Revisiting the expected cost of solving uSVP and applications to LWE
cites work: On the concrete hardness of learning with errors
cites work: Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
cites work: GLV/GLS Decomposition, Power Analysis, and Attacks on ECDSA Signatures with Single-Bit Nonce Bias
cites work: Q4598216
cites work: New directions in nearest neighbor searching with applications to lattice sieving
cites work: “Ooh Aah... Just a Little Bit” : A Small Amount of Side Channel Can Go a Long Way
cites work: Noise-tolerant learning, the parity problem, and the statistical query model
cites work: Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
cites work: Biased nonce sense: lattice attacks against weak ECDSA signatures in cryptocurrencies
cites work: Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
cites work: LWE with side information: attacks and concrete security estimation
cites work: Finding closest lattice vectors using approximate Voronoi cells
cites work: Shortest vector from lattice sieving: a few dimensions for free
cites work: Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
cites work: Q3549702
cites work: Lattice Enumeration Using Extreme Pruning
cites work: Advances in cryptology -- CRYPTO 2015. 35th annual cryptology conference, Santa Barbara, CA, USA, August 16--20, 2015. Proceedings. Part I
cites work: Coded-BKW: Solving LWE Using Lattice Codes
cites work: Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
cites work: Improved Algorithms for the Approximate k-List Problem in Euclidean Norm
cites work: On the asymptotic complexity of solving LWE
cites work: Lattice attacks on digital signature schemes
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: Q4952720
cites work: Progressive lattice sieving
cites work: Factoring polynomials with rational coefficients
cites work: Partially Known Nonces and Fault Injection Attacks on SM2 Signature Algorithm
cites work: Solving BDD by Enumeration: An Update
cites work: Lattice-based Cryptography
cites work: Q5417723
cites work: Fast Lattice Point Enumeration with Minimal Overhead
cites work: Practical, Predictable Lattice Basis Reduction
cites work: The insecurity of the digital signature algorithm with partially known nonces
cites work: Lattice-Based Fault Attacks on Signatures
cites work: Sieve algorithms for the shortest vector problem are practical
cites work: On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications
cites work: On lattices, learning with errors, random linear codes, and cryptography
cites work: A hierarchy of polynomial time lattice basis reduction algorithms
cites work: Lattice basis reduction: Improved practical algorithms and solving subset sum problems
description: scientific article; zbMATH DE number 7440591