A hidden number problem in small subgroups

DOI10.1090/S0025-5718-05-01797-7MaRDI QIDQ5315437zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• The hidden subgroup problem and permutation group theory
• Public Key Cryptography – PKC 2004
• The hidden number problem with non-prime modulus
• scientific article; zbMATH DE number 475648
• scientific article; zbMATH DE number 2086222
• The hidden subgroup problem and MKTP
• Small points on a multiplicative group and class number problem
• scientific article; zbMATH DE number 2081057
• On the Complexity of the Hidden Subgroup Problem
• On the complexity of the hidden subgroup problem

Cites work

• scientific article; zbMATH DE number 1588479 (Why is no real title available?)
• scientific article; zbMATH DE number 3131972 (Why is no real title available?)
• scientific article; zbMATH DE number 5296403 (Why is no real title available?)
• scientific article; zbMATH DE number 1339097 (Why is no real title available?)
• scientific article; zbMATH DE number 1113850 (Why is no real title available?)
• scientific article; zbMATH DE number 1942436 (Why is no real title available?)
• scientific article; zbMATH DE number 2081144 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• scientific article; zbMATH DE number 1866880 (Why is no real title available?)
• scientific article; zbMATH DE number 2206373 (Why is no real title available?)
• scientific article; zbMATH DE number 6472645 (Why is no real title available?)
• A note on Waring's problem in finite fields
• BOUNDS ON EXPONENTIAL SUMS AND THE POLYNOMIAL WARING PROBLEM MOD p
• Cryptography. Theory and practice
• Discrete logarithms and local units
• Estimates for the number of sums and products and for exponential sums over subgroups in fields of prime order.
• Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes
• Information Security and Privacy
• New bounds for Gauss sums derived from KTH powers, and for Heilbronn's exponential sum
• Noisy interpolation of sparse polynomials in finite fields
• On exponential sums with sparse polynomials and rational functions
• On the hardness of approximating the permanent of structured matrices
• Public Key Cryptography – PKC 2004
• The insecurity of the elliptic curve digital signature algorithm with partially known nonces

Cited in

(11)

• scientific article; zbMATH DE number 1588479 (Why is no real title available?)
• On the bit security of the weak Diffie-Hellman problem
• Fast generators for the Diffie-Hellman key agreement protocol and malicious standards
• On small gaps between the elements of multiplicative subgroups of finite fields
• Playing ``hide-and-seek with numbers: the hidden number problem, lattices and exponential sums
• Public Key Cryptography – PKC 2004
• On the bit security of the Diffie-Hellman key
• Noisy interpolation of sparse polynomials in finite fields
• Security of the most significant bits of the Shamir message passing scheme
• Finding significant Fourier coefficients: clarifications, simplifications, applications and limitations
• scientific article; zbMATH DE number 2081144 (Why is no real title available?)

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

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