R. 1. Agrawal, N. Kayal, and N. Saxena, PRIMES is in P, Annals of Mathematics, vol.160, issue.2, pp.781-793, 2004.
DOI : 10.4007/annals.2004.160.781

E. Bach, How to Generate Factored Random Numbers, SIAM Journal on Computing, vol.17, issue.2, pp.179-193, 1988.
DOI : 10.1137/0217012

M. B. Barban, THE 'LARGE SIEVE' METHOD AND ITS APPLICATIONS IN THE THEORY OF NUMBERS, Uspehi Mat. Nauk, pp.51-102, 1966.
DOI : 10.1070/RM1966v021n01ABEH004146

J. Brandt and I. Damgård, On Generation of Probable Primes by Incremental Search, Lecture Notes in Computer Science, vol.740, pp.358-370, 1992.
DOI : 10.1007/3-540-48071-4_26

J. Brandt, I. Damgård, and P. Landrock, Speeding up prime number generation, ASIACRYPT, pp.440-449, 1991.
DOI : 10.1007/3-540-57332-1_37

R. Cramer and V. Shoup, Signature schemes based on the strong RSA assumption, ACM Transactions on Information and System Security, vol.3, issue.3, pp.161-185, 2000.
DOI : 10.1145/357830.357847

H. Davenport, Multiplicative Number Theory, Graduate Texts in Mathematics, vol.74, 1980.
DOI : 10.1007/978-1-4757-5927-3

H. Davenport and H. Halberstam, Primes in arithmetic progressions. Michigan Math, J, vol.13, pp.485-489, 1966.

C. De-la-vallée-poussin, Recherches analytiques sur la théorie des nombres premiers, Ann. Soc. Sci. Bruxelles, vol.20, pp.281-397, 1896.

D. Eastlake-3rd, J. Schiller, and S. Crocker, Randomness Requirements for Security, RFC, vol.4086, 2005.
DOI : 10.17487/rfc4086

J. B. Friedlander and A. Granville, Limitations to the Equi-Distribution of Primes I, The Annals of Mathematics, vol.129, issue.2, pp.363-382, 1989.
DOI : 10.2307/1971450

P. X. Gallagher, The large sieve, Mathematika, vol.8, issue.01, pp.14-20, 1967.
DOI : 10.1112/plms/s2-32.1.273

P. X. Gallagher, On the distribution of primes in short intervals, Mathematika, vol.24, issue.01, pp.4-9, 1976.
DOI : 10.1007/BF02403921

G. H. Hardy and J. E. Littlewood, Some problems of 'partitio numerorum': III. on the expression of a number as a sum of primes, pp.1-70, 1922.

G. H. Hardy and E. M. Wright, An introduction to the theory of numbers, Bulletin of the American Mathematical Society, vol.35, issue.6, 1960.
DOI : 10.1090/S0002-9904-1929-04793-1

M. Joye and P. Paillier, Fast Generation of Prime Numbers on Portable Devices: An Update, CHES, pp.160-173, 2006.
DOI : 10.1007/11894063_13

M. Joye, P. Paillier, and S. Vaudenay, Efficient Generation of Prime Numbers, CHES, pp.340-354, 1965.
DOI : 10.1007/3-540-44499-8_27

U. Maurer, Some number-theoretic conjectures and their relation to the generation of cryptographic primes, Cryptography and Coding '92, pp.173-191, 1992.

U. M. Maurer, Fast Generation of Secure RSA-Moduli with Almost Maximal Diversity, EUROCRYPT, pp.636-647, 1989.
DOI : 10.1007/3-540-46885-4_60

U. M. Maurer, Fast generation of prime numbers and secure public-key cryptographic parameters, Journal of Cryptology, vol.8, issue.3, pp.123-155, 1995.
DOI : 10.1007/BF00202269

P. Mih?-ailescu, Fast Generation of Provable Primes Using Search in Arithmetic Progressions, Lecture Notes in Computer Science, vol.839, pp.282-293, 1994.
DOI : 10.1007/3-540-48658-5_27

P. Mih?-ailescu, Security of biased sources for cryptographic keys, Cryptography and computational number theory, pp.287-302, 1999.

H. L. Montgomery, Topics in Multiplicative Number Theory, Lecture Notes in Mathematics, vol.227, 1971.
DOI : 10.1007/BFb0060851

H. L. Montgomery, Problems concerning prime numbers, Proc. Symp. Pure Math, pp.307-310, 1976.

M. Rabin, Probabilistic algorithm for testing primality, Journal of Number Theory, vol.12, issue.1, pp.128-138, 1980.
DOI : 10.1016/0022-314X(80)90084-0
URL : http://doi.org/10.1016/0022-314x(80)90084-0

V. Shoup, A Computational Introduction to Number Theory and Algebra (Version 2), Acta Sci. Math. Szeged, vol.8, issue.4, pp.226-235, 1936.
DOI : 10.1017/cbo9781139165464
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.5080

A. Walfisz, Zur additiven Zahlentheorie. II., Mathematische Zeitschrift, vol.40, issue.1, pp.592-607, 1936.
DOI : 10.1007/BF01218882