N x N* avec a < b, on note 'l1(x, y; a, b) le nombre des entiers n :s;; x congrus à a modulo b tels que P(n) :s;; ,
106-107) On peut supposer y ): 11 car dans le cas contraire, on a 'l1 (x, y) « (log x)4. Sous cette hypothèse on peut écrire, pour tout a > 0, 'l1 (x, y) :s;; X3 ,
On the complexity offamilies of binary sequences, Period, Math. Hungar, vol.462, pp.107-118, 2003. ,
Measures of pseudorandomness for finite sequences: minimal values ,
Measures of pseudorandomness for finite sequences: typical values, Combinatorics, Probability and Computation ,
A Simple Unpredictable Pseudo-Random Number Generator, SIAM Journal on Computing, vol.15, issue.2, pp.364-383, 1986. ,
DOI : 10.1137/0215025
Inferring sequences produced by pseudo-random number generators, Journal of the ACM, vol.36, issue.1, pp.129-141, 1989. ,
DOI : 10.1145/58562.59305
On the number of positive integers ~ x, and free prime factors> y.ii, Nederl. Akad. Wetensch, Proc. Ser. A 69=Indag, pp.239-247, 1966. ,
On finite pseudorandom binary sequences. III. The Liouville function. L, Acta Arith, pp.367-390, 1999. ,
On finite pseudorandom binary sequences. IV. The Liouville function. II., Acta Arith, pp.343-359, 2000. ,
On finite pseudorandom binary sequences. VII. The measures of pseudorandomness., Acta Arith, pp.97-118, 2002. ,
On the Length of Programs for Computing Finite Binary Sequences, Journal of the ACM, vol.13, issue.4, pp.547-569, 1966. ,
DOI : 10.1145/321356.321363
A course in computational algebraic number theory, Graduate texts in mathematics, 1993. ,
On pseudorandom properties of multiplicative functions, Acta Math. Hungar. 98, pp.273-300, 2003. ,
Multiplicative Number Theory (revised by, 1980. ,
ew Directions in Cryptography, IEEE Transactions on Information Theory, vol.226, pp.644-654, 1976. ,
On the correlation of multiplicative and the sum of additive arithmetic functions, Memoirs of the American Mathematical Society, vol.112, issue.538, p.538, 1994. ,
DOI : 10.1090/memo/0538
On locally repeated values of certain arithmetic functions. II, Acta Mathematica Hungarica, vol.18, issue.1-2, pp.1-2251, 1987. ,
DOI : 10.1007/978-1-4612-9989-9
Discr??pance de suites associ??es ?? un syst??me de num??ration (en dimension s), Acta Arithmetica, vol.41, issue.4, pp.143-182, 1981. ,
DOI : 10.4064/aa-41-4-337-351
Introduction to probability theory l, 1968. ,
Entiers Sans Grand Facteur Premier En Progressions Arithmetiques, Proc. London Math, pp.449-494, 1991. ,
DOI : 10.1112/plms/s3-63.3.449
Deterministic simulation of random processes, Math. Comp, vol.17, pp.28-59, 1963. ,
Calcul des probabilités, Dunod, édition deuxième, 2003. ,
The serial test for sampling numbers and other tests for randomness, Proc. Cambridge Philos, pp.276-284, 1953. ,
DOI : 10.2307/2980655
Construction of large families of pseudorandom binary sequences, Journal of Number Theory, vol.106, issue.1, pp.56-69, 2004. ,
DOI : 10.1016/j.jnt.2003.12.002
URL : https://hal.archives-ouvertes.fr/hal-00153104
On a family of pseudorandom binary sequences, Periodica Math, Hungar, vol.492, pp.1-19, 2004. ,
An inequality between the measures of pseudorandomness, Annales Univ. Sci. Budapest. Eotvos ,
On a fast version of a pseudorandom generator, General Theory of Information Transfer and Combinatorics, Conference Proceedings ,
On the correlation of binary sequences, Studia Sci. Math. Hungar ,
ARTIN'S CONJECTURE FOR PRIMITIVE ROOTS, The Quarterly Journal of Mathematics, vol.37, issue.1, pp.145-172, 1986. ,
DOI : 10.1093/qmath/37.1.27
Random Number Generators, SIAM Review, vol.4, issue.3, pp.230-254, 1962. ,
DOI : 10.1137/1004061
Efficient cryptographie schemes provably as secure as subset sum, J. Cryptology, vol.94, pp.199-216, 1996. ,
DOI : 10.1007/s001459900012
Construction of a random sequence, Nordisk Tidskr, Informations-Behandling, vol.5, pp.246-250, 1965. ,
The art of computer programming Seminumerical algorithms, Addison-Wesley series in computer science and information processing, 1981. ,
Three approaches to the definition of the concept "quantity of information, Problemy Peredaci Informacii, pp.3-11, 1965. ,
Uniform distribution of sequences, 1974. ,
Testing statistical hypotheses, 1959. ,
Mathematical methods in large-scale computing units, Proceedings of a Second Symposium on Large-Scale Digital Calculating Machinery, pp.141-146, 1949. ,
The uniform distribution of the sequence {a), X}. (Russian), Mat. Sb. (N.S.), vol.98, pp.207-222, 1975. ,
Pseudorandomness and cryptographic applications, Princeton university press, ew Jersey, 1996. ,
RANDOM NUMBERS FALL MAINLY IN THE PLANES, Proceedings of the National Academy of Sciences, vol.61, issue.1, pp.61-86, 1968. ,
DOI : 10.1073/pnas.61.1.25
A current view of random number generation, Proceedings of the Sixteenth Syposium on the Interface, pp.3-10, 1985. ,
The definition of random sequences, Information and Control, vol.9, issue.6, pp.602-619, 1966. ,
DOI : 10.1016/S0019-9958(66)80018-9
On the pseudo-random properties of ne, Illinois J. Math, vol.461, pp.185-197, 2002. ,
On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol, Acta Arithmetica, vol.82, issue.4, pp.365-377, 1997. ,
DOI : 10.4064/aa-82-4-365-377
On finite pseudorandom binary sequences. II. The Champernowne, Rudin-Shapiro, and Thue-Morse sequences, a further construction, J. Number Theory, vol.732, pp.256-276, 1998. ,
On finite pseudorandom binary sequences. V. On (na) and (n 2 a) sequences, Monatsh. Math, vol.1293, pp.197-216, 2000. ,
On finite pseudorandom binary sequences. VI. On (nka) sequences, Monatsh. Math, vol.1304, pp.281-298, 2000. ,
Handbook of Applied Oryptography ,
Quasi-Monte Carlo methods and pseudo-random numbers, Bull. Amer, Math. Soc, vol.846, pp.957-1041, 1978. ,
DOI : 10.1090/s0002-9904-1978-14532-7
URL : http://www.ams.org/bull/1978-84-06/S0002-9904-1978-14532-7/S0002-9904-1978-14532-7.pdf
Random number generation and quasi-Monte Carlo methods, 1992. ,
On the definition of normal numbers, Pacifie J. Math, vol.1, pp.103-109, 1951. ,
Pseudorandom properties of prime factors, Periodica Mathematica Hungarica, vol.3, issue.3, pp.107-118, 2004. ,
DOI : 10.1007/s10998-004-0526-7
URL : https://hal.archives-ouvertes.fr/hal-00145691
Inferring a sequence generated by a linear congruence, 23rd annual symposium on foundations of computer science IEEE, pp.153-159, 1982. ,
On pseudo-random properties of P(n) and P(n + 1)., Period, Math. Hungar, vol.43, pp.1-2121, 2001. ,
On pseudorandom binary sequences and their applications., preprint ,
Chebyshev's Bias, Experimental Mathematics, vol.63, issue.4, pp.173-197, 1994. ,
DOI : 10.2307/2371519
Equations over fini te fields: an elemantary approach, Lecture notes in Mathematics, vol.536, 1976. ,
Irregularities of distribution. VII, Acta Arith, pp.45-50, 1972. ,
Lower Bounds for Discrete Logarithms and Related Problems, Lecture Notes in Comput. Sei, pp.1233-256, 1997. ,
DOI : 10.1007/3-540-69053-0_18
Theorie et Pratique, Vuibert, édition seconde, 2003. ,
A finite pseudorandom binary sequence., Studia Sei, Math. Hungar, vol.38, pp.377-384, 2001. ,
Random numbers generated by linear recurrence modulo two, Mathematics of Computation, vol.19, issue.90, pp.201-209, 1965. ,
DOI : 10.1090/S0025-5718-1965-0184406-1
Introduction à la théorie analytique et probabiliste des nombres, Société mathématique de France, 1995. ,
Les nombres premiers, collection Que sais-je?, 1997. ,
Some extremal functions in Fourier analysis, Bulletin of the American Mathematical Society, vol.12, issue.2, pp.183-216, 1985. ,
DOI : 10.1090/S0273-0979-1985-15349-2
Efficient and secure pseudorandom number generation, Advances in cryptology, pp.193-202, 1984. ,
Sur les courbes alg??briques et les vari??t??s qui s???en d??duisent (Introduction), Act. Sei. Ind, vol.1041, 1948. ,
DOI : 10.1007/978-1-4757-1705-1_46
Theory and applications of trapdoor functions, 23rd annual symposium on foundations of computer science, IEEE, pp.80-91, 1982. ,