Distribution of recurrent sequences modulo prime powers

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

Volumn 1025, Issue , 1995, Pages 188-189

  Pinch, Richard G E ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

AUXILIARY POLYNOMIAL; RECURRENT SEQUENCES;

CRYPTOGRAPHY;

EID: 84947969062     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60693-9_21     Document Type: Conference Paper

References (7)

1. M. Ganley (ed.), Cryptography and coding III, IMA conference series (n.s.), vol. 45, Institute of Mathematics and its Applications, Oxford University Press, 1993, Proceedings, 3rd IMA conference on cryptography and coding, Cirencester, December 1991.
2. Rudolf Lidl and Harald Niederreiter, Finite fields, Encyclopaedia of Mathematics and its applications, vol. 20, Addison-Wesley, Reading Mass., 1983, 0-201-13519-1, Republished, Cambridge University Press, 1984.
3. Rudolf Lidl and Harald Niederreiter, Introduction to finite fields and their applications, second ed., Cambridge University Press, 1994, First edition 1986.
4. M. Mascagni, S.A. Ciccaro, D.V. Pryor, and M.L. Robinson, A fast, high-quality and reproducible lagged-Fibonacci pseudrandom number generator, Technical report SRC-TR-94-115, Supercomputing Research Center, IDA, Bowie, MD, U.S.A., Feb 1994.
5. Harald Niederreiter, Quasi-Monte Carlo methods and pseudo-random numbers, Bull. Amer. Math. Soc. 84 (1978), no. 6, 957-1041.
6. Harald Niederreiter, Recent trends in random number and random vector generation, Ann. Oper. Res. 31 (1991), 323-346.
7. R.G.E. Pinch, Recurrent sequences modulo prime powers, In Ganley [1], Proceedings, 3rd IMA conference on cryptography and coding, Cirencester, December 1991., pp. 297-310.