Playing ``hide-and-seek with numbers: the hidden number problem, lattices and exponential sums
From MaRDI portal
Publication:3369396
zbMATH Open1208.11134MaRDI QIDQ3369396FDOQ3369396
Authors: Igor E. Shparlinski 
Publication date: 13 February 2006
Recommendations
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Exponential sums (11T23) Relations with coding theory (11H71)
Cited In (20)
- Title not available (Why is that?)
- On the modular inversion hidden number problem
- Extended Hidden Number Problem and Its Cryptanalytic Applications
- On the Bit Security of Elliptic Curve Diffie–Hellman
- Title not available (Why is that?)
- Title not available (Why is that?)
- Public Key Cryptography – PKC 2004
- Noisy polynomial interpolation modulo prime powers
- Solving a class of modular polynomial equations and its relation to modular inversion hidden number problem and inversive congruential generator
- Close values of shifted modular inversions and the decisional modular inversion hidden number problem
- Cryptanalysis of elliptic curve hidden number problem from PKC 2017
- Analysis of hidden number problem with hidden multiplier
- The security of all private-key bits in isogeny-based schemes
- Title not available (Why is that?)
- Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation
- Limits of a conjecture on a leakage-resilient cryptosystem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Playing ``hide-and-seek with numbers: the hidden number problem, lattices and exponential sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3369396)
