The crew pram complexity of modular inversion

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1380, Issue , 1998, Pages 305-315

  Gathen, Joachim Von Zur ^a   Shparlinski, Igor ^b  

^a FB Mathematik Informatik   (Germany)

^b MACQUARIE UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

BIT INTEGERS; EXPONENTIAL SUMS; FINITE FIELDS; INTEGER GCD; LOWER BOUNDS; MODULAR INVERSION; PARALLEL COMPLEXITY; PARALLEL COMPUTATION;

INFORMATION SCIENCE;

EID: 84949211445     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (28)

1. L. M. Adleman and K. Kompella, 'Using smoothness to achieve parallelism', Proc. 20th ACM Syrnp. on Theory of Cornp., (1988), 528-538.
2. P. W. Beame, S. A. Cook and H. J. Hoover, 'Log depth circuits for division and related problems', SIAM J. Cornp., 15 (1986) 994-1003.
3. S. A. Cook, C. Dwork and R. Reischuk, 'Upper and lower time bounds for parallel random access machines without simultaneous writes', SIAM J. Cornp., 15 (1986), 87-97.
4. D. Coppersmith and I. E. Shparlinski, 'On polynomial approximation and the parallel complexity of the discrete logarithm and breaking the Diffie-Hellman cryptosystem', Research Report RC 20724, IBM T. J. Watson Research Centre, 1997, 103.
5. M. Dietzfelbinger, M. Kutylowski and R. Reischuk, 'Exact time bounds for computing Boolean functions on PRAMs without simultaneous writes', J. Cornp. and Syst. Sci., 48 (1994), 231-254.
6. M. Dietzfelbinger, M. Kutylowski and R. Reischuk, 'Feasible time-optimal algorithms for Boolean functions on exclusive-write parallel random access machine', SIAM J. Comp., 25 (1996), 1196-1230.
7. F. E. Fich, 'The complexity of computation on the parallel random access machine', Handbook of Theoretical Cornp. Sei., Vol.A, Elsevier, Amsterdam, 1990, 757-804.
8. E. Fich and M. Tompa, 'The parallel complexity of exponentiating polynomials over finite fields', J. ACM, 35 (1988), 651-667.
9. S. Gao, J. von zur Gathen and D. Panario, 'Gauss periods and fast exponentiation in finite fields', Lecture Notes in Cornp. Sei., 911 (1995), 311-322.
10. J. von zur Gathen, 'Computing powers in parallel', SIAM J. Cornp., 16 (1987), 930-945.
11. J. yon zur Gathen, 'Inversion in finite fields using logarithmic depth', J. Syrnb. Cornp., 9 (1990), 175-183.
12. J. yon zur Gathen, 'Efficient and optimal exponentiation in finite fields', Cornp. Complexity, 1 (1991), 360-394.
13. J. von zur Gathen, 'Processor-efficient exponentiation in finite fields', Inform. Proc. Letters, 41 (1992), 81-86.
14. J. von zur Gathen and G. Seroussi, 'Boolean circuits versus arithmetic circuits', Inform. and Cornp., 91 (1991), 142-154.
15. L.-K. Hua, Introduction to number theory, Springer-Verlag, 1982.
16. D. Ismailov, 'On a method of Hua Loo-Keng of estimating complete trigonometric sums', Adv. Math. (Benijing), 23 (1992), 31-49.
17. R. Kannan, G. Miller and L. Rudolph, 'Sublinear parallel algorithm for computing the greatest common divisor of two integers', SIAM J. Cornp., 16 (1987), 7-16.
18. R. Lidi and H. Niederreiter, Finite fields, Addison-Wesley, MA, 1983.
19. B. E. Litow and G. I. Davida, 'O(log(n)) parallel time finite field inversion', Lect. Notes in Comp. Science, 319 (1988), 74-80.
20. M. Mňuk, 'A div (n) depth Boolean circuit for smooth modular inverse', Inform. Proe. Letters, 38 (1991), 153-156.
21. I. Parberry and P. Yuan Yan, 'Improved upper and lower time bounds for parallel random access machines without simultaneous writes', SIAM J. Cornp., 20 (1991), 88-99.
22. J. B. Rosser and L. Schoenfeld, 'Approximate formulas for some functions of prime numbers', Ill. J. Math. 6 (1962), 64-94.
23. I. E. Shparlinski, Computational and algorithmic problems in finite fields, Kluwer Acad. Publ., Dordrecht, The Netherlands, 1992.
24. I. E. Shparlinski, 'Number theoretic methods in lower bounds of the complexity of the discrete logarithm and related problems', Preprint, 1997, 1-168.
25. I. E. Shparlinski and S. A. Stepanov, 'Estimates of exponential sums with rational and algebraic functions', Automorphic Functions and Number Theory, Vladivostok, 1989, 5-18 (in Russian).
26. S. B. Stečkin, 'An estimate of a complete rational exponential sum', Proc. Math. Inst. Aead. Sci. of the USSR, Moscow, 143 (1977), 188-207 (in Russian).
27. I. Wegener, The complezity of Boolean functions, Wiley Interscience Publ., 1987.
28. A. Well, Basic number theory, Springer-Verlag, NY, 1974.