{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T08:50:01Z","timestamp":1776847801046,"version":"3.51.2"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319724522","type":"print"},{"value":"9783319724539","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-72453-9_9","type":"book-chapter","created":{"date-parts":[[2017,12,20]],"date-time":"2017-12-20T04:35:54Z","timestamp":1513744554000},"page":"121-136","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Implementing Fast Carryless Multiplication"],"prefix":"10.1007","author":[{"given":"Joris","family":"van der Hoeven","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robin","family":"Larrieu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gr\u00e9goire","family":"Lecerf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,21]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-540-79456-1_10","volume-title":"Algorithmic Number Theory","author":"RP Brent","year":"2008","unstructured":"Brent, R.P., Gaudry, P., Thom\u00e9, E., Zimmermann, P.: Faster multiplication in GF(2)[x]. In: van der Poorten, A.J., Stein, A. (eds.) ANTS 2008. LNCS, vol. 5011, pp. 153\u2013166. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-79456-1_10"},{"key":"9_CR2","unstructured":"Chen, M.-S., Cheng, C.-M., Kuo, P.-C., Li, W.-D., Yang, B.-Y.: Faster multiplication for long binary polynomials (2017). \nhttps:\/\/arxiv.org\/abs\/1708.09746"},{"key":"9_CR3","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","volume":"19","author":"JW Cooley","year":"1965","unstructured":"Cooley, J.W., Tukey, J.W.: An algorithm for the machine calculation of complex Fourier series. Math. Comput. 19, 297\u2013301 (1965)","journal-title":"Math. Comput."},{"issue":"12","key":"9_CR4","doi-asserted-by":"crossref","first-page":"6265","DOI":"10.1109\/TIT.2010.2079016","volume":"56","author":"S Gao","year":"2010","unstructured":"Gao, S., Mateer, T.: Additive fast Fourier transforms over finite fields. IEEE Trans. Inform. Theory 56(12), 6265\u20136272 (2010)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139856065","volume-title":"Modern Computer Algebra","author":"J Gathen von zur","year":"2013","unstructured":"von zur Gathen, J., Gerhard, J.: Modern Computer Algebra, 3rd edn. Cambridge University Press, New York (2013)","edition":"3"},{"key":"9_CR6","unstructured":"GCC, the GNU Compiler Collection (1987). \nhttp:\/\/gcc.gnu.org"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Harvey, D., van der Hoeven, J., Lecerf, G.: Fast polynomial multiplication over \n            $$\\mathbb{F}_{2^{60}}$$\n            \n              \n                \n                  F\n                  \n                    2\n                    60\n                  \n                \n              \n            \n          . In: Rosenkranz, M. (ed.) Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2016, pp. 255\u2013262. ACM (2016)","DOI":"10.1145\/2930889.2930920"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Harvey, D., van der Hoeven, J., Lecerf, G.: Faster polynomial multiplication over finite fields. J. ACM 63(6) (2017). Article 52","DOI":"10.1145\/3005344"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"van der Hoeven, J.: The truncated Fourier transform and applications. In: Schicho, J. (ed.) Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation, ISSAC 2004, pp. 290\u2013296. ACM (2004)","DOI":"10.1145\/1005285.1005327"},{"issue":"8","key":"9_CR10","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1016\/j.jsc.2010.03.005","volume":"45","author":"J Hoeven van der","year":"2010","unstructured":"van der Hoeven, J.: Newton\u2019s method and FFT trading. J. Symbolic Comput. 45(8), 857\u2013878 (2010)","journal-title":"J. Symbolic Comput."},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"van der Hoeven, J., Larrieu, R.: The Frobenius FFT. In: Burr, M. (ed.) Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2017, pp. 437\u2013444. ACM (2017)","DOI":"10.1145\/3087604.3087633"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"van der Hoeven, J., Lecerf, G.: Interfacing Mathemagix with C++. In: Monagan, M., Cooperman, G., Giesbrecht, M. (eds.) Proceedings of the 2013 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2013, pp. 363\u2013370. ACM (2013)","DOI":"10.1145\/2465506.2465511"},{"key":"9_CR13","unstructured":"van der Hoeven, J., Lecerf, G.: Mathemagix User Guide (2013). \nhttps:\/\/hal.archives-ouvertes.fr\/hal-00785549"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Larrieu, R.: The truncated Fourier transform for mixed radices. In: Burr, M. (ed.) Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2017, pp. 261\u2013268. ACM (2017)","DOI":"10.1145\/3087604.3087636"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Lin, S.-J., Chung, W.-H., Yunghsiang Han, S.: Novel polynomial basis and its application to Reed-Solomon erasure codes. In: 2014 IEEE 55th Annual Symposium on Foundations of Computer Science (FOCS), pp. 316\u2013325. IEEE (2014)","DOI":"10.1109\/FOCS.2014.41"},{"key":"9_CR16","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF00289470","volume":"7","author":"A Sch\u00f6nhage","year":"1977","unstructured":"Sch\u00f6nhage, A.: Schnelle Multiplikation von Polynomen \u00fcber K\u00f6rpern der Charakteristik 2. Acta Infor. 7, 395\u2013398 (1977)","journal-title":"Acta Infor."},{"key":"9_CR17","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF02242355","volume":"7","author":"A Sch\u00f6nhage","year":"1971","unstructured":"Sch\u00f6nhage, A., Strassen, V.: Schnelle Multiplikation gro\u00dfer Zahlen. Computing 7, 281\u2013292 (1971)","journal-title":"Computing"},{"key":"9_CR18","volume-title":"Hacker\u2019s Delight","author":"HS Warren","year":"2012","unstructured":"Warren, H.S.: Hacker\u2019s Delight, 2nd edn. Addison-Wesley, Boston (2012)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Mathematical Aspects of Computer and Information Sciences"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72453-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,20]],"date-time":"2017-12-20T04:39:12Z","timestamp":1513744752000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72453-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319724522","9783319724539"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72453-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}