On polynomial approximation of the discrete logarithm and the diffie-hellman mapping don coppersmith

Journal of Cryptology

Volumn 13, Issue 3, 2000, Pages 339-360

  Ibm, T J ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Boolean functions; Character sums; Diffie hellman cryptosystem; Discrete logarithms; Polynomial approximations

Indexed keywords

EID: 0001638393     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/S001450010002     Document Type: Article

References (30)

1. D. Boneh and R. Venkatesan, Hardness of computing the most significant bits of secrete keys in DiffieHellman and related schemes, Advances in Cry-ptology-CRYPTO '96, LNCS 1109, Springer-Verlag, Berlin, 1996, pp. 129-142.
2. D. Boneh and R. Venkatesan, Hounding in lattices and its cryptographic applications, Proc. 8//i Annual ACM-SIAM Symp. on Discrete Algorithms, ACM, New York, 1997, pp. 675-681.
3. R. Canetti, J. Friedlander, and I. E. Shparlinski, On certain exponential sums and the distribution of Diffie-Hellman triples, J. London Math. Soc., 59,1999,799-812.
4. J. H. H. Chalk, Polynomial congruences over incomplete residue systems modulo k, Proc. Kon. Ned. Acad. Wetensch., A92,1989,49-62.
5. M. Dietzfelbinger, M. Kutylowski, and R. Reischuk, Exact lower time bounds for computing Boolean functions on CREW PRAMs, J. Comput. System Sei., 48,1994,231-254.
6. M. Dietzfelbinger, M. Kutyfowski, and R. Reischuk, Feasible time-optimal algorithms for Boolean functions on exclusive-write parallel random access machine, SIAM J. Comput., 25,1996, 1196-1230.
7. W. Diffie and M. Hellman, New directions in cryptography, IEEE Trans. Inform. Theory, 22, 1976, 644-654.
8. F. E. Fich, The complexity of computation on the parallel random access machine, Handbook of Theo-retical Computer Science, Vol. A, Elsevier, Amsterdam, 1990, pp. 757-804.
9. J. von zur Gathen, Computing powers in parallel, SIAM J. Comput., 16,1987,930-945.
10. J. von zur Gathen, Algebraic complexity theory, Annu. Rev. Comput. Sei., 3,1988,317-347.
11. J. von zur Gathen, Efficient and optimal exponentiation in finite fields, Comput. Compl., 1,1991,360-394.
12. J. von zur Gathen and G. Seroussi, Boolean circuits versus arithmetic circuits. Inform. Comput., 91,1991, 142-154.
13. J. von zur Gathen and I. E. Shparlinski, The CREW PRAM complexity of modular inversion, SIAM J. Comput. (to appear). Preliminary version in Proc. 3rd Latin American Theoretical Information Conf., LNCS 1380, Springer-Verlag, Berlin, 1998, pp. 305-315.
14. J. Hâstad, A. W. Schrift, and A. Shamir, The discrete logarithm modulo a composite hides O(n) bits, J. Comput. System Sei., 47,1993,376-404.
15. L.-K. Hua, Abschätzungen von exponentialsummen und ihre anwendung in der Zahlentheorie, TeubnerVerlag, Leipzig, 1959.
16. S. V. Konyagin, On the number of solutions of a univariate congruence of /ith degree, Mat. Sb., 102, 1979,171-187 (in Russian).
17. S. V. Konyagin and T. Steger, On the number of solutions of polynomial congruences, Mat. 2ametki, 55(1) 1994,73-79 (in Russian)
18. R. Lidl and H. Niederreiter, Finite Fields, Addison-Wesley, Reading, MA, 1983.
19. F. J. MacWilliams and N. J. A. Sloane, The Tlieory of Error-Correcting Codes, North-Holland, Amsterdam, 1977.
20. U. M. Maurer and S. Wolf, The relationship between breaking the Diffie-Hellman protocol and computing discrete logarithms, SIAM J. Comput., 28,1999,1689-1721.
21. G. L. Müllen and D. White, A polynomial representation for logarithms in GF(q),Acta Arith., 47,1986, 255-261.
22. V. I. Neîaev, Complexity of a deterministic algorithm for the discrete logarithm, Mat. Zametki, 55(2) 1994,91-101 (in Russian).
23. N. Nisan and M. Szegedy, On the degree of Boolean functions as real polynomials, Proc. 24th ACM Symp. on Tlieory of Computing, 1992, pp. 462-467.
24. I. Parberry and P. Yuan Yan, Improved upper and lower time bounds for parallel random access machines without simultaneous writes, SIAM J. Comput., 20,1991,88-99.
25. R. Peralta, Simultaneous security of bits of the discrete log, Advances in Cryptology-Eurocrypt '85, LNCS 219, Springer-Verlag, Berlin, 1986, pp. 62-72.
26. V. Shoup, Lower bounds for discrete logarithms and related problems. Advances in CryplologyEurocrypt '91, LNCS 1233, Springer-Verlag, Berlin, 1997, pp. 256-266.
27. I. E. Shparlinski, Finite Fields: Theory and Computation, Kluwer, Dordrecht, 1997.
28. I. M. Vmogradov, Elements of Number Theory, Dover, New York, 1954.
29. I. Wegener, The Complexity of Boolean Functions, Wiley Interscience, New York, 1987.
30. A. Weil, Basic Number Tlieory, Springer-Verlag, New York, 1974.