A hidden number problem in small subgroups
From MaRDI portal
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
- The hidden number problem in extension fields and its applications
- The hidden subgroup problem and MKTP
- Small points on a multiplicative group and class number problem
- The modular inversion hidden number problem
- On the Complexity of the Hidden Subgroup Problem
- On the complexity of the hidden subgroup problem
Cites work
- 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
- Discrete logarithms: The effectiveness of the index calculus method
- Estimates for the number of sums and products and for exponential sums over subgroups in fields of prime order.
- Exponential sums and lattice reduction: Applications to cryptography
- Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes
- Hidden number problem with the trace and bit security of XTR and LUC
- 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 954401 (Why is no real title available?)
- scientific article; zbMATH DE number 6472645 (Why is no real title available?)
- 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 generalised hidden number problem and bit security of XTR
- On the hardness of approximating the permanent of structured matrices
- On the security of Diffie-Hellman bits
- Prime numbers. A computational perspective
- Primzahlverteilung
- Public Key Cryptography – PKC 2004
- Secure bilinear Diffie-Hellman bits
- The insecurity of the elliptic curve digital signature algorithm with partially known nonces
Cited in
(11)- Noisy interpolation of sparse polynomials in finite fields
- On the bit security of the Diffie-Hellman key
- On the security of Diffie-Hellman bits
- Security of the most significant bits of the Shamir message passing scheme
- 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
- On the bit security of the weak Diffie-Hellman problem
- On the generalised hidden number problem and bit security of XTR
- Finding significant Fourier coefficients: clarifications, simplifications, applications and limitations
- Public Key Cryptography – PKC 2004
- Fast generators for the Diffie-Hellman key agreement protocol and malicious standards
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)