On pseudorandom sequences and their application

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

Volumn 4123 LNCS, Issue , 2006, Pages 343-361

  Rivat, J ^a   Sárkozy, András ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

NUMERICAL CALCULATION; PSEUDO-RANDOM BINARY SEQUENCES; PSEUDORANDOM SEQUENCES; PSEUDORANDOMNESS; RUNNING TIME ANALYSIS;

ARTIFICIAL INTELLIGENCE;

BINARY SEQUENCES;

EID: 57149144092     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11889342_19     Document Type: Conference Paper

References (22)

1. R. Ahlswede, L. Khachatrian, C Mauduit, and A. Sárközy, A complexity measure for families of binary sequences, Periodica Mathematica Hungarica 46, 107-118, 2003. (Pubitemid 37224119)
2. L. Blum, M. Blum, and M. Shub, A simple unpredictable pseudorandom number generator, SIAM Journal on Computing 15, 364-383, 1986. (Pubitemid 16546557)
3. M. Blum and S. Micali, How to generate cryptographically strong sequences of pseudorandom bits, SIAM Journal on Computing 13, 850-864, 1984. (Pubitemid 15510668)
4. D.A. Burgess, The distribution of quadratic residues and non residues, Mathematika 4, 106-112, 1957.
5. J. Cassaigne, C. Mauduit, and A. Sárközy, On finite pseudorandom binary sequences VII: The measures of pseudorandomness, Acta Arithmetica 103, 97-118, 2002. (Pubitemid 37072858)
6. L. Goubin, C Mauduit, and A. Sárközy, Construction of large families of pseudorandom binary sequences, Journal of Number Theory 106, 56-69, 2004. (Pubitemid 38582661)
7. K. Gyarmati, On a pseudorandom property of binary sequences, Ramanujan J. 8, No. 3, 289-302, 2004. (Pubitemid 40405620)
8. D.R. Heath-Brown, Artin's conjecture for primitive roots, Quarterly Journal of Math. 37, 27-38, 1986.
9. C. Hooley, On Artin's conjecture, J. reine angew. Math. 226, 209-220, 1967.
10. C. Hooley, Application of Sieve Methods to the Theory of Numbers, Cambridge Tracts in Mathematics, 1970.
11. D.E. Knuth, The Art of Computer Programming, Vol. 2, Addison Wesley, 2 ed., 1981.
12. C. Mauduit and A. Sárközy, On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol, Acta Arithmetica 82, 365-377, 1997.
13. A. Menezes, P. van Oorschot, and S. Vanstone, Handbook of Applied Cryptography, CRC Press, Inc., 1997.
14. H.L. Montgomery, Topics in Multiplicative Number Theory, Springer Verlag, NewYork, 1971.
15. H.L. Montgomery and R.C Vaughan, Exponential sums with multiplicative coefficients, Inventiones Mathematicae 43, 69-82, 1977.
16. H.L. Montgomery and R.C. Vaughan, Mean values of character sums, Canadian Journal of Mathematics 31, 476-487, 1979.
17. L. Murata, On the magnitude of the least prime primitive root, Journal of Number Theory 37, 47-66, 1991.
18. R.E.A.C. Paley, A theorem on characters, Journal London Math. Soc. 7, 28-32, 1932.
19. A. Schinzel, Remarks on the paper "Sur certaines hypothses concernant les nombres premiers", Acta Arithmetica 7, 1-8, 1961/62.
20. A. Schinzel and W. Sierpiński, Sur certaines hypothses concernant les nombres premiers, Acta Arithmetica 4, 185-208, 1958. Corrigendum: ibid 5, 259, 1959.
21. A. Sárközy, A finite pseudorandom binary sequence, Studia Sci. Math. Hungar. 38, 377-384, 2001.
22. A. Weil, Sur les courbes algbriques et les varits qui s'en dduisent, Vol. 1041 of Act. Sci. Ind., Hermann, Paris, 1948.