{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T05:12:56Z","timestamp":1776834776406,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540221562","type":"print"},{"value":"9783540248477","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24847-7_6","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T18:33:04Z","timestamp":1284143584000},"page":"87-101","source":"Crossref","is-referenced-by-count":6,"title":["Implementing the Arithmetic of C 3,4 Curves"],"prefix":"10.1007","author":[{"given":"Abdolali","family":"Basiri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Enge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Charles","family":"Faug\u00e8re","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"G\u00fcrel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"8","key":"6_CR1","first-page":"1291","volume":"J82-A","author":"S. Arita","year":"1999","unstructured":"Arita, S.: Algorithms for computations in Jacobian group of Cab curve and their application to discrete-log based public key cryptosystems. IEICE Transactions\u00a0J82-A(8), 1291\u20131299 (1999); In Japanese. English translation in the proceedings of the Conference on The Mathematics of Public Key Cryptography, Toronto (1999)","journal-title":"IEICE Transactions"},{"key":"6_CR2","unstructured":"Basiri, A., Enge, A., Faug\u00e8re, J.-C., G\u00fcrel, N.: The arithmetic of Jacobian groups of superelliptic cubics. Rapport de Recherche 4618, INRIA (November 2002), Available at \n                    \n                      https:\/\/2.zoppoz.workers.dev:443\/http\/www.inria.fr\/rrrt\/rr-4618.html\n                    \n                    \n                   (to appear in Mathematics of Computation)"},{"issue":"245","key":"6_CR3","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1090\/S0025-5718-03-01559-X","volume":"73","author":"M.L. Bauer","year":"2004","unstructured":"Bauer, M.L.: The arithmetic of certain cubic function fields. Mathematics of Computation\u00a073(245), 387\u2013413 (2004)","journal-title":"Mathematics of Computation"},{"key":"6_CR4","unstructured":"Cook, S.A.: On the Minimum Computation Time of Functions. PhD thesis, Harvard University (1966)"},{"issue":"238","key":"6_CR5","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1090\/S0025-5718-01-01363-1","volume":"71","author":"A. Enge","year":"2002","unstructured":"Enge, A.: Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time. Mathematics of Computation\u00a071(238), 729\u2013742 (2002)","journal-title":"Mathematics of Computation"},{"issue":"1","key":"6_CR6","doi-asserted-by":"publisher","first-page":"83","DOI":"10.4064\/aa102-1-6","volume":"102","author":"A. Enge","year":"2002","unstructured":"Enge, A., Gaudry, P.: A general framework for subexponential discrete logarithm algorithms. Acta Arithmetica\u00a0102(1), 83\u2013103 (2002)","journal-title":"Acta Arithmetica"},{"key":"6_CR7","unstructured":"Flon, S., Oyono, R.: Fast arithmetic on Jacobians of Picard curves. Cryptology ePrint Archive 2003\/079 (2003) (Preprint), available at \n                    \n                      https:\/\/2.zoppoz.workers.dev:443\/http\/eprint.iacr.org\/2003\/079"},{"issue":"237","key":"6_CR8","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1090\/S0025-5718-00-01297-7","volume":"71","author":"S.D. Galbraith","year":"2002","unstructured":"Galbraith, S.D., Paulus, S.M., Smart, N.P.: Arithmetic on superelliptic curves. Mathematics of Computation\u00a071(237), 393\u2013405 (2002)","journal-title":"Mathematics of Computation"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-45539-6_2","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"P. Gaudry","year":"2000","unstructured":"Gaudry, P.: An algorithm for solving the discrete log problem on hyperelliptic curves. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 19\u201334. Springer, Heidelberg (2000)"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/3-540-45682-1_28","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"P. Gaudry","year":"2001","unstructured":"Gaudry, P., G\u00fcrel, N.: An extension of Kedlaya\u2019s point counting algorithm to superelliptic curves. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 480\u2013494. Springer, Heidelberg (2001)"},{"issue":"3","key":"6_CR11","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/j.jsc.2003.03.001","volume":"37","author":"G. Hanrot","year":"2004","unstructured":"Hanrot, G., Zimmermann, P.: A long note on Mulders\u2019 short product. Journal of Symbolic Computation\u00a037(3), 391\u2013401 (2004)","journal-title":"Journal of Symbolic Computation"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/10722028_21","volume-title":"Algorithmic Number Theory","author":"R. Harasawa","year":"2000","unstructured":"Harasawa, R., Suzuki, J.: Fast Jacobian group arithmetic on Cab curves. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol.\u00a01838, pp. 359\u2013376. Springer, Heidelberg (2000)"},{"issue":"4","key":"6_CR13","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1006\/jsco.2001.0513","volume":"33","author":"F. He\u00df","year":"2002","unstructured":"He\u00df, F.: Computing Riemann\u2013Roch spaces in algebraic function fields and related topics. Journal of Symbolic Computation\u00a033(4), 425\u2013445 (2002)","journal-title":"Journal of Symbolic Computation"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1006\/jsco.1993.1012","volume":"15","author":"T. Jebelean","year":"1993","unstructured":"Jebelean, T.: An algorithm for exact division. Journal of Symbolic Computation\u00a015, 169\u2013180 (1993)","journal-title":"Journal of Symbolic Computation"},{"issue":"245","key":"6_CR15","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1090\/S0025-5718-03-01567-9","volume":"73","author":"K. Khuri-Makdisi","year":"2004","unstructured":"Khuri-Makdisi, K.: Linear algebra algorithms for divisors on an algebraic curve. Mathematics of Computation\u00a073(245), 333\u2013357 (2004)","journal-title":"Mathematics of Computation"},{"issue":"2","key":"6_CR16","first-page":"293","volume":"7","author":"A. \u043a\u0430\u0440\u0430\u0446\u0443\u0431\u0430","year":"1962","unstructured":"\u043a\u0430\u0440\u0430\u0446\u0443\u0431\u0430, A., \u041e\u0444\u043c\u0430\u043d, \u042e.: \u0423\u043c\u043d\u043e\u0438\u0441\u0435\u043du\u0435 \u043c\u043d\u043e\u01a8\u043e\u0437\u043d\u0430\u0447\u043d\u044bx \u0447u\u0441\u0435\u043f \u043d\u0430 \u0430\u0432m\u043e\u043c\u0430m\u0430x \u0414\u043e\u043a\u043b\u0430\u2202\u044b \u0410\u043a\u0430\u2202\u0435\u043cuu \u043d\u0430\u0443\u043a CCCP 145(2), 293\u2013294 (1962), English translation: Multiplication of Multidigit Numbers on Automata. Soviet Physics \u2013 Doklady 7(7), 595\u2013596 (1963)","journal-title":"Soviet Physics \u2013 Doklady"},{"key":"6_CR17","first-page":"69","volume":"11","author":"T. Mulders","year":"2000","unstructured":"Mulders, T.: On short multiplications and divisions. Applicable Algebra in Engineering. Communication and Computing\u00a011, 69\u201388 (2000)","journal-title":"Communication and Computing"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-540-45238-6_28","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2003","author":"J. Pelzl","year":"2003","unstructured":"Pelzl, J., Wollinger, T., Guajardo, J., Paar, C.: Hyperelliptic curve crypstosystems: Closing the performance gap to elliptic curves. In: Walter, C.D., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2003. LNCS, vol.\u00a02779, pp. 351\u2013365. Springer, Heidelberg (2003)"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/BFb0049430","volume-title":"Algorithms - ESA \u201994","author":"A. Sch\u00f6nhage","year":"1994","unstructured":"Sch\u00f6nhage, A., Vetter, E.: A new approach to resultant computations and other algorithms with exact division. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol.\u00a0855, pp. 448\u2013459. Springer, Heidelberg (1994)"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-540-40061-5_5","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"N. Th\u00e9riault","year":"2003","unstructured":"Th\u00e9riault, N.: Index calculus attack for hyperelliptic curves of small genus. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 75\u201392. Springer, Heidelberg (2003)"},{"issue":"3","key":"6_CR21","first-page":"496","volume":"150","author":"A.\u041b. Toom","year":"1963","unstructured":"Toom, A.\u041b.: O \u0441\u043b\u043e\u0436\u043d\u043e\u0441\u0442\u0438 \u0441x\u0435\u043c\u044b \u0438\u0437 \u0444\u0443\u043d\u043a\u0446\u0438\u043e\u043d\u0430\u043b\u043d\u044bx \u044d\u043b\u0435\u043c\u0435\u043d\u0442\u043e\u0432 \u0440\u0435\u0430\u043b\u0438\u0437\u0438\u0440y\u044e\u0449\u0435\u0439 y\u043c\u043d\u043e\u0436\u0435\u043d\u0438\u0435 \u0446\u0435\u043b\u044b\u0445 \u0447\u0438\u0441\u0435\u043b. \u0414\u043e\u043a\u043b\u0430\u2202\u044b \u0410\u043a\u0430\u2202\u0435\u043cuu \u043d\u0430\u0443\u043a CCCP 150(3), 496\u2013498 (1963), English translation: The complexity of a scheme of functional elements realizing the multiplication of integers. Soviet Mathematics 4, 714\u2013716 (1963)","journal-title":"\u0414\u043e\u043a\u043b\u0430\u2202\u044b \u0410\u043a\u0430\u2202\u0435\u043cuu \u043d\u0430\u0443\u043a CCCP"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Number Theory"],"original-title":[],"link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24847-7_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:15:08Z","timestamp":1619997308000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/10.1007\/978-3-540-24847-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221562","9783540248477"],"references-count":21,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-540-24847-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}