{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:43:12Z","timestamp":1742924592220,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319552262"},{"type":"electronic","value":"9783319552279"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-55227-9_9","type":"book-chapter","created":{"date-parts":[[2017,3,8]],"date-time":"2017-03-08T11:32:52Z","timestamp":1488972772000},"page":"105-124","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Generalised Successive Resultants Algorithm"],"prefix":"10.1007","author":[{"given":"James H.","family":"Davenport","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christophe","family":"Petit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Pring","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,9]]},"reference":[{"key":"9_CR1","first-page":"68","volume":"19","author":"M Arora","year":"2012","unstructured":"Arora, M., Ivanyos, G., Karpinski, M., Saxena, N.: Deterministic polynomial factoring and association schemes. Electron. Colloq. Computat. Complex. 19, 68 (2012)","journal-title":"Electron. Colloq. Computat. Complex."},{"key":"9_CR2","unstructured":"Bach, E., von zur Gathen, J., Lenstra, H.: Deterministic factorization of polynomials over special finite fields. University of Wisconsin-Madison, Computer Sciences Department (1988)"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1090\/S0025-5718-1970-0276200-X","volume":"111","author":"E Berlekamp","year":"1970","unstructured":"Berlekamp, E.: Factoring polynomials over large finite fields. Math. Comput. 111, 713\u2013735 (1970)","journal-title":"Math. Comput."},{"key":"9_CR4","unstructured":"Br\u00f6ker, R.: Constructing elliptic curves of prescribed order. Ph.D. thesis, University of Leiden (2006)"},{"issue":"154","key":"9_CR5","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1090\/S0025-5718-1981-0606517-5","volume":"36","author":"DG Cantor","year":"1981","unstructured":"Cantor, D.G., Zassenhaus, H.: A new algorithm for factoring polynomials over finite fields. Math. Comput. 36(154), 587\u2013592 (1981)","journal-title":"Math. Comput."},{"key":"9_CR6","first-page":"33","volume":"46","author":"G Cornacchia","year":"1903","unstructured":"Cornacchia, G.: Su di un metodo per la risoluzione in numeri interi dell\u2019 equazione $$\\sum _{h=0}^nc_hx^{n-h}y^h=p$$. Giornale di Matematiche di Battaglini 46, 33\u201390 (1903)","journal-title":"Giornale di Matematiche di Battaglini"},{"key":"9_CR7","unstructured":"The Sage Developers: SageMath, the Sage Mathematics Software System (Version 6.8) (2015). http:\/\/www.sagemath.org"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/3-540-58691-1_58","volume-title":"Algorithmic Number Theory","author":"S Evdokimov","year":"1994","unstructured":"Evdokimov, S.: Factorization of polynomials over finite fields in subexponential time under GRH. In: Adleman, L.M., Huang, M.-D. (eds.) ANTS 1994. LNCS, vol. 877, pp. 209\u2013219. Springer, Heidelberg (1994). doi:10.1007\/3-540-58691-1_58"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1006\/jsco.1999.1001","volume":"31","author":"S Gao","year":"2001","unstructured":"Gao, S.: On the deterministic complexity of factoring polynomials. J. Symb. Comput. 31, 19\u201336 (2001)","journal-title":"J. Symb. Comput."},{"key":"9_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139856065","volume-title":"Modern Computer Algebra","author":"J von zur Gathen","year":"2013","unstructured":"von zur Gathen, J., Gerhard, J.: Modern Computer Algebra. Cambridge University Press, Cambridge (2013)"},{"issue":"1\/2","key":"9_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1006\/jsco.1999.1002","volume":"31","author":"J von zur Gathen","year":"2001","unstructured":"von zur Gathen, J., Panario, D.: Factoring polynomials over finite fields: a survey. J. Symb. Comput. 31(1\/2), 3\u201317 (2001)","journal-title":"J. Symb. Comput."},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Grenet, B., van der Hoeven, J., Lecerf, G.: Randomized root finding over finite FFT-fields using tangent Graeffe transforms. In: Proceedings of ISSAC, pp. 197\u2013204. ACM (2015)","DOI":"10.1145\/2755996.2756647"},{"issue":"3","key":"9_CR13","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s00200-015-0280-5","volume":"27","author":"B Grenet","year":"2016","unstructured":"Grenet, B., van der Hoeven, J., Lecerf, G.: Deterministic root finding over finite fields using Graeffe transforms. Appl. Algebra Eng. Commun. Comput. 27(3), 237\u2013257 (2016)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"6","key":"9_CR14","doi-asserted-by":"publisher","first-page":"1081","DOI":"10.1587\/transfun.E96.A.1081","volume":"96","author":"R Harasawa","year":"2013","unstructured":"Harasawa, R., Sueyoshi, Y., Aichi, K.: Root computation in finite fields. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 96(6), 1081\u20131087 (2013)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-642-03356-8_18","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"T Icart","year":"2009","unstructured":"Icart, T.: How to hash into elliptic curves. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 303\u2013316. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-03356-8_18"},{"issue":"6","key":"9_CR16","doi-asserted-by":"publisher","first-page":"1767","DOI":"10.1137\/08073408X","volume":"40","author":"KS Kedlaya","year":"2011","unstructured":"Kedlaya, K.S., Umans, C.: Fast polynomial factorization and modular composition. SIAM J. Comput. 40(6), 1767\u20131802 (2011)","journal-title":"SIAM J. Comput."},{"key":"9_CR17","volume-title":"Finite Fields","author":"R Lidl","year":"1997","unstructured":"Lidl, R., Niederreiter, H.: Finite Fields, vol. 20. Cambridge University Press, Cambridge (1997)"},{"key":"9_CR18","unstructured":"De Feo, L., Petit, C., Quisquater, M.: Application of the affine geometry of $${GF}(q^n)$$ to root finding. Poster presented at International Symposium on Symbolic and Algebraic Computation (2015)"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1112\/S1461157014000138","volume":"17A","author":"C Petit","year":"2014","unstructured":"Petit, C.: Finding roots in $$GF(p^n)$$ with the successive resultant algorithm. LMS J. Comput. Math. (Spec. Issue ANTS XI) 17A, 203\u2013217 (2014)","journal-title":"LMS J. Comput. Math. (Spec. Issue ANTS XI)"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-49387-8_1","volume-title":"Public-Key Cryptography \u2013 PKC 2016","author":"C Petit","year":"2016","unstructured":"Petit, C., Kosters, M., Messeng, A.: Algebraic approaches for the elliptic curve discrete logarithm problem over prime fields. In: Cheng, C.-M., Chung, K.-M., Persiano, G., Yang, B.-Y. (eds.) PKC 2016. LNCS, vol. 9615, pp. 3\u201318. Springer, Heidelberg (2016). doi:10.1007\/978-3-662-49387-8_1"},{"issue":"3","key":"9_CR21","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1137\/0405026","volume":"5","author":"L R\u00f3nyai","year":"1992","unstructured":"R\u00f3nyai, L.: Galois groups and factoring polynomials over finite fields. SIAM J. Disc. Math. 5(3), 345\u2013365 (1992)","journal-title":"SIAM J. Disc. Math."},{"key":"9_CR22","unstructured":"Shanks, D.: Five number-theoretic algorithms. In: Proceedings of the Second Manitoba Conference on Numerical Mathematics, pp. 51\u201370 (1972)"},{"issue":"5","key":"9_CR23","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0020-0190(90)90195-4","volume":"33","author":"V Shoup","year":"1990","unstructured":"Shoup, V.: On the deterministic complexity of factoring polynomials over finite fields. Inf. Process. Lett. 33(5), 261\u2013267 (1990)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"9_CR24","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0020-0190(91)90212-Z","volume":"38","author":"V Shoup","year":"1991","unstructured":"Shoup, V.: Smoothness and factoring polynomials over finite fields. Inf. Process. Lett. 38(1), 39\u201342 (1991)","journal-title":"Inf. Process. Lett."},{"key":"9_CR25","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-1-4613-8655-1_10","volume-title":"Arithmetic Geometry","author":"JH Silverman","year":"1986","unstructured":"Silverman, J.H.: Heights and elliptic curves. In: Cornell, G., Silverman, J.H. (eds.) Arithmetic Geometry, pp. 253\u2013265. Springer, Heidelberg (1986)"},{"key":"9_CR26","unstructured":"Tonelli, A.: Bemerkung \u00fcber die Aufl\u00f6sung quadratischer Congruenzen. Nachrichten von der K\u00f6nigl. Gesellschaft der Wissenschaften und der Georg-Augusts-Universit\u00e4t zu G\u00f6ttingen 1891, pp. 344\u2013346 (1891)"},{"key":"9_CR27","first-page":"A238","volume":"273","author":"J V\u00e9lu","year":"1971","unstructured":"V\u00e9lu, J.: Isog\u00e9nies entre courbes elliptiques. Communications de l\u2019Acad\u00e9mie royale des Sciences de Paris. CR Acad. Sci. Paris S\u00e9r. AB 273, A238\u2013A241 (1971)","journal-title":"CR Acad. Sci. Paris S\u00e9r. AB"},{"key":"9_CR28","doi-asserted-by":"publisher","DOI":"10.1201\/9781420071474","volume-title":"Elliptic Curves: Number Theory and Cryptography","author":"LC Washington","year":"2008","unstructured":"Washington, L.C.: Elliptic Curves: Number Theory and Cryptography. CRC Press, Boca Raton (2008)"}],"container-title":["Lecture Notes in Computer Science","Arithmetic of Finite Fields"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-55227-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:04:51Z","timestamp":1710345891000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-55227-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319552262","9783319552279"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-55227-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"9 March 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAIFI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on the Arithmetic of Finite Fields","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ghent","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 July 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waifi2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cage.ugent.be\/waifi\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}