School of Mpce, Macquarie University, Sydney, New South Wales 2109, Australia
Bibliografia
[1] W.-S. Chou and G. L. Mullen, Generating linear spans over finite fields, Acta Arith. 61 (1992), 183-191.
[2] R. Fitzgerald and J. Yucas, On generating linear spans over GF(p), Congr. Numer. 69 (1989), 55-60.
[3] R. Kannan and R. J. Lipton, Polynomial-time algorithm for the orbit problem, J. Assoc. Comput. Mach. 33 (1986), 808-821.
[4] R. Lidl and H. Niederreiter, Finite Fields, Encyclopedia Math. Appl. 20, Addison-Wesley, Reading, Mass., 1983 (now distributed by Cambridge Univ. Press).
[5] K. S. McCurley, The discrete logarithm problem, in: Cryptology and Computational Number Theory, C. Pomerance (ed.), Proc. Sympos. Appl. Math. 42, Amer. Math. Soc., 1990, 49-74.
[6] I. Shparlinski, On the distribution of recurring sequences, Problemy Peredachi Informatsii 25 (2) (1989), 46-53 (in Russian).
[7] I. Shparlinski, On the distribution of values of recurring sequences and the Bell numbers in finite fields, European J. Combin. 12 (1991), 81-87
Typ dokumentu
Bibliografia
Identyfikatory
Identyfikator YADDA
bwmeta1.element.bwnjournal-article-aav65i3p221bwm
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.