Certain exponential sums and random walks on elliptic curves

Canadian Journal of Mathematics

Volumn 57, Issue 2, 2005, Pages 338-350

  Lange, Tanja ^a   Shparlinski, Igor E ^b  

^a RUHR UNIVERSITY BOCHUM   (Germany)

^b MACQUARIE UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17044431081     PISSN: 0008414X     EISSN: None     Source Type: Journal    
DOI: 10.4153/CJM-2005-015-8     Document Type: Article

References (29)

1. P. Beelen and J. Doumen, Pseudorandom sequences from elliptic curves. In: Finite Fields with Applications to Coding Theory, Cryptography and Related Areas, Springer-Verlag, Berlin, 2002, pp. 7-52.
2. I. Blake, G. Seroussi, and N. Smart, Elliptic curves in cryptography. London Math. Society Lecture Note Series 265, Cambridge University Press, 2000.
3. T. W. Cusic, C. Ding, and A. Renvall, Stream ciphers and number theory. North-Holland, Amsterdam, 1998.
4. E. El Mahassni and I. E. Shparlinski, On the uniformity of distribution of congruential generators over elliptic curves. In: Sequences and Their Applications, Springer-Verlag, London, 2002, pp. 257-264.
5. H. Davenport and D. J. Lewis, Character sums and primitive roots in finite fields. Rend. Circ. Mat. Palermo (2) 12(1963), 129-136.
6. J. B. Friedlander, J. Hansen, and I. E. Shparlinski, Character sums with exponential functions. Mathematika 47(2000), 75-85.
7. m. Acta Arith. 105(2002), 349-370.
8. J. B. Friedlander, C. Pomerance, and I. E. Shparlinski, Period of the power generator and small values of Carmichael's function. Math. Comp. 70(2001), 1591-1605 (see also 71(2002), 1803-1806).
9. J. B. Friedlander, C. Pomerance, and I. E. Shparlinski, Period of the power generator and small values of Carmichael's function. Math. Comp. 70(2001), 1591-1605 (see also 71(2002), 1803-1806).
10. J. B. Friedlander and I. E. Shparlinski, On the distribution of the power generator. Math. Comp. 70(2001), 1575-1589.
11. G. Gong, T. A. Berson, and D. R. Stinson, Elliptic curve pseudo random sequence generators. In: Selected Areas in Cryptography, Lecture Notes in Comput. Sci. 1758, Springer-Verlag, Berlin, 2000, pp. 34-49.
12. G. Gong and C. C. Y. Lam, Linear recursive sequences over elliptic curves. In: Sequences and Their Applications, Springer, London, 2002, pp. 182-196.
13. F. Griffin and I. E. Shparlinski, On the linear complexity profile of the power generator. IEEE Trans. Inform. Theory 46(2000), 2159-2162.
14. J. Guajardo and C. Paar, Efficient algorithms for elliptic curve cryptosystems. In: Advances in Cryptology - Crypto'97, Lect. Notes in Comput. Sci. 1294, Springer, Berlin, 1997, pp. 342-356.
15. S. Hallgren, 'Linear congruential generators over elliptic curves', Preprint CS-94-143, Dept. of Comp. Sci., Cornegie Mellon Univ., 1994, 1-10.
16. F. Hess and I. E. Shparlinski, On the linear complexity and multidimensional distribution of congruential generators over elliptic curves. Designs, Codes and Cryptography, (to appear)
17. D. R. Kohel and I. E. Shparlinski, Exponential sums and group generators for elliptic curves over finite fields. In: Algorithmic Number Theory, Lecture Notes in Comput. Sci. 1838, Springer, Berlin, 2000, pp. 395-404.
18. J. C. Lagarias, Pseudorandom number generators in cryptography and number theory. In: Cryptology and Computational Number Theory, Proc. Sympos. Appl. Math. 42, Amer. Math. Soc., Providence, RI, 1990, pp. 115-143.
19. C. C. Y. Lam and G. Gong, Randomness of elliptic curve sequences. Research Report CORR 2002-18, Faculty of Mathematics, University of Waterloo, Waterloo, 2002, 1-11.
20. S. Lang, Elliptic curves: Diophantine analysis. Grundlehren der Mathematischen Wissenschaften 231, Springer-Verlag, Berlin, 1978.
21. H. W. Lenstra, Jr., Factoring integers with elliptic curves. Ann of Math. 126(1987), 649-673.
22. R. Lidl and H. Niederreiter, Finite fields. Encyclopedia of Mathematics and its Applications, 20, Cambridge University Press, Cambridge, 1997.
23. A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone, Handbook of applied cryptography. CRC Press, Boca Raton, FL, 1997.
24. R. Schoof, Elliptic curves over finite fields and the computation of square roots mod p. Math. Comp. 44(1985), 483-494.
25. I. E. Shparlinski, On the Naor-Reingold pseudo-random number function from elliptic curves. Appl. Algebra Engrg. Comm. Comput. 11(2000), 27-34.
26. _, On the linear complexity of the power generator. Des. Codes Cryptogr. 23(2001), 5-10.
27. I. E. Shparlinski and J. H. Silverman, On the linear complexity of the Naor-Reingold pseudo-random function from elliptic curves. Des. Codes Cryptogr. 24(2001), 279-289.
28. J. H. Silverman, The arithmetic of elliptic curves, Springer-Verlag, Berlin, 1995.
29. A. Winterhof, Some estimates for character sums and applications. Des. Codes Cryptogr. 22(2001), 123-131.