A hidden number problem in small subgroups

DOI10.1090/S0025-5718-05-01797-7zbMath1072.11092OpenAlexW2038748747MaRDI QIDQ5315437

Arne Winterhof, Igor E. Shparlinski

Publication date: 8 September 2005

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-05-01797-7

Mathematics Subject Classification ID

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

Related Items (5)

Fast generators for the Diffie-Hellman key agreement protocol and malicious standards ⋮ On the bit security of the weak Diffie-Hellman problem ⋮ Noisy interpolation of sparse polynomials in finite fields ⋮ On the bit security of the Diffie-Hellman key ⋮ Unnamed Item

Cites Work

• On exponential sums with sparse polynomials and rational functions
• Estimates for the number of sums and products and for exponential sums over subgroups in fields of prime order.
• The insecurity of the elliptic curve digital signature algorithm with partially known nonces
• On the hardness of approximating the permanent of structured matrices
• Noisy interpolation of sparse polynomials in finite fields
• Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
• Discrete logarithms and local units
• BOUNDS ON EXPONENTIAL SUMS AND THE POLYNOMIAL WARING PROBLEM MOD p
• New bounds for Gauss sums derived from KTH powers, and for Heilbronn's exponential sum
• A note on Waring's problem in finite fields
• Information Security and Privacy
• Public Key Cryptography – PKC 2004
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A hidden number problem in small subgroups