{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:51:56Z","timestamp":1743029516307,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031645280"},{"type":"electronic","value":"9783031645297"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-64529-7_4","type":"book-chapter","created":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T15:21:35Z","timestamp":1721143295000},"page":"36-45","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["FastECPP over\u00a0MPI"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Enge","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,17]]},"reference":[{"key":"4_CR1","unstructured":"[SW Rel.] Allombert, B., Belabas, K.: PARI\/GP version\u00a02.15.4 (2024). lic: GPL-2-or-later. url: https:\/\/pari.math.u-bordeaux.fr\/, swhid: $$\\langle $$swh:1:dir:8e76e2daa122f03e6a9206e18a62aa7ab48efb93;origin=https:\/\/pari.math.u-bordeaux.fr\/git\/pari.git;visit=swh:1:snp:cd7a1ce7663980b27dfdfc3e96c97fb073271c02;anchor=swh:1:rel:68863db68dd3d346ce5685ad767360c01dfca26a$$\\rangle $$"},{"issue":"203","key":"4_CR2","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1090\/S0025-5718-1993-1199989-X","volume":"61","author":"AOL Atkin","year":"1993","unstructured":"Atkin, A.O.L., Morain, F.: Elliptic curves and primality proving. Math. Comput. 61(203), 29\u201368 (1993)","journal-title":"Math. Comput."},{"key":"4_CR3","unstructured":"Bernstein, D.J.: How to find smooth parts of integers (2004). Preprint. https:\/\/cr.yp.to\/factorization\/smoothparts-20040510.pdf"},{"issue":"257","key":"4_CR4","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1090\/S0025-5718-06-01786-8","volume":"76","author":"DJ Bernstein","year":"2007","unstructured":"Bernstein, D.J.: Proving primality in essentially quartic random time. Math. Comput. 76(257), 389\u2013403 (2007)","journal-title":"Math. Comput."},{"key":"4_CR5","unstructured":"[SW Rel.] Enge, A.: CM version\u00a00.4.3, Feb. 2024. lic: GPL-3-or-later. url: https:\/\/www.multiprecision.org\/cm\/, swhid: $$\\langle $$swh:1:dir:056f ba450fbd9406efd86a5db93895fa63d212df;origin=https:\/\/gitlab.inria.fr\/enge\/cm;visit=swh:1:snp:d0a38ff75431aab4c91e1a50a51b26 a573e17784;anchor=swh:1:rev:7a6567cf2d98aa9a37166b2c4c99f7dfcecfea58$$\\rangle $$"},{"issue":"266","key":"4_CR6","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1090\/S0025-5718-08-02200-X","volume":"78","author":"A Enge","year":"2009","unstructured":"Enge, A.: The complexity of class polynomial computation via floating point approximations. Math. Comput. 78(266), 1089\u20131107 (2009)","journal-title":"Math. Comput."},{"issue":"2","key":"4_CR7","first-page":"1","volume":"18","author":"A Enge","year":"2018","unstructured":"Enge, A., Hart, W., Johansson, F.: Short addition sequences for theta functions. J. Integer Sequences 18(2), 1\u201334 (2018)","journal-title":"J. Integer Sequences"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/3-540-44828-4_27","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"A Enge","year":"2003","unstructured":"Enge, A., Morain, F.: Fast decomposition of polynomials with known Galois group. In: Fossorier, M., H\u00f8holdt, T., Poli, A. (eds.) AAECC 2003. LNCS, vol. 2643, pp. 254\u2013264. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-44828-4_27"},{"issue":"4","key":"4_CR9","doi-asserted-by":"publisher","first-page":"309","DOI":"10.4064\/aa164-4-1","volume":"164","author":"A Enge","year":"2014","unstructured":"Enge, A., Morain, F.: Generalised weber functions. Acta Arith. 164(4), 309\u2013341 (2014)","journal-title":"Acta Arith."},{"issue":"3","key":"4_CR10","doi-asserted-by":"publisher","first-page":"555","DOI":"10.5802\/jtnb.460","volume":"16","author":"A Enge","year":"2004","unstructured":"Enge, A., Schertz, R.: Constructing elliptic curves over finite fields using double eta-quotients. Journal de Th\u00e9orie des Nombres de Bordeaux 16(3), 555\u2013568 (2004)","journal-title":"Journal de Th\u00e9orie des Nombres de Bordeaux"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1112\/S146115701300020X","volume":"16","author":"A Enge","year":"2013","unstructured":"Enge, A., Schertz, R.: Singular values of multiple eta-quotients for ramified primes. LMS J. Comput. Math. 16, 407\u2013418 (2013)","journal-title":"LMS J. Comput. Math."},{"key":"4_CR12","unstructured":"[SW Rel.] Enge, A., et\u00a0al.: GNU MPC \u2014 A library for multiprecision complex arithmetic with exact rounding version\u00a01.2.1 (2020). lic: LGPL-3-or-later. url: https:\/\/www.multiprecision.org\/mpc\/, swhid: $$\\langle $$swh:1:dir:ebd0a7bca44757a5e4939545d52cc68ef882a306;origin=https:\/\/gitlab.inria.fr\/mpc\/mpc;visit=swh:1:snp:a9728932ea1e828 6f2634cac6ba18a340a184977;anchor=swh:1:rev:1d9a8349c839cf1935 3568ecfa32ace2223084d1$$\\rangle $$"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-540-24847-7_14","volume-title":"Algorithmic Number Theory","author":"J Franke","year":"2004","unstructured":"Franke, J., Kleinjung, T., Morain, F., Wirth, T.: Proving the primality of very large numbers with fastECPP. In: Buell, D. (ed.) ANTS 2004. LNCS, vol. 3076, pp. 194\u2013207. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24847-7_14"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kilian, J.: Almost all primes can be quickly certified. In: Proceedings of the 18th Annual ACM Symposium on Theory of Computing, pp.\u00a0316\u2013329 (1986)","DOI":"10.1145\/12130.12162"},{"key":"4_CR15","unstructured":"[SW Rel.] Granlund, T., et\u00a0al.: GMP \u2014 The GNU Multiple Precision Arithmetic Library version\u00a06.2.1 (2020). lic: LGPL-3-or-later. url: https:\/\/gmplib.org\/, swhid: $$\\langle $$ swh:1:dir:31da2a73b2e10e765fb52996d15e6f5f453453a3;origin=https:\/\/gmplib.org\/repo\/gmp-6.2\/;vi sit=swh:1:snp:f40ef7cd40cb4ccec48e3d4291d44ca8def8f592;anchor =swh:1:rel:acd9a44abc3f7a2a39ab039d3d4ac81eb57e5943$$\\rangle $$"},{"key":"4_CR16","unstructured":"[SW Rel.] Hanrot, G., et\u00a0al.: GNU MPFR \u2014 A library for multiple-precision floating-point computations with exact rounding version\u00a04.1.0 (2020). lic: LGPL-3-or-later. url: https:\/\/www.mpfr.org\/, swhid: $$\\langle $$swh:1:dir:0e32d50b65ab886c5bcd44f63e3394980ad2fcdb;origin=https:\/\/gitlab.inria.fr\/mpfr\/mpfr;visit=swh:1:snp:22ecd8c12efff 07509da63e0f9ce6dddda4e3b8b;anchor=swh:1:rel:e956e33703ea78dd 0f263ed6b872e5c9bf83d010$$\\rangle $$"},{"key":"4_CR17","unstructured":"[SW Rel.] Hart, W., et\u00a0al.: FLINT: fast library for number theory version\u00a02.9.0 (2022). lic: LGPL-2.1-or-later. url: https:\/\/flintlib.org\/, swhid: $$\\langle $$swh:1:dir:d7c1dec3fb591a70205462058c842a245c68 dd31;origin=https:\/\/github.com\/flintlib\/flint;visit=swh:1:snp :c82faab4eaecd9393bff3fcd224d3cf65699e51b;anchor=swh:1:rev:e1 43df4b0f19d2f841e36234a12b69f48c4359b9$$\\rangle $$"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Lenstra, A.K., Lenstra Jr, H.W.: Algorithms in number theory. In: Algorithms and Complexity. Ed. by Jan van Leeuwen. vol.\u00a0A. Handbook of Theoretical Computer Science. Amsterdam: Elsevier, pp.\u00a0674\u2013715 (1990)","DOI":"10.1016\/B978-0-444-88071-0.50017-5"},{"issue":"257","key":"4_CR19","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1090\/S0025-5718-06-01890-4","volume":"76","author":"F Morain","year":"2007","unstructured":"Morain, F.: Implementing the asymptotically fast version of the elliptic curve primality proving algorithm. Math. Comput. 76(257), 493\u2013505 (2007)","journal-title":"Math. Comput."},{"key":"4_CR20","unstructured":"Morain, F.: La primalit\u00e9 en temps polynomial [d\u2019apr\u00e8s Adleman, Huang; Agrawal, Kayal, Saxena]. In: Ast\u00e9risque\u00a0294(917), 205\u2013230 (2004)"},{"key":"4_CR21","first-page":"64","volume":"6","author":"JB Rosser","year":"1962","unstructured":"Rosser, J.B., Schoenfeld, L.: Approximate formulas for some functions of prime numbers. Ill. J. Math. 6, 64\u201394 (1962)","journal-title":"Ill. J. Math."},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Schertz, R.: \u201cDie singul\u00e4ren Werte der Weberschen Funktionen \n\n                  \n                , $$\\gamma _2$$, $$\\gamma _3$$\u201d. In: Journal f\u00fcr die reine und angewandte Mathematik 286\/287, pp.\u00a046\u201374 (1976)","DOI":"10.1515\/crll.1976.286-287.46"}],"container-title":["Lecture Notes in Computer Science","Mathematical Software \u2013 ICMS 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-64529-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T15:21:54Z","timestamp":1721143314000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-64529-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031645280","9783031645297"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-64529-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"17 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICMS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Congress on Mathematical Software","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Durham","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icms2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/maths.dur.ac.uk\/icms2024\/ICMS2024.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}