On the statistical properties of Diffie–Hellman distributions

On the statistical properties of Diffie–Hellman distributions

Cached

Download Links

[mlarsen.math.indiana.edu]

by Ran Canetti , John Friedl , Sergei Konyagin , Michael Larsen , Daniel Lieman

Venue:	MR 2001k:11258 Zbl 0997.11066
Citations:	24 - 10 self

BibTeX

@INPROCEEDINGS{Canetti_onthe,
    author = {Ran Canetti and John Friedl and Sergei Konyagin and Michael Larsen and Daniel Lieman},
    title = {On the statistical properties of Diffie–Hellman distributions},
    booktitle = {MR 2001k:11258 Zbl 0997.11066},
    year = {}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Let p be a large prime such that p−1 has some large prime factors, and let ϑ ∈ Z ∗ p be an r-th power residue for all small factors of p − 1. The corresponding Diffie-Hellman (DH) distribution is (ϑ x, ϑ y, ϑ xy) where x, y are randomly chosen from Z ∗ p. A recently formulated assumption is that given p, ϑ of the above form it is infeasible to distinguish in reasonable time between DH distribution and triples of numbers chosen

Citations

2292	New Directions in Cryptography - Diffie, Hellman - 1976
1001	Probabilistic encryption - Goldwasser, Micali - 1984
453	Theory and applications of trapdoor functions - Yao - 1982
446	Finite fields - Lidl, Niederreiter - 1997
432	Group Signatures - Chaum, Heijst - 1991
231	Authentication and Authenticated Key Exchanges - Diffie, Oorschot, et al. - 1992
196	A Practical Scheme for Non-interactive Verifiable Secret Sharing - Feldman - 1987
184	Lower bounds for discrete logarithms and related problems - Shoup - 1997
140	Foundations of cryptography (fragments of a book - Goldreich - 1995
126	Sieve methods - Halberstam, Richert - 1974
125	An Efficient Off-Line Electronic Cash System Based on the Representation Problem - Brands - 1993
121	Number-theoretic constructions of efficient pseudorandom functions - Naor, Reingold - 1997
108	Quasi-Monte Carlo methods and pseudo-random numbers - Niederreiter - 1978
100	Ten Lectures on the Interface between Analytic Number Theory and Harmonic Analysis - Montgomery - 1994
97	Über die Gleichverteilung von Zahlen mod - Weyl - 1916
84	R.: Hardness of Computing the Most Significant Bits of Secret Keys in Diffie–Hellman and Related Schemes - Boneh, Venkatesan - 1996
80	Towards realizing random oracles: Hash functions that hide all partial information - Canetti - 1997
69	Algorithms for black box fields and their application to cryptography - Boneh, Lipton - 1996
61	Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms - Maurer
61	Distributed provers with applications to undeniable signatures - Pedersen - 1991
51	Character sums with exponential functions and their applications - Konyagin, Shparlinski - 1999
51	Elements of number theory - Vinogradov - 1954
37	Artin’s conjecture for primitive roots - Heath-Brown - 1986
36	M.J.: Authentication and authenticated key exchanges. Design Codes Cryptography 2 - Diffie, Oorschot, et al. - 1992
30	Cryptography and logarithms over finite - El-Gamal - 1984
29	Shifted primes without large prime factors - RC, Harman - 1998
26	Exponential Sums and Their Applications - Korobov - 1989
25	On certain exponential sums and the distribution of Diffie-Hellman triples - Canetti, Friedlander, et al. - 1999
24	Finite Fields: Theory and Computation - Shparlinski - 1999
23	On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping - Coppersmith, Shparlinski
22	On the distribution of digits in periodic fractions - Korobov - 1972
18	Number theoretic methods in cryptography: Complexity lower bounds , Birkhäuser - Shparlinski - 1999
14	A.: The Discrete Log is Very Discreet - Schrift, Shamir - 1990
12	On the distribution of the RSA generator - Friedlander, Lieman, et al. - 1998
6	On the construction of a primitive normal basis of a finite field - Stepanov, Shparlinski - 1989
6	On the construction of primitive elements and primitive normal bases in a finite field - Stepanov, Shparlinski - 1989
5	The Vinogradov–Mordell–Tietäväinen inequalities - Chalk - 1980
5	On the complexity of breaking the Diffie–Hellman protocol - Maurer, Wolf - 1996
4	On zeros of exponential polynomials and related questions - Poorten, Shparlinski - 1992
4	On prime divisors of recurrence sequences’, Izvestija Vysshih Uchebnyh - Shparlinski - 1980
3	On correlation of binary M-sequences', Designs, Codes and Cryptography - Friedlander, Larsen, et al. - 1996
2	Exponential sums with finitely generated multiplicative groups and their applications - Konyagin, Shparlinski - 1997
2	The semantic security of El Gamal encryption is equivalent to the decision Diffie-Hellman - Tsiounis, Yung - 1997