La primauté en temps polynomial [d'après Adleman, Huang; Agrawal, Kayal, Saxena]

Asterisque

Volumn , Issue 294, 2004, Pages 205-230

  Morain, François ^a  

^a ÉCOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33748754276     PISSN: 03031179     EISSN: None     Source Type: Book Series    
DOI: None     Document Type: Review

References (76)

1. L.M. ADLEMAN - «On distinguishing prime numbers from composite numbers», in Foundations of computer science, IEEE, 1980, 21st FOCS, Syracuse, USA, Proceedings, p. 387-406.
2. L.M. ADLEMAN & M.-D.A. HUANG - Primality testing and Abelian varieties over finite fields, Lecture Notes in Math., vol. 1512, Springer-Verlag, 1992.
3. L.M. ADLEMAN, C. POMERANCE & R.S. RUMELY - «On distinguishing prime numbers from composite numbers», Ann. of Math. (2) 117 (1983), p. 173-206.
4. L.M. ADLEMAN, R.L. RIVEST & A. SHAMIR - «A method for obtaining digital signatures and public-key cryptosystems», Comm. ACM 21 (1978), no. 2, p. 120-126.
5. M. AGRAWAL & S. BISWAS - «Primality and identity testing via chinese remaindering», in Proc. Ann. IEEE Symp. Found. Comp. Sci., 1999, p. 202-209.
6. M. AGRAWAL, N. KAYAL & N. SAXENA - «PRIMES is in P», Preprint; available at http://www.cse.iitk.ac.in/primality.pdf, 2002.
7. W.R. ALFORD, A. GRANVILLE & C. POMERANCE - «There are infinitely many Carmichael numbers», Ann. of Math. (2) 139 (1994), no. 3, p. 703-722.
8. M. ARTJUHOV - «Certain criteria for the primality of numbers connected with the little Fermat theorem (russian)», Acta Arith. 12 (1966/67), p. 355-364.
9. A.O.L. ATKIN & F. MORAIN. - «Elliptic curves and primality proving», Math. Comp. 61 (1993), no. 203, p. 29-68.
10. E. BACH - «Explicit bounds for primality testing and related problems», Math. Comp. 55 (1990), no. 191, p. 355-380.
11. R.C. BAKER & G. HARMAN - «The Brun-Titschmarsh theorem on average», in Proceedings of a conference in Honor of Heini Halberstam, vol. 1, 1996, p. 39-103.
12. R.C. BAKER, G. HARMAN & J. PINTZ - «The difference between consecutive primes. II», Proc. London Math. Soc. (3) 83 (2001), no. 3, p. 532-562.
13. D. BERNSTEIN - «An exposition of the Agrawal-Kayal-Saxena primality-proving theorem», Preprint, 2002.
14. _, «Proving primality after Agrawal-Kayal-Saxena», http://cr.yp.to/papers/aks.ps, 2003.
15. _, «Proving primality in essentially quartic expected time», http://cr.yp.to/papers/quartic.ps, 2003.
16. P. BERRIZBEITIA - «Sharpening "Primes is in P" for a large family of numbers», http://arxiv.org/abs/math.NT/0211334, 2002.
17. I. BLAKE, G. SEROUSSI & N. SMART - Elliptic curves in cryptography, London Math. Soc. Lecture Note Ser., vol. 265, Cambridge University Press, 1999.
18. W. BOSMA & M.-P. VAN DER HULST - «Primality proving with cyclotomy», Thèse, Universiteit van Amsterdam, 1990.
19. m ± 1», Math. Comp. 29 (1975), no. 130, p. 620-647.
20. n ± 1, b = 2, 3, 5, 6, 7, 10, 11, 12 up to high powers, 2 éd., Contemporary Mathematics, no. 22, AMS, 1988.
21. O. CAPROTTI & M. OOSTDIJK - «Formal and efficient primality proofs by use of computer algebra oracles», J. Symbolic Comput. 32 (2001), p. 55-70.
22. H.F. CHAU & H.-K. Lo - «Primality test via quantum factorization», Internat. J. Modern Phys. C 8 (1997), no. 2, p. 131-138.
23. Q. CHENG - «Primality proving via one round in ECPP and one iteration in AKS», in Advances in Cryptology - CRYPTO 2003 (D. Boneh, éd.), Lecture Notes in Comput. Sci., vol. 2729, Springer Verlag, 2003, p. 338-348.
24. H. COHEN - A course in algorithmic algebraic number theory, Graduate Texts in Mathematics, vol. 138, Springer-Verlag, 1996, Third printing.
25. H. COHEN & A.K. LENSTRA - «Implementation of a new primality test», Math. Comp. 48 (1987), no. 177, p. 103-121.
26. H. COHEN & H.W. LENSTRA, JR. - «Primality testing and Jacobi sums», Math. Comp. 42 (1984), no. 165, p. 297-330.
27. L. COMTET - Analyse combinatoire, Presses Universitaires de France, 1970.
28. 2, John Wiley & Sons, 1989.
29. R. CRANDALL & C. POMERANCE - Prime numbers - a computational perspective, Springer Verlag, 2000.
30. N.D. ELKIES - «Elliptic and modular curves over finite fields and related computational issues», in Computational Perspectives on Number Theory : Proceedings of a Conference in Honor of A.O.L. Atkin (D.A. Buell & J.T. Teitelbaum, éds.), AMS/IP Studies in Advanced Mathematics, vol. 7, American Mathematical Society, International Press, 1998, p. 21-76.
31. E. FOUVRY - «Théorème do Brun-Titschmarsh; application au théorème de Fermat», Invent. Math. 79 (1985), p. 383-407.
32. J. FRANKE, T. KLEINJUNG, F. MORAIN & T. WIRTH - «Proving the primality of very large numbers with fastECPP», in Algorithmic Number Theory (D. Buell, éd.), Lecture Notes in Comput. Sci., Springer Verlag, 2004, 6th International Symposium, ANTS-IV, Burlington, June 2004, Proceedings.
33. J. VON ZUR GATHEN & J. GERHARD - Modern computer algebra, Cambridge University Press, 1999.
34. P. GAUDRY & R. HARLEY - «Counting points on hyperelliptic curves over finite fields», in Algorithmic Number Theory W. Bosrna, éd.), Lecture Notes in Comput. Sci., vol. 1838, Springer Verlag, 2000, 4th International Symposium, ANTS-IV, Leiden, The Netherlands, July 2000, Proceedings, p. 313-332.
35. M. GOLDFELD - «On the number of primes p for which p + a has a large prime factor», Mathematika 16 (1969), p. 23-27.
36. S. GOLDWASSER & J. KILIAN - «Almost all primes can be quickly certified», in Proc. 18th STOC, ACM, 1986, May 28-30, Berkeley, p. 316-329.
37. _, «Primality testing using elliptic curves», Journal of the ACM 46 (1999), no. 4, p. 450-472.
38. D.R. HEATH-BROWN - «The differences between consecutive primes», J. London Math. Soc. (2) 18 (1978), no. 1, p. 7-13.
39. K. IRELAND & M. ROSEN - A classical introduction to modern number theory, Graduate Texts in Mathematics, vol. 84, Springer, 1982.
40. H. IWANIEC & M. JUTILA - «Primes in short intervals», Ark. Mat. 17 (1979), no. 1, p. 167-176.
41. N. KAYAL & N. SAXENA - «Towards a deterministic polynomial-time primality test», Technical report, IIT Kanpur, 2002, http://www.cse.iitk. ac.in/research/btp2002/primality.html.
42. D.E. KNUTH - The Art of Computer Programming : Seminumerical algorithms, 2nd éd., Addison-Wesley, 1981.
43. H. LANGE & W. RUPPERT - «Complete systems of addition Laws on abelian variety», Invent. Math. 79 (1985), p. 603-610.
44. D.H. LEHMER - «Strong Carmichael numbers», J. Austral. Math. Soc. Ser. A 21 (1976), p. 508-510.
45. A.K. LENSTRA & H.W. LENSTRA, JR. - «Algorithms in number theory», in Handbook of Theoretical Computer Science (J. van Leeuwen, éd.), vol. A : Algorithms and Complexity, North Holland, 1990, p. 674-715.
46. _(éds.) - The development of the number field sieve, Lecture Notes in Math., vol. 1554, Springer, 1993.
47. H.W. LENSTRA, JR. - «Miller's primality test», Inform. Process. Lett. 8 (1979), no. 2, p. 86-88.
48. _, «Primality testing algorithms (after Adleman, Rumely, Williams)», in Séminaire Bourbaki (1080/81), Lecture Notes in Math., vol. 901, Springer-Verlag, 1981, exposé no 576.
49. _, «Primality testing», in Computational methods in number theory, Part I, Math. Centrum, Amsterdam, 1982, p. 55-77.
50. _, «Primality testing with Artin symbols», in Number theory related to Format's last theorem (Cambridge, Mass., 1981), Progr. Math., vol. 26, Birkhäuser Boston, Mass., 1982, p. 341-347.
51. _, «Galois theory and primality testing», in Orders and their applications (I. Reiner & K. W. Roggenkamp, éds.), Lecture Notes in Math., vol. 1142, Springer, 1984, Proc. of a conference, Oberwolfach, June 3-9, 1984, p. 169-189.
52. _, «Elliptic curves and number-theoretic algorithms», in Proceedings of the International Congress of Mathematicians, Vol. 1, 2 (Berkeley, Calif., 1986) (Providence, RI), Amer. Math. Soc., 1987, p. 99-120.
53. _, «Factoring integers with elliptic curves», Ann. of Math. (2) 126 (1987), p. 649-673.
54. A. MENEZES, P.C. VAN OORSCHOT & S.A. VANSTONE - Handbook of applied cryptography, CRC Press, 1997.
55. P. MIHǍILESCU - «Cyclotomy of rings and primality testing», Diss. ETH No. 12278, Swiss Federal Institute of Technology Zürich, 1997.
56. P. MIHǍILESCU & R. AVANZI - «Efficient quasi-deterministic primality test improving AKS», Available from http://www-math.uni-paderborn.de/~preda/papers/myaks1.ps, april 2003.
57. G.L. MILLER - «Riemann's hypothesis and tests for primality», in Proc. 7th STOC, 1975, p. 234-239.
58. F. MORAIN - «Calcul du nombre de points sur une courbe elliptique dans un corps fini : aspects algorithmiques», J. Théor. Nombres Bordeaux 7 (1995), p. 255-282.
59. _, «Implementing the asymptotically fast version of the elliptic curve primality proving algorithm», Available at http://www.lix. polytechnique.fr/Labo/Francois.Morain/, 2003.
60. C.H. PAPADIMITRIOU - Computational complexity, Addison-Wesley, 1995.
61. C. POMERANCE - «Analysis and comparison of some integer factoring algorithms», in Computational methods in number theory (H.W. Lenstra, Jr. & R. Tijdeman, éds.), Mathematisch Centrum, Amsterdam, 1982, Mathematical Center Tracts 154/155, p. 89-140.
62. _, «Very short primality proofs», Math. Comp. 48 (1987), no. 177, p. 315-322.
63. 9», Math. Comp. 35 (1980), no. 151, p. 1003-1026.
64. V.R. PRATT - «Every prime has a succint certificate», SIAM J. Comput. 4 (1975), p. 214-220.
65. M. RABIN - «Probabilistic algorithms for testing primality», J. Number Theory 12 (1980), p. 128-138.
66. J. RADHAKRISHNAN - «Primes in P», Bull. of the EATCS 78 (2002), p. 61-65.
67. P. RIBENBOIM - The new book of prime number records, Springer-Verlag, 1996.
68. J.B. ROSSER & L. SCHOENFELD - «Approximate formulas for some functions of prime numbers, Illinois J. Math. 6 (1962), p. 64-94.
69. R. SCHOOF - «Elliptic curves over finite fields and the computation of square roots mod p», Math. Comp. 44 (1985), p. 483-494.
70. _, «Counting points on elliptic curves over finite fields», J. Théor. Nombres Bordeaux 7 (1995), p. 219-254.
71. P.W. SHOR - «Algorithms for quantum conputation : Discrete logarithms and factoring», in Proceedings 26th Annual ACM Symposium on Theory of Computing (STOC) (Montreal, Canada), ACM, 1994, p. 124-134.
72. R. SOLOVAY & V. STRASSEN - «A fast Monte-Carlo test for primality», SIAM J. Comput. 6 (1977), no. 1, p. 84-85, Erratum, ibid, volume 7, 1, 1978.
73. P. VAN WAMELEN - «Jacobi sums over finite fields», Acta Arith. 102.1 (2002), p. 1-20.
74. E. WATERHOUSE - «Abelian varieties over finite fields», Ann. Sci. École Norm. Sup. 2 (1969), p. 521-560.
75. A. WENG - «Constructing hyperelliptic curves of genus 2 suitable for cryptography», Math. Comp. 72 (2003), p. 435-458.
76. H.C. WILLIAMS & J.O. SHALLIT - «Factoring integers before computers», in Mathematics of Computation 1943-1993 : a half-century of computational mathematics (Vancouver, BC, 1993), Proc. Sympos. Appl. Math., vol. 48, Amer. Math. Soc., Providence, RI, 1994, p. 481-531.