Number theoretic methods in cryptography. Complexity lower bounds
algebraic functionsBlum-Blum-Schub generatorBoolean functionsdegrees and orders of polynomialsDiffie-Hellman cryptosystemdiscrete logarithminterpolating polynomialslinear recurring sequenceslower bounds on complexityopen problemspermutation polynomialspolynomial representations of nonlinear pseudo-random number generatorsprime fieldprimitive root testingRSA generatorZech logarithms
Research exposition (monographs, survey articles) pertaining to number theory (11-02) Exponential sums (11T23) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Cryptography (94A60)
- On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping.
- Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness
- Interpolation of the discrete logarithm in \(\mathbb{F}_{q}\) by Boolean functions and by polynomials in several variables modulo a divisor of \(q-1\).
- Linear complexity of the discrete logarithm
- An application of index forms in cryptography
- On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping.
- On the distribution of the Diffie-Hellman pairs
- Incomplete character sums and polynomial interpolation of the discrete logarithm
- Circuit and decision tree complexity of some number theoretic problems
- Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness
- Linear complexity of the discrete logarithm
- Discrete logarithm like problems and linear recurring sequences
- Reduction of the integer factorization complexity upper bound to the complexity of the Diffie-Hellman problem
- New number-theoretic cryptographic primitives
- Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem
- The complexity of certain multi-exponentiation techniques in cryptography
- Polynomial representations of the Lucas logarithm
- Polynomial representations of the Diffie-Hellman mapping
- Interpolation of the discrete logarithm in finite fields by Boolean functions
- A note on the interpolation of the Diffie-Hellman mapping
- A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds
- On a family of preimage-resistant functions
- Breaking Littlewood's cipher
- Approximation of the discrete logarithm in finite fields of even characteristic by real polynomials.
- Complexity theoretic lower bounds on cryptographic functions.
- scientific article; zbMATH DE number 50041 (Why is no real title available?)
- scientific article; zbMATH DE number 1996491 (Why is no real title available?)
- On the interpolation of bivariate polynomials related to the Diffie-Hellman mapping
- Algorithmic Number Theory
- On the statistical properties of Diffie-Hellman distributions
- A lower bound for primality
This page was built for publication: Number theoretic methods in cryptography. Complexity lower bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1276548)
