{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T23:19:31Z","timestamp":1773962371536,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642026195","type":"print"},{"value":"9783642026201","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02620-1_31","type":"book-chapter","created":{"date-parts":[[2009,6,20]],"date-time":"2009-06-20T05:46:36Z","timestamp":1245476796000},"page":"452-468","source":"Crossref","is-referenced-by-count":27,"title":["Jacobi Quartic Curves Revisited"],"prefix":"10.1007","author":[{"given":"Huseyin","family":"Hisil","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenneth Koon-Ho","family":"Wong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gary","family":"Carter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ed","family":"Dawson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-540-30564-4_9","volume-title":"Selected Areas in Cryptography","author":"R.M. Avanzi","year":"2004","unstructured":"Avanzi, R.M.: A note on the signed sliding window integer recoding and its left-to-right analogue. In: Handschuh, H., Hasan, M.A. (eds.) SAC 2004. LNCS, vol.\u00a03357, pp. 130\u2013143. Springer, Heidelberg (2004)"},{"key":"31_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/3-540-44828-4_5","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"O. Billet","year":"2003","unstructured":"Billet, O., Joye, M.: The Jacobi model of an elliptic curve and side-channel analysis. In: Fossorier, M.P.C., H\u00f8holdt, T., Poli, A. (eds.) AAECC 2003. LNCS, vol.\u00a02643, pp. 34\u201342. Springer, Heidelberg (2003)"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Lange, T.: Analysis and optimization of elliptic-curve single-scalar multiplication. In: Finite Fields and Applications Fq8. Contemporary Mathematics, American Mathematical Society, vol.\u00a0461, pp. 1\u201318 (2008)","DOI":"10.1090\/conm\/461\/08979"},{"key":"31_CR4","unstructured":"Bernstein, D.J., Lange, T.: eBACS: ECRYPT benchmarking of cryptographic systems (2008), http:\/\/bench.cr.yp.to"},{"key":"31_CR5","unstructured":"Bernstein, D.J., Lange, T.: Explicit-formulas database, http:\/\/www.hyperelliptic.org\/EFD"},{"key":"31_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-540-76900-2_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"D.J. Bernstein","year":"2007","unstructured":"Bernstein, D.J., Lange, T.: Faster addition and doubling on elliptic curves. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol.\u00a04833, pp. 29\u201350. Springer, Heidelberg (2007)"},{"key":"31_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-540-68164-9_26","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2008","author":"D.J. Bernstein","year":"2008","unstructured":"Bernstein, D.J., Birkner, P., Joye, M., Lange, T., Peters, C.: Twisted Edwards curves. In: Vaudenay, S. (ed.) AFRICACRYPT 2008. LNCS, vol.\u00a05023, pp. 389\u2013405. Springer, Heidelberg (2008)"},{"issue":"4","key":"31_CR8","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/0196-8858(86)90023-0","volume":"7","author":"D.V. Chudnovsky","year":"1986","unstructured":"Chudnovsky, D.V., Chudnovsky, G.V.: Sequences of numbers generated by addition in formal groups and new primality and factorization tests. Advances in Applied Mathematics\u00a07(4), 385\u2013434 (1986)","journal-title":"Advances in Applied Mathematics"},{"key":"31_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-49649-1_6","volume-title":"Advances in Cryptology - ASIACRYPT\u201998","author":"H. Cohen","year":"1998","unstructured":"Cohen, H., Miyaji, A., Ono, T.: Efficient elliptic curve exponentiation using mixed coordinates. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol.\u00a01514, pp. 51\u201365. Springer, Heidelberg (1998)"},{"key":"31_CR10","volume-title":"Handbook of Elliptic and Hyperelliptic Curve Cryptography","year":"2005","unstructured":"Cohen, H., Frey, G. (eds.): Handbook of Elliptic and Hyperelliptic Curve Cryptography. CRC Press, Boca Raton (2005)"},{"issue":"3","key":"31_CR11","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.ipl.2007.05.012","volume":"104","author":"S. Duquesne","year":"2007","unstructured":"Duquesne, S.: Improving the arithmetic of elliptic curves in the Jacobi model. Information Processing Letters\u00a0104(3), 101\u2013105 (2007)","journal-title":"Information Processing Letters"},{"key":"31_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/3-540-36563-X_24","volume-title":"Topics in Cryptology - CT-RSA 2003","author":"K. Eisentr\u00e4ger","year":"2003","unstructured":"Eisentr\u00e4ger, K., Lauter, K., Montgomery, P.L.: Fast elliptic curve arithmetic and improved Weil pairing evaluation. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol.\u00a02612, pp. 343\u2013354. Springer, Heidelberg (2003)"},{"key":"#cr-split#-31_CR13.1","unstructured":"Euler, L.: De integratione aequationis differentialis $m \\, dx\/\\sqrt{1-x^4} = n \\, dy\/\\sqrt{1-y^4}$ . Novi Commentarii Academiae Scientiarum Petropolitanae 6, 37???57 (1761);"},{"key":"#cr-split#-31_CR13.2","unstructured":"Translated from the Latin by Langton, S.G. On the integration of the differential equation $m \\, dx\/\\sqrt{1-x^4} = n \\, dy\/\\sqrt{1-y^4}$, http:\/\/home.sandiego.edu\/~langton\/eell.pdf"},{"key":"31_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/978-3-642-01001-9_30","volume-title":"EUROCRYPT 2009","author":"S.D. Galbraith","year":"2009","unstructured":"Galbraith, S.D., Lin, X., Scott, M.: Endomorphisms for faster elliptic curve cryptography on a large class of curves. In: EUROCRYPT 2009. LNCS, vol.\u00a05479, pp. 518\u2013535. Springer, Heidelberg (2009)"},{"key":"31_CR15","unstructured":"Gaudry, P., Thom\u00e9, E.: The mpFq library and implementing curve-based key exchanges. In: SPEED 2007, pp.49\u201364 (2007), http:\/\/www.loria.fr\/~gaudry\/publis\/mpfq.pdf"},{"key":"31_CR16","volume-title":"Guide to Elliptic Curve Cryptography","author":"D. Hankerson","year":"2003","unstructured":"Hankerson, D., Menezes, A.J., Vanstone, S.A.: Guide to Elliptic Curve Cryptography. Springer, New York (2003)"},{"key":"31_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-540-77026-8_11","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2007","author":"H. Hisil","year":"2007","unstructured":"Hisil, H., Carter, G., Dawson, E.: New formulae for efficient elliptic curve arithmetic. In: Srinathan, K., Rangan, C.P., Yung, M. (eds.) INDOCRYPT 2007. LNCS, vol.\u00a04859, pp. 138\u2013151. Springer, Heidelberg (2007)"},{"key":"#cr-split#-31_CR18.1","unstructured":"Hisil, H., Wong, K.K., Carter, G., Dawson, E.: Faster group operations on elliptic curves. In: Australasian Information Security Conference (AISC 2009), Wellington, New Zealand (January 2009);"},{"key":"#cr-split#-31_CR18.2","doi-asserted-by":"crossref","unstructured":"Conferences in Research and Practice in Information Technology (CRPIT), vol. 98, pp. 7???19 (2009)","DOI":"10.1007\/978-3-540-88546-7_20"},{"key":"31_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-540-89255-7_20","volume-title":"ASIACRYPT 2008","author":"H. Hisil","year":"2008","unstructured":"Hisil, H., Wong, K.K., Carter, G., Dawson, E.: Twisted Edwards curves revisited. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol.\u00a05350, pp. 326\u2013343. Springer, Heidelberg (2008)"},{"key":"31_CR20","unstructured":"Jacobi, C.G.J.: Fundamenta nova theoriae functionum ellipticarum. Sumtibus Fratrum Borntr\u00e6ger (1829)"},{"key":"31_CR21","series-title":"Lecture Notes in Computer Science","volume-title":"ACNS 2009","author":"P. Longa","year":"2009","unstructured":"Longa, P., Gebotys, C.: Novel precomputation schemes for elliptic curve cryptosystems. In: ACNS 2009. LNCS. Springer, Heidelberg (to appear, 2009)"},{"key":"31_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/3-540-36552-4_21","volume-title":"Information Security and Cryptology - ICISC 2002","author":"B. M\u00f6ller","year":"2003","unstructured":"M\u00f6ller, B.: Improved techniques for fast exponentiation. In: Lee, P.J., Lim, C.H. (eds.) ICISC 2002. LNCS, vol.\u00a02587, pp. 298\u2013312. Springer, Heidelberg (2003)"},{"key":"31_CR23","first-page":"239","volume-title":"ISSAC 2006","author":"M. Monagan","year":"2006","unstructured":"Monagan, M., Pearce, R.: Rational simplification modulo a polynomial ideal. In: ISSAC 2006, pp. 239\u2013245. ACM, New York (2006)"},{"key":"31_CR24","volume-title":"A Course of Modern Analysis","author":"E.T. Whittaker","year":"1927","unstructured":"Whittaker, E.T., Watson, G.N.: A Course of Modern Analysis. Cambridge University Press, Cambridge (1927)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02620-1_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T21:54:38Z","timestamp":1589925278000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02620-1_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642026195","9783642026201"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02620-1_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}