On the distribution of the Diffie-Hellman pairs

Finite Fields and their Applications

Volumn 8, Issue 2, 2002, Pages 131-141

  Shparlinski, Igor E ^a  

^a MACQUARIE UNIVERSITY   (Australia)

Author keywords

Diffie Hellman cryptosystem; Exponential sums; Precomputation; Uniform distribution

Indexed keywords

EID: 0036251988     PISSN: 10715797     EISSN: None     Source Type: Journal    
DOI: 10.1006/ffta.2000.0321     Document Type: Article

References (30)

1. Generating hard instances of lattice problems
2. Non-linear complexity of the Naor-Reingold pseudo-random function
3. A simple unpredictable pseudo-random number generator
4. Speeding up discrete log and factoring based schemes via precomputations
5. On the statistical properties of Diffie-Hellman distributions
6. On certain exponential sums and the distribution of Diffie-Hellman triples
7. "Stream Ciphers and Number Theory,"
8. "Sequences, Discrepancies and Applications,"
9. On the distribution of the RSA generator
10. On the distribution of the power generator
11. On the linear complexity of the Naor-Reingold pseudorandom function
12. New bounds for Gauss sums derived from kth powers, and for Heilbronn's exponential sum
13. Efficient cryptographic schemes provably as secure as subset sum
14. "Character Sums with Exponential Functions and Their Applications,"
15. On the distribution of digits in periodic fractions
16. "Exponential Sums and Their Applications,"
17. Pseudorandom number generators in cryptography and number theory
18. "Pseudorandomness and Cryptographic Applications,"
19. Number-theoretic constructions of efficient pseudo-random functions
20. Synthesizers and their application to the parallel construction of pseudo-random functions
21. The hardness of the hidden subset sum problem and its cryptographic implications
22. Quasi-Monte Carlo methods and pseudo-random numbers
23. "Random Number Generation and Quasi-Monte Carlo Methods,"
24. "Number Theoretic Methods in Cryptography: Complexity Lower Bounds,"
25. On the Naor-Reingold pseudo-random function from elliptic curves
26. On the uniformity of distribution of the Naor-Reingold pseudo-random function
27. On the uniformity of distribution of the RSA pairs
28. Linear complexity of the Naor-Reingold pseudorandom number function from elliptic curves
29. "Cryptography: Theory and Practice,"