Skip to main content
SpringerLink
Log in

On the Linear Complexity and Multidimensional Distribution of Congruential Generators over Elliptic Curves

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

We show that the elliptic curve analogue of the linear congruential generator produces sequences with high linear complexity and good multidimensional distribution.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • P. Beelen J. Doumen (2002) Pseudorandom sequences from elliptic curves. Finite Fields with Applications to Coding Theory, Cryptography and Related Areas\/, Springer-Verlag Berlin 37–52

    Google Scholar 

  • I. Blake G. Seroussi N. Smart (1999) Elliptic Curves in Cryptography, London Math. Soc., Lecture Note Series Cambridge University Press Cambridge

    Google Scholar 

  • T. W. Cusic C. Ding A. Renvall (1998) Stream Ciphers and Number Theory Elsevier Amsterdam

    Google Scholar 

  • E. El Mahassni and I. E. Shparlinski, On the uniformity of distribution of congruential generators over elliptic curves, In Proc. Intern. Conf. on Sequences and Their Applications, Bergen 2001, Springer-Verlag, London, (2002) pp. 257--264.

  • A. M. Frieze J. Håstad R. Kannan J. C. Lagarias A. Shamir (1988) ArticleTitleReconstructing truncated integer variables satisfying linear congruence SIAM J. Comp. 17 262–280 Occurrence Handle0654.10006

    MATH  Google Scholar 

  • G. Gong T. A. Berson D. A. Stinson (2000) Elliptic curve pseudorandom sequence generators, Lecture Notes in Computer Science Springer-Verlag Berlin 34–49

    Google Scholar 

  • G. Gong and C. C. Y. Lam, Linear recursive sequences over elliptic curves, Proc. Intern. Conf. on Sequences and Their Applications, Bergen 2001, Springer-Verlag, London, (2002) pp. 182–196.

  • S. Hallgren, Linear congruential generators over elliptic curves, Preprint CS-94-143\/, Dept. of Comp. Sci., Cornegie Mellon Univ., (1994) pp. 1–10.

  • A. Joux J. Stern (1998) ArticleTitleLattice reduction: A toolbox for the cryptanalyst J. Cryptology 11 161–185 Occurrence Handle0919.94011 Occurrence Handle1633944

    MATH  MathSciNet  Google Scholar 

  • H. Krawczyk (1992) ArticleTitleHow to predict congruential generators J. Algorithms 13 527–545 Occurrence Handle0784.65006 Occurrence Handle1187200

    MATH  MathSciNet  Google Scholar 

  • S. V. Konyagin I. Shparlinski (1999) Character Sums with Exponential Functions and Their Applications Cambridge University Press Cambridge Occurrence Handle0933.11001

    MATH  Google Scholar 

  • D. R. Kohel I. E. Shparlinski (2000) Exponential sums and group generators for elliptic curves over finite fields, Lecture Notes in Computer Science Springer-Verlag Berlin 395–404

    Google Scholar 

  • J. C. Lagarias, Pseudorandom number generators in cryptography and number theory, In Proc. Symp. in Appl. Math., Amer. Math. Soc., Providence, RI, Vol. 42 (1990) pp. 115--143.

  • C. C. Y. Lam and G. Gong, Randomness of elliptic curve sequences, Research Report CORR 2002-18, Faculty of Math., Univ. Waterloo, Waterloo, (2002) pp. 1–11.

  • A. J. Menezes P. C. Oorschot Particlevan S. A. Vanstone (1996) Handbook of Applied Cryptography CRC Press Boca Raton, FL

    Google Scholar 

  • H. Niederreiter (1978) ArticleTitleQuasi-Monte Carlo methods and pseudo-random numbers Bull. Amer. Math. Soc. 84 957–1041 Occurrence Handle0404.65003 Occurrence Handle10.1090/S0002-9904-1978-14532-7 Occurrence Handle508447

    Article  MATH  MathSciNet  Google Scholar 

  • H. Niederreiter (1992) Random Number Generation and Quasi–Monte Carlo Methods SIAM Philadelphia Occurrence Handle0761.65002

    MATH  Google Scholar 

  • H. Niederreiter M. Vielhaber (1997) ArticleTitleLinear complexity profiles: Hausdorff dimensions for almost perfect profiles and measures for general profiles J. Compl. 13 353–383 Occurrence Handle0934.94013 Occurrence Handle1475570

    MATH  MathSciNet  Google Scholar 

  • R. A. Rueppel (1986) Analysis and Design of Stream Ciphers Springer-Verlag Berlin Occurrence Handle0618.94001

    MATH  Google Scholar 

  • I. E. Shparlinski (2000) ArticleTitleOn the Naor–Reingold pseudo-random number function from elliptic curves Appl. Algebra Eng., Commun. Comput. 11 27–34 Occurrence Handle1011.11055 Occurrence Handle1817696

    MATH  MathSciNet  Google Scholar 

  • I. E. Shparlinski J. H. Silverman (2001) ArticleTitleOn the linear complexity of the Naor–Reingold pseudo-random function from elliptic curves Designs, Codes and Cryprography 24 279–289 Occurrence Handle1077.11504 Occurrence Handle1857142

    MATH  MathSciNet  Google Scholar 

  • J. H. Silverman (1995) The Arithmetic of Elliptic Curves Springer-Verlag Berlin

    Google Scholar 

  • S. G. Vlăduţ (1999) ArticleTitleCyclicity statistics for elliptic curves over finite fields Finite Fields Their Appl. 5 13–25 Occurrence Handle0927.11032

    MATH  Google Scholar 

  • S. G. Vlăduţ (1999) ArticleTitle A note on the cyclicity of elliptic curves over finite field extensions Finite Fields Their Appl. 5 354–363 Occurrence Handle1022.11030

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Mathematik MA8-1, Techniscke Universit, Berlin, Strasse des 17, Juni 136, 10623, Berlin, Germany

    Florian Hess

  2. Department of Computing, Macquarie University, Sydney, NSW, 2109, Australia

    Igor E. Shparlinski

Authors
  1. Florian Hess
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Igor E. Shparlinski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Florian Hess.

Additional information

communicated by: A. Menezes

AMS Classification: 11T23, 14H52, 65C10

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hess, F., Shparlinski, I.E. On the Linear Complexity and Multidimensional Distribution of Congruential Generators over Elliptic Curves. Des Codes Crypt 35, 111–117 (2005). https://doi.org/10.1007/s10623-003-6153-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-003-6153-0

Keywords

Search

Navigation