On the statistical properties of Diffie-Hellman distributions
From MaRDI portal
Publication:5932009
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}}\).
Cites work
- scientific article; zbMATH DE number 5296403 (Why is no real title available?)
- scientific article; zbMATH DE number 3697188 (Why is no real title available?)
- scientific article; zbMATH DE number 16708 (Why is no real title available?)
- scientific article; zbMATH DE number 52979 (Why is no real title available?)
- scientific article; zbMATH DE number 3467229 (Why is no real title available?)
- scientific article; zbMATH DE number 1339097 (Why is no real title available?)
- scientific article; zbMATH DE number 699709 (Why is no real title available?)
- scientific article; zbMATH DE number 1740041 (Why is no real title available?)
- scientific article; zbMATH DE number 1088253 (Why is no real title available?)
- scientific article; zbMATH DE number 1361739 (Why is no real title available?)
- scientific article; zbMATH DE number 1406786 (Why is no real title available?)
- scientific article; zbMATH DE number 3091928 (Why is no real title available?)
- ARTIN'S CONJECTURE FOR PRIMITIVE ROOTS
- Algorithms for black-box fields and their application to cryptography
- Distributed Provers with Applications to Undeniable Signatures
- Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes
- New directions in cryptography
- Number theoretic methods in cryptography. Complexity lower bounds
- ON THE CONSTRUCTION OF A PRIMITIVE NORMAL BASIS IN A FINITE FIELD
- ON THE DISTRIBUTION OF DIGITS IN PERIODIC FRACTIONS
- On Certain Exponential Sums and the Distribution of Diffie-Hellman Triples
- On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping.
- On the correlation of binary \(M\)-sequences
- On the number of zeros of exponential polynomials and related questions
- Probabilistic encryption
- Quasi-Monte Carlo methods and pseudo-random numbers
- Shifted primes without large prime factors
- Undeniable Signatures
Cited in
(30)- On the uniformity of distribution of the RSA pairs
- On the distribution of the Diffie-Hellman pairs
- Common composites of triangular polynomial systems and hash functions
- Incomplete exponential sums and Diffie–Hellman triples
- On the singularity of generalised Vandermonde matrices over finite fields
- Roots of sparse polynomials over a finite field
- On the number of distinct roots of a lacunary polynomial over finite fields
- Value sets of sparse polynomials
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- Exponential sums with sparse polynomials over finite fields
- Exponential function analogue of Kloosterman sums
- On an exponential sum related to the Diffie-Hellman cryptosystem
- On the number of factorizations of \(t\bmod N\) and the probability distribution of Diffie-Hellman secret keys for many users
- Distribution of integral values for the ratio of two linear recurrences
- Statistical Analysis of DH1 Cryptosystem
- On the complexity of the discrete logarithm and Diffie-Hellman problems
- Character sums with exponential functions
- On the distribution of the power generator
- Quasirandom arithmetic permutations
- Bounds of Gauss sums in finite fields
- Double exponential sums over thin sets
- Security of polynomial transformations of the Diffie-Hellman key.
- Optimal Randomness Extraction from a Diffie-Hellman Element
- Estimating the number of roots of trinomials over finite fields
- Threshold circuit lower bounds on cryptographic functions
- On the distribution of Diffie-Hellman triples with sparse exponents
- Sparse univariate polynomials with many roots over finite fields
- New bounds on exponential sums related to the Diffie-Hellman distributions
- Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields
- 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)