Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation

DOI10.1090/S0025-5718-03-01495-9zbMATH Open1026.11093OpenAlexW2044209395MaRDI QIDQ4806399FDOQ4806399

Authors: N. A. Howgrave-Graham, Phong Q. Nguyen, 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

Recommendations

• Analysis of hidden number problem with hidden multiplier
• Playing ``hide-and-seek with numbers: the hidden number problem, lattices and exponential sums
• scientific article; zbMATH DE number 2086222
• The hidden number problem with non-prime modulus
• The multivariate hidden number problem

zbMATH Keywords

exponential sumscryptographylattice reductionnoisy exponentiationhidden number problemtimed-release crypto

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Exponential sums (11T23) Number-theoretic algorithms; complexity (11Y16)

Cites Work

• A hierarchy of polynomial time lattice basis reduction algorithms
• A sieve algorithm for the shortest lattice vector problem
• Factoring polynomials with rational coefficients
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes
• Lattice attacks on digital signature schemes
• The insecurity of the elliptic curve digital signature algorithm with partially known nonces
• The insecurity of the digital signature algorithm with partially known nonces
• On Lovász' lattice reduction and the nearest lattice point problem
• Shifted primes without large prime factors
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sparse polynomial approximation in finite fields
• Title not available (Why is that?)
• Security of the most significant bits of the Shamir message passing scheme
• Title not available (Why is that?)
• Title not available (Why is that?)
• Reconstructing Truncated Integer Variables Satisfying Linear Congruences
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

• Security of polynomial transformations of the Diffie-Hellman key.
• Correcting noisy exponentiation black-boxes modulo a prime
• The hidden number problem with non-prime modulus
• Quantum period reconstruction of approximate sequences
• The multivariate hidden number problem
• The hidden number problem with small unknown multipliers: cryptanalyzing MEGA in six queries and other applications
• Solving Hidden Number Problem with One Bit Oracle and Advice
• Analysis of hidden number problem with hidden multiplier
• Limits of a conjecture on a leakage-resilient cryptosystem
• Title not available (Why is that?)

This page was built for publication: Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4806399)