On the statistical properties of Diffie-Hellman distributions

[1]  D. Hone.  Algorithms for Black-Box Fields and their Application to Cryptography , 2002 .

[2]  A. Harles.  Sieve Methods , 2001 .

[3]  Igor E. Shparlinski,et al.  On Certain Exponential Sums and the Distribution of Diffie–Hellman Triples , 1999 .

[4]  Igor E. Shparlinski,et al.  On The Correlation Of Binary M-sequences , 1999, Des. Codes Cryptogr..

[5]  Igor E. Shparlinski.  Number Theoretic Methods in Cryptography: Complexity lower bounds , 1999 .

[6]  Igor E. Shparlinski,et al.  Number Theoretic Methods in Cryptography , 1999 .

[7]  Igor E. Shparlinski.  Finite Fields: Theory and Computation , 1999 .

[8]  I. Shparlinski,et al.  Character Sums with Exponential Functions and their Applications: Multiplicative Translations of Arbitrary Sets Modulo p , 1999 .

[9]  Glyn Harman,et al.  Shifted primes without large prime factors , 1998 .

[10]  Igor E. Shparlinski,et al.  On the Distribution of the RSA Generator , 1998, SETA.

[11]  Moni Naor,et al.  Number-theoretic constructions of efficient pseudo-random functions , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[12]  Ran Canetti,et al.  Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information , 1997, CRYPTO.

[13]  Victor Shoup,et al.  Lower Bounds for Discrete Logarithms and Related Problems , 1997, EUROCRYPT.

[14]  Dan Boneh,et al.  Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes , 1996, CRYPTO.

[15]  U. Maurer,et al.  On the complexity of breaking the Diffie-Hellman protocol , 1996 .

[16]  Oded Goldreich,et al.  Foundations of Cryptography (Fragments of a Book) , 1995 .

[17]  Ueli Maurer,et al.  Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms , 1994, CRYPTO.

[18]  H. Montgomery.  Ten lectures on the interface between analytic number theory and harmonic analysis , 1994 .

[19]  Stefan A. Brands,et al.  An Efficient Off-line Electronic Cash System Based On The Representation Problem. , 1993 .

[20]  Francesco Pappalardi,et al.  On Artin's Conjecture for Primitive Roots , 1993 .

[21]  Igor E. Shparlinski,et al.  On the number of zeros of exponential polynomials and related questions , 1992, Bulletin of the Australian Mathematical Society.

[22]  Paul C. van Oorschot,et al.  Authentication and authenticated key exchanges , 1992, Des. Codes Cryptogr..

[23]  N. M. Korobov.  Exponential Sums and their Applications , 1992 .

[24]  Torben P. Pedersen.  Distributed Provers with Applications to Undeniable Signatures , 1991, EUROCRYPT.

[25]  S. A. Stepanov,et al.  On the construction of primitive elements and primitive normal bases in a finite field , 1991 .

[26]  Adi Shamir,et al.  The discrete log is very discreet , 1990, STOC '90.

[27]  S A Stepanov,et al.  ON THE CONSTRUCTION OF A PRIMITIVE NORMAL BASIS IN A FINITE FIELD , 1990 .

[28]  David Chaum,et al.  Undeniable Signatures , 1989, CRYPTO.

[29]  Paul Feldman,et al.  A practical scheme for non-interactive verifiable secret sharing , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[30]  A. Taher.  Cryptography and logarithms over finite fields , 1984 .

[31]  Silvio Micali,et al.  Probabilistic Encryption , 1984, J. Comput. Syst. Sci..

[32]  Rudolf Lide,et al.  Finite fields , 1983 .

[33]  Andrew Chi-Chih Yao,et al.  Theory and Applications of Trapdoor Functions (Extended Abstract) , 1982, FOCS.

[34]  J. Chalk,et al.  The Vinogradov-Mordell-Tietäväinen inequalities , 1980 .

[35]  H. Niederreiter.  Quasi-Monte Carlo methods and pseudo-random numbers , 1978 .

[36]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[37]  N M Korobov.  ON THE DISTRIBUTION OF DIGITS IN PERIODIC FRACTIONS , 1972 .

[38]  H. Weyl.  Über die Gleichverteilung von Zahlen mod. Eins , 1916 .