On a fast version of a pseudorandom generator

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

Volumn 4123 LNCS, Issue , 2006, Pages 326-342

  Gyarmati, K ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

DISCRETE LOGARITHMS; FAST ALGORITHMS; PSEUDO-RANDOM PROPERTIES; PSEUDORANDOM GENERATORS; PSEUDORANDOM SEQUENCES;

ARTIFICIAL INTELLIGENCE;

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

References (13)

1. R. Ahlswede, C Mauduit, and A. Sárközy, Large families of pseudorandom sequences of k symbols and their complexity, Part I, Part II, this volume.
2. R. Ahlswede, L.H. Khachatrian, C Mauduit, and A. Sárközy, A complexity measure for families of binary sequences, Periodica Math. Hungar. 46, 107-118, 2003. (Pubitemid 37224119)
3. J. Cassaigne, C. Mauduit, and A. Sárközy, On finite pseudorandom binary sequences VII: The measures of pseudorandomness, Acta Arith. 103, 97-118, 2002. (Pubitemid 37072858)
4. L. Goubin, C Mauduit, and A. Sárközy, Construction of large families of pseudorandom binary sequences, J. Number Theory 106, No. 1, 56-69, 2004. (Pubitemid 38582661)
5. K. Gyarmati, On a family of pseudorandom binary sequences, Period. Math. Hungar. 49, No. 2, 45-63, 2004. (Pubitemid 40273326)
6. K. Gyarmati, On a pseudorandom property of binary sequences, Ramanujan J. 8, No. 3, 289-302, 2004. (Pubitemid 40405620)
7. D. R. Heath-Brown, Zero-free regions for Dirichlet L-functions and the least prime in an arithmetic progression, Proc. London Math. Soc. 64, 265-338, 1992.
8. N. Koblitz, A Course in Number Theory and Cryptography, Graduate Texts in Mathematics 114, Springer-Verlag, New-York, 1994.
9. C. Mauduit and A. Sárközy, On finite pseudorandom binary sequences I: Measures of pseudorandomness, the Legendre symbol, Acta Arith. 82, 365-377, 1997.
10. C. Mauduit and A. Sárközy, On the measures of pseudorandomness of binary sequences, Discrete Math. 271, 195-207, 2003.
11. C. Mauduit, J. Rivat, and A. Sárközy, Construction of pseudorandom binary sequences using additive characters, Monatshefte Math., 141, No. 3, 197-208, 2004. (Pubitemid 38430604)
12. A. Sárközy, A finite pseudorandom binary sequence, Studia Sci. Math. Hungar. 38, 377-384, 2001.
13. A. Weil, Sur les courbes algébriques et les variétés qui s'en déduisent, Act. Sci. Ind. 1041, Hermann, Paris, 1948.