On the statistical properties of Diffie-Hellman distributions
DOI10.1007/S11856-000-1270-1zbMATH Open0997.11066OpenAlexW191763761WikidataQ101263547 ScholiaQ101263547MaRDI QIDQ5932009FDOQ5932009
Authors: Ran Canetti, J. B. Friedlander, Sergei Konyagin, Michael Larsen, Daniel Lieman, Igor E. Shparlinski 
Publication date: 12 November 2002
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11856-000-1270-1
Recommendations
- On the distribution of Diffie-Hellman triples with sparse exponents
- scientific article; zbMATH DE number 2188811
- On Certain Exponential Sums and the Distribution of Diffie-Hellman Triples
- Incomplete exponential sums and Diffie–Hellman triples
- On an exponential sum related to the Diffie-Hellman cryptosystem
- Some doubly exponential sums over Zm
- On the distribution of the Diffie-Hellman pairs
- scientific article; zbMATH DE number 1740041
- Optimal Randomness Extraction from a Diffie-Hellman Element
- Security of most significant bits of \(g^{x^{2}}\).
exponential sumsleast significant bitsDiffie-Hellman triplesbounds for double exponential sumsDiffie-Hellman distributiondistribution of the most significant bits
Cryptography (94A60) Estimates on exponential sums (11L07) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Exponential sums (11T23)
Cites Work
- Probabilistic encryption
- New directions in cryptography
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- ARTIN'S CONJECTURE FOR PRIMITIVE ROOTS
- Quasi-Monte Carlo methods and pseudo-random numbers
- Shifted primes without large prime factors
- Undeniable Signatures
- Title not available (Why is that?)
- On the correlation of binary \(M\)-sequences
- Title not available (Why is that?)
- Distributed Provers with Applications to Undeniable Signatures
- ON THE CONSTRUCTION OF A PRIMITIVE NORMAL BASIS IN A FINITE FIELD
- Title not available (Why is that?)
- On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping.
- On Certain Exponential Sums and the Distribution of Diffie-Hellman Triples
- Algorithms for black-box fields and their application to cryptography
- On the number of zeros of exponential polynomials and related questions
- Number theoretic methods in cryptography. Complexity lower bounds
- ON THE DISTRIBUTION OF DIGITS IN PERIODIC FRACTIONS
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (29)
- Security of polynomial transformations of the Diffie-Hellman key.
- Quasirandom arithmetic permutations
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- Roots of sparse polynomials over a finite field
- On the singularity of generalised Vandermonde matrices over finite fields
- Exponential Sums with Sparse Polynomials over Finite Fields
- Double exponential sums over thin sets
- Character sums with exponential functions
- Value Sets of Sparse Polynomials
- On the distribution of the Diffie-Hellman pairs
- Exponential function analogue of Kloosterman sums
- Bounds of Gauss sums in finite fields
- New bounds on exponential sums related to the Diffie-Hellman distributions
- On the uniformity of distribution of the RSA pairs
- Threshold circuit lower bounds on cryptographic functions
- Estimating the number of roots of trinomials over finite fields
- Incomplete exponential sums and Diffie–Hellman triples
- On the number of distinct roots of a lacunary polynomial over finite fields
- Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields
- Distribution of integral values for the ratio of two linear recurrences
- On the complexity of the discrete logarithm and Diffie-Hellman problems
- Sparse univariate polynomials with many roots over finite fields
- On the distribution of the power generator
- Optimal Randomness Extraction from a Diffie-Hellman Element
- Common composites of triangular polynomial systems and hash functions
- On an exponential sum related to the Diffie-Hellman cryptosystem
- On the distribution of Diffie-Hellman triples with sparse exponents
- Statistical Analysis of DH1 Cryptosystem
- Sublinear root detection and new hardness results for sparse polynomials over finite fields
This page was built for publication: On the statistical properties of Diffie-Hellman distributions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5932009)
