Abstract
A large family of finite pseudorandom binary sequences is presented, and also tested “theoretically” for pseudorandomness. The optimal way of implementation is discussed and running time analysis is given. Numerical calculations are also presented.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahlswede, R., Khachatrian, L., Mauduit, C., Sárközy, A.: A complexity measure for families of binary sequences. Periodica Mathematica Hungarica 46, 107–118 (2003)
Blum, L., Blum, M., Shub, M.: A simple unpredictable pseudorandom number generator. SIAM Journal on Computing 15, 364–383 (1986)
Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudorandom bits. SIAM Journal on Computing 13, 850–864 (1984)
Burgess, D.A.: The distribution of quadratic residues and non residues. Mathematika 4, 106–112 (1957)
Cassaigne, J., Mauduit, C., Sárközy, A.: On finite pseudorandom binary sequences VII: The measures of pseudorandomness. Acta Arithmetica 103, 97–118 (2002)
Goubin, L., Mauduit, C., Sárközy, A.: Construction of large families of pseudorandom binary sequences. Journal of Number Theory 106, 56–69 (2004)
Gyarmati, K.: On a pseudorandom property of binary sequences. Ramanujan J. 8(3), 289–302 (2004)
Heath-Brown, D.R.: Artin’s conjecture for primitive roots. Quarterly Journal of Math. 37, 27–38 (1986)
Hooley, C.: On Artin’s conjecture. J. reine angew. Math. 226, 209–220 (1967)
Hooley, C.: Application of Sieve Methods to the Theory of Numbers, Cambridge Tracts in Mathematics (1970)
Knuth, D.E.: The Art of Computer Programming, 2nd edn., vol. 2. Addison Wesley, Reading (1981)
Mauduit, C., Sárközy, A.: On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol. Acta Arithmetica 82, 365–377 (1997)
Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Inc., Boca Raton (1997)
Montgomery, H.L.: Topics in Multiplicative Number Theory. Springer, New-York (1971)
Montgomery, H.L., Vaughan, R.C.: Exponential sums with multiplicative coefficients. Inventiones Mathematicae 43, 69–82 (1977)
Montgomery, H.L., Vaughan, R.C.: Mean values of character sums. Canadian Journal of Mathematics 31, 476–487 (1979)
Murata, L.: On the magnitude of the least prime primitive root. Journal of Number Theory 37, 47–66 (1991)
Paley, R.E.A.C.: A theorem on characters. Journal London Math. Soc. 7, 28–32 (1932)
Schinzel, A.: Sur certaines hypothèses concernant les nombres premiers. Acta Arithmetica 7, 1–8 (1961/1962) (Remarks on the paper)
Schinzel, A., Sierpiński, W.: Sur certaines hypothèses concernant les nombres premiers. Acta Arithmetica 4, 185–208 (1958); Corrigendum: ibid 5, 259 (1959)
Sárközy, A.: A finite pseudorandom binary sequence. Studia Sci. Math. Hungar. 38, 377–384 (2001)
Weil, A.: Sur les courbes algébriques et les variétés qui s’en déduisent. Act. Sci. Ind., vol. 1041, Hermann, Paris (1948)
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Rivat, J., Sárközy, A. (2006). On Pseudorandom Sequences and Their Application. In: Ahlswede, R., et al. General Theory of Information Transfer and Combinatorics. Lecture Notes in Computer Science, vol 4123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889342_19
Download citation
DOI: https://doi.org/10.1007/11889342_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46244-6
Online ISBN: 978-3-540-46245-3
eBook Packages: Computer ScienceComputer Science (R0)