On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem
From MaRDI portal
Publication:2056699
DOI10.1007/978-3-030-77870-5_19zbMath1479.94108OpenAlexW3114185936MaRDI QIDQ2056699
Nadia Heninger, Martin R. Albrecht
Publication date: 8 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-77870-5_19
Related Items (7)
Generalized attack on ECDSA: known bits in arbitrary positions ⋮ EHNP strikes back: analyzing SM2 implementations ⋮ Handle the traces: revisiting the attack on ECDSA with EHNP ⋮ Improving bounds on elliptic curve hidden number problem for ECDH key exchange ⋮ A third is all you need: extended partial key exposure attack on CRT-RSA with additive exponent blinding ⋮ The curious case of the half-half Bitcoin ECDSA nonces ⋮ An improved method for predicting truncated multiple recursive generators with unknown parameters
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the concrete hardness of learning with errors
- A hierarchy of polynomial time lattice basis reduction algorithms
- Factoring polynomials with rational coefficients
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Progressive lattice sieving
- Shortest vector from lattice sieving: a few dimensions for free
- On the asymptotic complexity of solving LWE
- The insecurity of the digital signature algorithm with partially known nonces
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)
- LWE with side information: attacks and concrete security estimation
- On the complexity of the BKW algorithm on LWE
- The general sieve kernel and new records in lattice reduction
- Finding closest lattice vectors using approximate Voronoi cells
- Revisiting the expected cost of solving uSVP and applications to LWE
- Advances in cryptology -- CRYPTO 2015. 35th annual cryptology conference, Santa Barbara, CA, USA, August 16--20, 2015. Proceedings. Part I
- Biased nonce sense: lattice attacks against weak ECDSA signatures in cryptocurrencies
- Practical, Predictable Lattice Basis Reduction
- Lattice-Based Fault Attacks on Signatures
- Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
- GLV/GLS Decomposition, Power Analysis, and Attacks on ECDSA Signatures with Single-Bit Nonce Bias
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
- Partially Known Nonces and Fault Injection Attacks on SM2 Signature Algorithm
- Coded-BKW: Solving LWE Using Lattice Codes
- An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices
- Sieve algorithms for the shortest vector problem are practical
- Lattice Enumeration Using Extreme Pruning
- Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
- Lattice-based Cryptography
- Minkowski's Convex Body Theorem and Integer Programming
- On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications
- New directions in nearest neighbor searching with applications to lattice sieving
- Solving BDD by Enumeration: An Update
- A sieve algorithm for the shortest lattice vector problem
- “Ooh Aah... Just a Little Bit” : A Small Amount of Side Channel Can Go a Long Way
- Fast Lattice Point Enumeration with Minimal Overhead
- Improved Algorithms for the Approximate k-List Problem in Euclidean Norm
- Noise-tolerant learning, the parity problem, and the statistical query model
- On lattices, learning with errors, random linear codes, and cryptography
- Lattice attacks on digital signature schemes
This page was built for publication: On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem
