Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation
Publication:4806399
DOI10.1090/S0025-5718-03-01495-9zbMath1026.11093OpenAlexW2044209395MaRDI QIDQ4806399
Phong Q. Nguyen, N. A. Howgrave-Graham, Igor E. Shparlinski
Publication date: 14 May 2003
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-03-01495-9
exponential sumscryptographynoisy exponentiationlattice reductionhidden number problemtimed-release crypto
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Exponential sums (11T23)
Related Items (6)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Lovász' lattice reduction and the nearest lattice point problem
- A hierarchy of polynomial time lattice basis reduction algorithms
- Factoring polynomials with rational coefficients
- The insecurity of the elliptic curve digital signature algorithm with partially known nonces
- The insecurity of the digital signature algorithm with partially known nonces
- Security of the most significant bits of the Shamir message passing scheme
- Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
- Reconstructing Truncated Integer Variables Satisfying Linear Congruences
- Shifted primes without large prime factors
- Sparse polynomial approximation in finite fields
- A sieve algorithm for the shortest lattice vector problem
- Lattice attacks on digital signature schemes
This page was built for publication: Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation