Skip to main content
SpringerLink
Log in

Distribution of recurrent sequences modulo prime powers

Abstract

  • Conference paper
  • First Online:
Cryptography and Coding (Cryptography and Coding 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1025))

Included in the following conference series:

Abstract

We study the distribution of linear recurrent sequences modulo p n for prime p when the auxiliary polynomial is irreducible and the period is maximal. We show that such a sequence takes each possible value equally often up to an error of order pn/2.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

References

  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.

    Google Scholar 

  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.

    Google Scholar 

  3. -, Introduction to finite fields and their applications, second ed., Cambridge University Press, 1994, First edition 1986.

    Google Scholar 

  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.

    Google Scholar 

  5. Harald Niederreiter, Quasi-Monte Carlo methods and pseudo-random numbers, Bull. Amer. Math. Soc. 84 (1978), no. 6, 957–1041.

    Google Scholar 

  6. -, Recent trends in random number and random vector generation, Ann. Oper. Res. 31 (1991), 323–346.

    Google Scholar 

  7. R.G.E. Pinch, Recurrent sequences modulo prime powers, In Ganley [1], pp. 297–310.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, 16 Mill Lane, CB2 1SB, Cambridge, UK

    Richard G. E. Pinch

Authors
  1. Richard G. E. Pinch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Colin Boyd

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pinch, R.G.E. (1995). Distribution of recurrent sequences modulo prime powers. In: Boyd, C. (eds) Cryptography and Coding. Cryptography and Coding 1995. Lecture Notes in Computer Science, vol 1025. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60693-9_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-60693-9_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60693-2

  • Online ISBN: 978-3-540-49280-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation