Ran Canetti, John Friedlander, Sergei Konyagin, Michael Larsen, Daniel Lieman, Igor Shparlinski  Home/Search
Context Related
| mq.edu.au/~igor/CFKLLS.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mq.edu.au/~igor/Publ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Let p be a large prime such that p \Gamma 1 has some large prime factors, and let # 2 ZZ p be an r-th power residue for all small factors of p \Gamma 1. The corresponding Diffie-Hellman (DH) distribution is (# x ; # y ; # xy ) where x; y are randomly chosen from ZZ 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 randomly from ZZ p . This assumption,... (Update)
Context of citations to this paper: More
...weaker, results can be obtained for arbitrary composite moduli as well. In fact, our proof is based on the bound for exponential sums from [5] with prime denominators. In order to cover non squarefree moduli one should extend the results of [6, 5] to prime power denominators....
...to the uniform distribution, when x 2 Um runs through the group of units Um = ZZ m modulo m. This result is an analogue of the results of [4, 5] about the uniformity of distribution of the Diffie Hellman triples. Then we also consider the case when x runs through all possible k...
Cited by: More
A Public Key Cryptosystem Based On Sparse Polynomials - Grant, Krastev, Lieman.. (1998) (Correct)
On The Distribution Of The Diffie-Hellman Pairs - Shparlinski (1999) (Correct)
On A New Exponential Sum - Lieman, Shparlinski (1999) (Correct)
Similar documents (at the sentence level):
6.2%: On Certain Exponential Sums And The Distribution Of.. - Canetti.. (2000) (Correct)
Active bibliography (related documents): More All
0.5: On the Security of ElGamal based Encryption - Tsiounis, Yung (1998) (Correct)
0.4: Some Doubly Exponential Sums over ... - Friedlander, Shparlinski (Correct)
0.4: Towards realizing random oracles: Hash functions that hide all.. - Canetti (2000) (Correct)
Similar documents based on text: More All
0.3: On The Distribution Of Diffie-Hellman Triples With Sparse.. - Friedlander, Shparlinski (Correct)
0.3: On The Correlation Of Binary M-Sequences - Friedlander, Larsen, Lieman.. (Correct)
0.2: Enumerating Permutation Polynomials over Finite Fields by.. - Konyagin, Pappalardi (2002) (Correct)
Related documents from co-citation: More All
3: On certain exponential sums and the distribution of Diffie-Hellman triples - Canetti, Friedlander et al. - 1997
3: Stream Ciphers and Number Theory (context) - Cusick, Ding et al. - 1998
3: Cryptography: Theory and Practice (context) - Douglas - 1995
BibTeX entry: (Update)
R. Canetti, J. Friedlander, S. Konyagin, M. Larsen, D. Lieman and I. E. Shparlinski, `On the statistical properties of the Diffie--Hellman distribution', Preprint , 1998, 1--27. http://citeseer.ist.psu.edu/171465.html More
@article{ canetti00statistical,
author = "Ran Canetti and John Friedlander and Sergei Konyagin and Michael Larsen and Daniel Lieman and Igor Shparlinski",
title = "On the statistical properties of {D}iffie-{H}ellman distributions",
journal = "Israel Journal of Mathemathics",
volume = "120",
pages = "23--46",
year = "2000",
url = "citeseer.ist.psu.edu/171465.html" }
Citations (may not include all citations):635 New directions in cryptography - Diffie, Hellman - 1976
339 Theory and applications of trapdoor functions (context) - Yao - 1982
278 Probabilistic encryption (context) - Goldwasser, Micali - 1984
133 A practical scheme for non-interactive verifiable secret sha.. (context) - Feldman - 1987
124 Lower bounds for discrete logarithms and related problems - Shoup - 1997
88 Undeniable signatures (context) - Chaum, van Antwerpen - 1990
87 Authentication and authenticated key exchanges - Diffie, van Oorscot et al. - 1992
64 Quasi-Monte Carlo methods and pseudo-random numbers (context) - Niederreiter - 1978
57 Distributed provers with applications to undeniable signatur.. (context) - Pedersen - 1991
55 Hardness of computing the most significant bits of secrete k.. (context) - Boneh, Venkatessan - 1996
55 Number-theoretic constructions of efficient pseudo-random fu.. - Naor, Reingold - 1997
52 An efficient off-line electronic cash system based on the re.. - Brands - 1993
46 Cambridge University Press (context) - Lidl, Niederreiter et al. - 1997
42 Towards realizing random oracles: Hash functions that hide a.. - Canetti - 1997
40 Foundations of Cryptography (Fragments of a book - Goldreich - 1995
39 Algorithms for Black-Box fields and their application to cry.. (context) - Boneh, Lipton - 1996
38 Elements of number theory (context) - Vinogradov - 1954
29 Towards the equivalence of breaking the Diffie-Hellman proto.. - Maurer - 1994
29 Ten lectures on the interface between analytic number theory.. (context) - Montgomery - 1994
27 Sieve Methods (context) - Halberstam, --E - 1974
24 Computational and algorithmic problems in finite fields (context) - Shparlinski - 1992
23 the distribution of digits in periodic fractions (context) - Korobov - 1972
18 Exponential sums and their applications (context) - Korobov - 1992
17 On polynomial approximation of the discrete logarithm and th.. (context) - Coppersmith, Shparlinski
15 Uber die Gleichverteilung von Zahlen mod Eins (context) - Weyl - 1916
13 Artin's conjecture for primitive roots (context) - Heath-Brown - 1986
10 Shifted primes without large prime factors (context) - Baker, Harman - 1998
9 The discrete log is very discreet (context) - Schrift, Shamir - 1990
6 On certain exponential sums and the distribution of Diffie--.. - Canetti, Friedlander et al.
5 The Vinogradov--Mordell--Tietavainen inequalities (context) - Chalk - 1980
5 On construction of a primitive normal basis of a finite fiel.. (context) - Shparlinski, Stepanov - 1990
5 the complexity of breaking the Diffie-- Hellman protocol - Maurer, Wolf - 1996
3 Cryptography and logarithms over finite fields (context) - El-Gamal - 1984
3 On prime divisors of recurrence sequences (context) - Shparlinski - 1980
2 Exponential sums with finitely generated multiplicative grou.. (context) - Konyagin, Shparlinski - 1997
2 The Semantic Security of El Gamal Encryption is Equivalent t.. (context) - Tsiounis, Yung - 1997
2 On zeros of exponential polynomials and related questions (context) - van der Poorten, Shparlinski - 1992
1 Number theoretic methods in lower bounds of the complexity o.. (context) - Shparlinski - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.comp.mq.edu.au/~igor/Publ.html): More
A Lower Bound for Primality - Allender, Saks, Shparlinski (1999) (Correct)
Finding Points on Curves over Finite Fields - Gathen, Shparlinski, Sinclair (1996) (Correct)
A Public Key Cryptosystem Based On Sparse Polynomials - Grant, Lieman, Shparlinski (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC