no. 4
Test de primalité et méthodes de factorisation
Publications de l'Institut de recherche mathématiques de Rennes, no. 4 (1985), pp. 148-162. 
@article{PSMIR_1985___4_148_0,
     author = {Nicolas, Jean-Louis},
     title = {Test de primalit\'e et m\'ethodes de factorisation},
     journal = {Publications de l'Institut de recherche math\'ematiques de Rennes},
     pages = {148--162},
     publisher = {D\'epartement de Math\'ematiques et Informatique, Universit\'e de Rennes},
     number = {4},
     year = {1985},
     zbl = {0615.10011},
     language = {fr},
     url = {http://archive.numdam.org/item/PSMIR_1985___4_148_0/}
}
TY  - JOUR
AU  - Nicolas, Jean-Louis
TI  - Test de primalité et méthodes de factorisation
JO  - Publications de l'Institut de recherche mathématiques de Rennes
PY  - 1985
SP  - 148
EP  - 162
IS  - 4
PB  - Département de Mathématiques et Informatique, Université de Rennes
UR  - http://archive.numdam.org/item/PSMIR_1985___4_148_0/
LA  - fr
ID  - PSMIR_1985___4_148_0
ER  - 
%0 Journal Article
%A Nicolas, Jean-Louis
%T Test de primalité et méthodes de factorisation
%J Publications de l'Institut de recherche mathématiques de Rennes
%D 1985
%P 148-162
%N 4
%I Département de Mathématiques et Informatique, Université de Rennes
%U http://archive.numdam.org/item/PSMIR_1985___4_148_0/
%G fr
%F PSMIR_1985___4_148_0
Nicolas, Jean-Louis. Test de primalité et méthodes de factorisation. Publications de l'Institut de recherche mathématiques de Rennes, no. 4 (1985), pp. 148-162. http://archive.numdam.org/item/PSMIR_1985___4_148_0/

[Adl] L.M. Adelman, C. Pomerance, R.S. Rumely : On distinguishing prime numbers from composite numbers. Ann. Math. 117 (1983), p. 173-206. | MR | Zbl

[Can] E.R. Canfield, P. Erdös and C. Pomerance : On a problem of Oppenheim concerning "Factorisatio Numerorum", J. Number Theory 17, 1983, p. 1-28. | MR | Zbl

[Coh 1] H. Cohen : Méthodes de factorisation et nombre de classes des corps quadratiques, Séminaire D.P.P., Paris, 14e année 1972-73, G7. | Numdam | MR | Zbl

[Coh 2] H. Cohen and H.W. Lenstra Jr : Primality testing and Jacobi Sums, Math. of Comp. 42, 1984, p. 297-330. | MR | Zbl

[Coh 3] H. Cohen and A.K. Lenstra : Implementation of a new primality test, preprint, Center for mathematics and Computer Science, Amsterdam. | MR | Zbl

[De B] N.G. De Bruijn : On the number of positive integers ≤x and free of prime factors XML_gt y, II, Nederl. Akad. Wetensch. Proc. Ser. A, 69, 1966, p. 239-247 | Zbl

N.G. De Bruijn : On the number of positive integers ≤x and free of prime factors XML_gt y, = Indag. Math., 28, 1966, p. 239-247. | MR | Zbl

[Dix] J.D. Dixon : Factorization and primality tests, Amer. Math. Monthly 91, 1984, p.333-352. | MR | Zbl

[Guy] R.K. Guy : How to factor a number, Congressus Numerantium XVI, Proc. of the fifth Manitoba Conference on numerical mathematics, 1975, p. 49-89. | MR | Zbl

[Hil] A. Hildebrand and G. Tenenbaum : On integers free of large prime factors, to appear. | MR | Zbl

[Kob] N. Koblitz : Introduction to elliptic curves and modular forms, Springer Verlag, 1984, Graduate texts in mathematics n° 97. | MR | Zbl

[Len] H.W. Lenstra Jr : Prime factorization using elliptic curves, to appear.

[Mai] H. Maier : On integers free of large prime divisors, Preprint.

[Mon] L. Monier : Algorithmes de factorisation d'entiers, Thèse de 3e cycle, Orsay, 1980.

[Nic] J.-L. Nicolas : Tests de primalité, Expositiones Mathematicae 2, 1984, p. 223-234. | MR | Zbl

[Pol] J.-M. Pollard : Theorems on factorization and primality testing, Proc. Cambridge Philos. Soc. 76, 1974, p. 521-528. | MR | Zbl

[Pom 1] C. Pomerance : Analysis and comparison of some integer factoring algorithms, Computational methods in number theory, R. Tijdeman, H. Lenstra (Eds), Mathematisch Centrum, Amsterdam, Tract 154, 1982, p. 89-139 | MR | Zbl

[Pom 2] C. Pomerance : The quadratic sieve factoring algorithm, à paraitre aux compte-rendus d'EUROCRYPT 84. | Zbl

[Rie] H.I. Riesel : Prime numbers and computer methods for factorization, Birkhäuser, 1985, progress in Math. Vol. 57. | MR | Zbl

[Sch] C.P. Schnorr and H.W. Lenstra Jr : A Monte-Carlo Factoring Algorithm with linear storage, Math, of Comp. 43, 1984, p. 289-311. | MR | Zbl

[Sha] D. Shanks : Class number, a theory of factorization and genera, Proc. Symp. Pure Math. 20, A.M.S., 1971, p. 415-440. | MR | Zbl

[Sil] J. Silverman : Arithmetic of elliptic curves, à paraitre, Springer Verlag, Graduate texts in mathematics. | Zbl

[Wie] D. Wiedemann : Solving sparse linear equations over finite fields, preprint. | MR | Zbl