A hidden number problem in small subgroups

DOI10.1090/S0025-5718-05-01797-7zbMATH Open1072.11092OpenAlexW2038748747MaRDI QIDQ5315437FDOQ5315437

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

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• New bounds for Gauss sums derived from KTH powers, and for Heilbronn's exponential sum
• Estimates for the number of sums and products and for exponential sums over subgroups in fields of prime order.
• Cryptography. Theory and practice
• 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
• The insecurity of the elliptic curve digital signature algorithm with partially known nonces
• Noisy interpolation of sparse polynomials in finite fields
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Discrete logarithms and local units
• Title not available (Why is that?)
• On exponential sums with sparse polynomials and rational functions
• BOUNDS ON EXPONENTIAL SUMS AND THE POLYNOMIAL WARING PROBLEM MOD p
• Information Security and Privacy
• Title not available (Why is that?)
• Title not available (Why is that?)
• A note on Waring's problem in finite fields
• On the hardness of approximating the permanent of structured matrices
• Public Key Cryptography – PKC 2004

Cited In (11)

• Title not available (Why is that?)
• 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
• Public Key Cryptography – PKC 2004
• Playing ``hide-and-seek with numbers: the hidden number problem, lattices and exponential sums
• 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
• Title not available (Why is that?)

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)