{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:32:43Z","timestamp":1725496363847},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540773597"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77360-3_11","type":"book-chapter","created":{"date-parts":[[2007,12,1]],"date-time":"2007-12-01T08:04:18Z","timestamp":1196496258000},"page":"155-172","source":"Crossref","is-referenced-by-count":5,"title":["Efficient Explicit Formulae for Genus 2 Hyperelliptic Curves over Prime Fields and Their Implementations"],"prefix":"10.1007","author":[{"given":"Xinxin","family":"Fan","sequence":"first","affiliation":[]},{"given":"Guang","family":"Gong","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/978-3-540-28632-5_11","volume-title":"CHES 2004","author":"R.M. Avanzi","year":"2004","unstructured":"Avanzi, R.M.: Aspects of Hyperelliptic Curves over Large Prime Fields in Software Implementations. In: Joye, M., Quisquater, J.-J. (eds.) CHES 2004. LNCS, vol.\u00a03156, pp. 148\u2013162. Springer, Heidelberg (2004)"},{"issue":"4","key":"11_CR2","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s00145-004-0229-5","volume":"18","author":"R.M. Avanzi","year":"2005","unstructured":"Avanzi, R.M.: The Complexity of Certain Multi-Exponentiation Techniques in Cryptography. Journal of Cryptology\u00a018(4), 357\u2013373 (2005)","journal-title":"Journal of Cryptology"},{"key":"11_CR3","volume-title":"Handbook of Elliptic and Hyperelliptic Curve Cryptography","author":"R.M. Avanzi","year":"2006","unstructured":"Avanzi, R.M., Cohen, H., Doche, C., Frey, G., Lange, T., Nguyen, K., Vercauteren, F.: Handbook of Elliptic and Hyperelliptic Curve Cryptography. Chapman & Hall\/CRC, Boca Raton, Florida, USA (2006)"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Avanzi, R.M., Th\u00e9riault, N., Wang, Z.: Rethinking Low Genus Hyperelliptic Jacobian Arithmetic over Binary Fields: Interplay of Field Arithmetic and Explicit Formulae, Centre for Applied Cryptographic Research (CACR) Technical Reports, CACR 2006-07, available at http:\/\/www.cacr.math.uwaterloo.ca\/","DOI":"10.1515\/JMC.2008.011"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1007\/BFb0055748","volume-title":"CRYPTO 1998","author":"D.V. Bailey","year":"1998","unstructured":"Bailey, D.V., Paar, C.: Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 472\u2013485. Springer, Heidelberg (1998)"},{"issue":"177","key":"11_CR6","doi-asserted-by":"publisher","first-page":"95","DOI":"10.2307\/2007876","volume":"48","author":"D. Cantor","year":"1987","unstructured":"Cantor, D.: Computing in Jacobian of a Hyperelliptic Curve. Mathematics of Computation\u00a048(177), 95\u2013101 (1987)","journal-title":"Mathematics of Computation"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10623-005-3299-y","volume":"39","author":"M. Ciet","year":"2006","unstructured":"Ciet, M., Joye, M., Lauter, K., Montgomery, L.: Trading Inversions for Multiplications in Elliptic Curve Cryptography. Design, Codes and Cryptography\u00a039, 189\u2013206 (2006)","journal-title":"Design, Codes and Cryptography"},{"key":"11_CR8","series-title":"Graduate Texts in Math.","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02945-9","volume-title":"A Course in Computational Algebraic Number Theory","author":"H. Cohen","year":"1993","unstructured":"Cohen, H.: A Course in Computational Algebraic Number Theory. Graduate Texts in Math., vol.\u00a0138. Springer, Berlin (1993) (fourth corrected printing, 2000)"},{"key":"11_CR9","volume-title":"Guide to Elliptic Curve Cryptography","author":"D. Hankerson","year":"2004","unstructured":"Hankerson, D., Menezes, A., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer, New York (2004)"},{"key":"11_CR10","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 Arithmetic and Improved Weil Pairing Evaluation. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol.\u00a02612, pp. 343\u2013354. Springer, Heidelberg (2003)"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/10722028_18","volume-title":"Algorithmic Number Theory","author":"P. Gaudry","year":"2000","unstructured":"Gaudry, P., Harley, R.: Counting Points on Hyperelliptic Curves over Finite Fields. In: Bosma, W. (ed.) Algorithmic Number Theory. LNCS, vol.\u00a01838, pp. 297\u2013312. Springer, Heidelberg (2000)"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Gonda, M., Matsuo, K., Aoki, K., Chao, J., Tsujii, S.: Improvements of Addition Algorithm on Genus 3 Hyperelliptic Curves and Their Implementation. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science E88-A(1), 89\u201396 (2005)","DOI":"10.1093\/ietfec\/E88-A.1.89"},{"issue":"1","key":"11_CR13","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1006\/jagm.1997.0913","volume":"27","author":"D.M. Gordon","year":"1998","unstructured":"Gordon, D.M.: A Survey of Fast Exponentiation Methods. Journal of Algorithms\u00a027(1), 129\u2013146 (1998)","journal-title":"Journal of Algorithms"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/0-387-34799-2_8","volume-title":"CRYPTO 1988","author":"N. Koblitz","year":"1990","unstructured":"Koblitz, N.: A Family of Jacobian Suitable for Discrete Log Cryptosystems. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 94\u201399. Springer, Heidelberg (1990)"},{"issue":"3","key":"11_CR15","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF02252872","volume":"1","author":"N. Koblitz","year":"1989","unstructured":"Koblitz, N.: Hyperelliptic Cryptosystems. Journal of Cryptology\u00a01(3), 129\u2013150 (1989)","journal-title":"Journal of Cryptology"},{"issue":"5","key":"11_CR16","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s00200-004-0154-8","volume":"15","author":"T. Lange","year":"2005","unstructured":"Lange, T.: Formulae for Arithmetic on Genus 2 Hyperelliptic Curves. Applicable Algebra in Engineering, Communication and Computing\u00a015(5), 295\u2013328 (2005)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/978-3-540-30564-4_12","volume-title":"Selected Areas in Cryptography","author":"T. Lange","year":"2004","unstructured":"Lange, T., Stevens, M.: Efficient Doubling for Genus Two Curves over Binary Fields. In: Handschuh, H., Hasan, M.A. (eds.) SAC 2004. LNCS, vol.\u00a03357, pp. 170\u2013181. Springer, Heidelberg (2004)"},{"key":"11_CR18","unstructured":"Menezes, A., Wu, Y., Zuccherato, R.: An Elementary Introduction to Hyperelliptic Curve, Centre for Applied Cryptographic Research (CACR) Technical Reports, CORR 1996-19, available at http:\/\/www.cacr.math.uwaterloo.ca\/"},{"key":"11_CR19","unstructured":"Mumford, D.: Tata Lectures on Theta II. Prog. Math.\u00a043, Birkh\u00e4user (1984)"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/10722028_28","volume-title":"Algorithmic Number Theory","author":"K. Nagao","year":"2000","unstructured":"Nagao, K.: Improving Group Law Algorithms for Jacobians of Hyperelliptic Curves. In: Bosma, W. (ed.) Algorithmic Number Theory. LNCS, vol.\u00a01838, pp. 439\u2013448. Springer, Heidelberg (2000)"},{"key":"11_CR21","unstructured":"Wollinger, T.: Software and Harware Implementation of Hyperelliptic Curve Cryptosystems, PhD. thesis, Department of Electrical Engineering and Information Sciences, Ruhr-Universit\u00e4et Bochum, Bochum, Germany (2004)"},{"issue":"7","key":"11_CR22","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1109\/TC.2005.109","volume":"54","author":"T. Wollinger","year":"2005","unstructured":"Wollinger, T., Pelzl, J., Paar, C.: Cantor versus Harley: Optimization and Analysis of Explicit Formulae for Hyperelliptic Curve Cryptosystems. IEEE Transactions on Computers\u00a054(7), 861\u2013872 (2005)","journal-title":"IEEE Transactions on Computers"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77360-3_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:09:27Z","timestamp":1619521767000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77360-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540773597"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77360-3_11","relation":{},"subject":[]}}