Skip to main content
Log in

On Pseudorandomness in Families of Sequences Derived from the Legendre Symbol

  • Published:
Periodica Mathematica Hungarica Aims and scope Submit manuscript

Abstract

We construct a family of finite binary sequences which has a remarkable uniformity with respect to specification of several terms and which also has the property that every sequence in the family has small measures of normality, well distribution in arithmetical progressions and multiple correlations. We also construct a pseudorandom bit generator whose output consists of members of the family.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. R. Ahlswede, L. Khachatrian, C. Mauduit and A. Sárközy, A complexity measure for families of binary sequences, Period. Math. Hungar., 46 (2003), 107–118.

    Article  MathSciNet  MATH  Google Scholar 

  2. W. Alexi, B. Chor, O. Goldreich and O.P. Schnarr, RSA and Rabin functions: Certain parts are as hard as the whole, SIAM J. Comp., 17 (1988), 194–209.

    Article  MathSciNet  MATH  Google Scholar 

  3. M. Anshel and D. Goldfeld, Zeta functions, one-way functions, and pseudorandom number generators, Duke Math. J., 88 (1997), 371–390.

    Article  MathSciNet  MATH  Google Scholar 

  4. E. Bach, Realistic analysis of some randomized algorithms, 19th ACM Symp. on Theory of Comp., 1987.

    Google Scholar 

  5. E. Bach and J. Shallit, Algorithmic Number Theory, Volume I: Efficient Algorithms, MIT Press, Cambridge, Mass., 1996.

    MATH  Google Scholar 

  6. M. Blum and S. Micali, How to generate cryptographically strong sequences of pseudorandom bits, SIAM J. Comp., 13 (1984), 850–864.

    Article  MathSciNet  MATH  Google Scholar 

  7. L. Blum, M. Blum and M. Shub, A simple unpredictable pseudorandom number generator, SIAM J. Comp., 15 (1986), 364–383.

    Article  MathSciNet  MATH  Google Scholar 

  8. J. Cassaigne, S. Ferenczi, C. Mauduit, J. Rivat and A. Sárközy, On finite pseudorandom binary sequences III: The Liouville function. I, Acta Arith., 87 (1999), 367–390.

    MathSciNet  MATH  Google Scholar 

  9. J. Cassaigne, C. Mauduit and A. Sárközy, On finite pseudorandom binary sequences VII: The measures of pseudorandomness, Acta Arith., 103 (2002), 97–118.

    Article  MathSciNet  MATH  Google Scholar 

  10. I. Damgård, On the randomness of Legendre and Jacobi sequences, Lect. Notes in Comp. Sci., 403, Springer-Verlag, Berlin, 1990, 163–172.

    Google Scholar 

  11. H. Davenport, On the distribution of quadratic residues (mod p), J. London Math. Soc., 6 (1931), 49–54.

    Article  MathSciNet  MATH  Google Scholar 

  12. H. Davenport, On the distributions of quadratic residues (mod p), J. London Math. Soc., 8 (1933), 46–52.

    Article  MathSciNet  MATH  Google Scholar 

  13. A. O. Gelfond and Yu. V. Linnik, Elementary methods in analytic number theory, Rand McNally, Chicago, Illinois, 1965.

    Google Scholar 

  14. L. Goubin, C. Mauduit and A. Sárközy, Construction of large families of pseudorandom binary sequences, J. Number Theory, 106 (2004), 56–69.

    Article  MathSciNet  MATH  Google Scholar 

  15. K. Gyarmati, On a family of pseudorandom binary sequences, Period. Math. Hungar., 49 (2004), 45–63.

    Article  MathSciNet  MATH  Google Scholar 

  16. K. Gyarmati, On a pseudorandom property of binary sequences, Ramanujan J., 8 (2004), 289–302.

    Article  MathSciNet  MATH  Google Scholar 

  17. C. Hooley, On Artin's conjecture, J. Reine Angew. Math., 225 (1967), 209–220.

    MathSciNet  MATH  Google Scholar 

  18. J. Hoffstein and D. Lieman, The distribution of the quadratic symbol in function fields and a faster mathematical stream cipher, Progress in Computer Science and Applied Logic, 20, Birkhäuser Verlag, Basel, Switzerland, 2001, 59–68.

    Google Scholar 

  19. E. Jacobstahl, Anwendungen einer Formel aus der Theorie der quadratischen Reste, Dissertation, Berlin, 1906, 26–32.

    Google Scholar 

  20. D. E. Knuth, The Art of Computer Programming, Vol. 2, 2nd ed., Addison-Wesley, Reading, Mass., 1981.

    MATH  Google Scholar 

  21. Y. Kohayakawa, C. Mauduit, C. Moreira and V. Rödl, Measures of pseudorandomness for finite sequences: minimum and typical values, Proceedings of WORDS'03, TUCS Gen. Publ., 27, Turku Cent. Comput. Sci., Turku, 2003, 159–169.

    Google Scholar 

  22. J. Lagarias, Pseudorandom number generators in cryptography and number theory, Cryptology and Computational Number Theory (C. Pomerance, ed.), Proceedings of Symposia in Applied Mathematics, 42, Amer. Math. Soc., 1990, 115–143.

    Google Scholar 

  23. C. Mauduit and A. Sárközy, On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol, Acta Arith., 82 (1997), 365–377.

    MathSciNet  MATH  Google Scholar 

  24. A. Menezes, P. van Oorshot and S. A. Vanstone, Handbook of Applied Cryptography, CRC Press, Boca Raton, 1997.

    MATH  Google Scholar 

  25. R. Peralta, On the distribution of quadratic residues and nonresidues modulo a prime number, Math. Comp., 58 (1992), 433–440.

    Article  MathSciNet  MATH  Google Scholar 

  26. A. Russell and I. Shparlinski, Classical and quantum function reconstruction via character evaluation, J. Compl., 20 (2004), 404–422.

    Article  MathSciNet  MATH  Google Scholar 

  27. A. Sárközy, A finite pseudorandom binary sequence, Studia Sci. Math. Hungar., 38 (2001), 377–384.

    MathSciNet  MATH  Google Scholar 

  28. A. Selberg, Old and new conjectures and results about a class of Dirichlet series, Collected Papers, Vol. 2, Springer-Verlag, Berlin, 1991, 47–63.

    Google Scholar 

  29. A. Weil, Sur les courbes algébriques et les variétés qui s'en déduisent, Act. Sci. Ind., 1041 (1948), Hermann, Paris.

    Google Scholar 

  30. A. Weil, On some exponential sums, Proc. Nat. Acad. Sci. U.S.A., 34 (1948), 204–207.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to András Sárközy.

Additional information

Communicated by Attila Pethő

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sárközy, A., Stewart, C. On Pseudorandomness in Families of Sequences Derived from the Legendre Symbol. Period Math Hung 54, 163–173 (2007). https://doi.org/10.1007/s-10998-007-2163-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s-10998-007-2163-9

Mathematics subject classification number

Key words and phrases

Navigation