{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:27:45Z","timestamp":1742380065549},"publisher-location":"Berlin, Heidelberg","reference-count":29,"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_10","type":"book-chapter","created":{"date-parts":[[2007,12,1]],"date-time":"2007-12-01T08:04:18Z","timestamp":1196496258000},"page":"138-154","source":"Crossref","is-referenced-by-count":7,"title":["Another Look at Square Roots (and Other Less Common Operations) in Fields of Even Characteristic"],"prefix":"10.1007","author":[{"given":"Roberto Maria","family":"Avanzi","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"10_CR1","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.dam.2006.06.004","volume":"155","author":"O. Ahmadi","year":"2007","unstructured":"Ahmadi, O., Hankerson, D., Menezes, A.: Formulas for cube roots in $\\mathbb{F}_{3^m}$ . Discrete Applied Math.\u00a0155(3), 260\u2013270 (2007)","journal-title":"Discrete Applied Math."},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/s10623-004-4039-4","volume":"37","author":"O. Ahmadi","year":"2005","unstructured":"Ahmadi, O., Menezes, A.: On the number of trace-one elements in polynomial bases for $\\mathbb{F}_{2^n}$ . Designs, Codes and Cryptography\u00a037, 493\u2013507 (2005)","journal-title":"Designs, Codes and Cryptography"},{"key":"10_CR3","first-page":"111","volume":"72","author":"O. Ahmadi","year":"2007","unstructured":"Ahmadi, O., Menezes, A.: Irreducible polynomials of maximum weight. Utilitas Mathematica\u00a072, 111\u2013123 (2007)","journal-title":"Utilitas Mathematica"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0166-218X(89)90001-2","volume":"25","author":"D.W. Ash","year":"1989","unstructured":"Ash, D.W., Blake, I.F., Vanstone, S.: Low complexity normal bases. Discrete Applied Math.\u00a025, 191\u2013210 (1989)","journal-title":"Discrete Applied Math."},{"key":"10_CR5","unstructured":"Avanzi, R.M.: Delaying and Merging Operations in Scalar Multiplication: Applications to Curve-Based Cryptosystems. In: Proceedings of SAC 2006 (to appear)"},{"key":"10_CR6","unstructured":"Avanzi, R.M., Cesena, E.: Trace Zero Varieties over Fields of Characteristic 2: Cryptographic Applications. In: SAGA 2007. The first Symposium on Algebraic Geometry and its Applications, May 7-11, 2007,Tahiti (2007)"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/978-3-540-24632-9_3","volume-title":"PKC 2004","author":"R.M. Avanzi","year":"2004","unstructured":"Avanzi, R.M., Ciet, M., Sica, F.: Faster Scalar Multiplication on Koblitz Curves combining Point Halving with the Frobenius Endomorphism. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol.\u00a02947, pp. 28\u201340. Springer, Heidelberg (2004)"},{"key":"10_CR8","volume-title":"The Handbook of Elliptic and Hyperelliptic Curve Cryptography","author":"R. Avanzi","year":"2005","unstructured":"Avanzi, R., Cohen, H., Doche, C., Frey, G., Lange, T., Nguyen, K., Vercauteren, F.: The Handbook of Elliptic and Hyperelliptic Curve Cryptography. CRC Press, Boca Raton, USA (2005)"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s00453-006-0105-9","volume":"46","author":"R.M. Avanzi","year":"2006","unstructured":"Avanzi, R.M., Heuberger, C., Prodinger, H.: Scalar Multiplication on Koblitz Curves Using the Frobenius Endomorphism and its Combination with Point Halving: Extensions and Mathematical Analysis. Algorithmica\u00a046, 249\u2013270 (2006)","journal-title":"Algorithmica"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"SAC 2006","author":"R.M. Avanzi","year":"2006","unstructured":"Avanzi, R.M., Heuberger, C., Prodinger, H.: On Redundant \u03c4-adic Expansions and Non-Adjacent Digit Sets. In: Biham, E., Youssef, A.M. (eds.) SAC 2006. LNCS, vol.\u00a04356, Springer, Heidelberg (2006)"},{"key":"10_CR11","unstructured":"Avanzi, R.M., Th\u00e9riault, N.: Effects of Optimizations for Software Implementations of Small Binary Field Arithmetic. In: Proceedings of WAIFI 2007. International Workshop on the Arithmetic of Finite Fields, June 21-22, 2007, Madrid, Spain, p. 18 (2007)"},{"key":"10_CR12","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 Formul\u00e6. CACR Technical Report 2006-07","DOI":"10.1515\/JMC.2008.011"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10623-006-9033-6","volume":"42","author":"P.S.L.M. Barreto","year":"2007","unstructured":"Barreto, P.S.L.M., Galbraith, S., OhEigeartaigh, C., Scott, M.: Efficient pairing computation on supersingular abelian varieties. Designs, Codes and Cryptography\u00a042, 239\u2013271 (2007), http:\/\/eprint.iacr.org\/2004\/375","journal-title":"Designs, Codes and Cryptography"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/11734697","volume-title":"Proceedings of Selected Areas in Cryptography \u2013 SAC 2006","author":"P. Birkner","year":"2006","unstructured":"Birkner, P.: Efficient Divisor Class Halving on Genus Two Curves. In: Proceedings of Selected Areas in Cryptography \u2013 SAC 2006. LNCS, Springer, Heidelberg (to appear)"},{"key":"10_CR15","unstructured":"Birkner, P., Th\u00e9riault, N.: Efficient Divisor Class Doubling and Halving on Genus Three Curves (in preparation)"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.ffa.2005.02.001","volume":"12","author":"A.W. Bluher","year":"2006","unstructured":"Bluher, A.W.: A Swan-like Theorem. Finite Fields and Their Applications\u00a012, 128\u2013138 (2006)","journal-title":"Finite Fields and Their Applications"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W. Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma Algebra System I: The User Language. J. Symbolic Comput.\u00a024, 235\u2013265 (1997)","journal-title":"J. Symbolic Comput."},{"key":"10_CR18","unstructured":"Cesena, E.: Variet\u00e1 a Traccia Zero su Campi Binari: Applicazioni Crittografiche (Trace Zero Varieties over Binary Fields: Cryptographic Applications.) Master\u2019s Thesis. Universit\u00e1 degli Studi di Milano (in Italian) (2005)"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/3-540-45537-X_12","volume-title":"Selected Areas in Cryptography","author":"J.-S. Coron","year":"2001","unstructured":"Coron, J.-S., M\u2019Ra\u00efhi, D., Tymen, C.: Fast generation of pairs (k, [k]P) for Koblitz elliptic curves. In: Vaudenay, S., Youssef, A.M. (eds.) SAC 2001. LNCS, vol.\u00a02259, pp. 151\u2013164. Springer, Heidelberg (2001)"},{"issue":"8","key":"10_CR20","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1109\/TC.2004.43","volume":"53","author":"K. Fong","year":"2004","unstructured":"Fong, K., Hankerson, D., L\u00f3pez, J., Menezes, A.: Field Inversion and Point Halving Revisited. IEEE Trans. Computers\u00a053(8), 1047\u20131059 (2004)","journal-title":"IEEE Trans. Computers"},{"key":"10_CR21","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, Heidelberg (2003)"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/978-3-540-48000-6_12","volume-title":"ASIACRYPT 1999","author":"E.W. Knudsen","year":"1999","unstructured":"Knudsen, E.W.: Elliptic Scalar Multiplication Using Point Halving. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol.\u00a01716, pp. 135\u2013149. Springer, Heidelberg (1999)"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/3-540-46766-1_22","volume-title":"CRYPTO 1991","author":"N. Koblitz","year":"1992","unstructured":"Koblitz, N.: CM-curves with good cryptographic properties. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 279\u2013287. Springer, Heidelberg (1992)"},{"key":"10_CR24","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":"10_CR25","unstructured":"National Institute of Standards and Technology. Recommended Elliptic Curves for Federal Government Use. NIST Special Publication (July 1999), available from: http:\/\/csrc.nist.gov\/csrc\/fedstandards.html"},{"key":"10_CR26","unstructured":"Schroeppel, R.: Point halving wins big. In: (i) Midwest Arithmetical Geometry in Cryptography Workshop, November 17\u201319, 2000, University of Illinois at Urbana-Champaign (2000), ECC 2001 Workshop, October 29\u201331, 2001, University of Waterloo, Ontario, Canada (2001)"},{"key":"10_CR27","unstructured":"Schroeppel, R.: Elliptic curve point ambiguity resolution apparatus and method. International Application Number PCT\/US00\/31014, filed (November 9, 2000)"},{"key":"10_CR28","unstructured":"Scott, M.: Optimal Irreducible Polynomials for GF(2 m ) Arithmetic. IACR ePrint 2007\/192. http:\/\/eprint.iacr.org\/2007\/192"},{"key":"10_CR29","doi-asserted-by":"crossref","first-page":"1099","DOI":"10.2140\/pjm.1962.12.1099","volume":"19","author":"R.G. Swan","year":"1962","unstructured":"Swan, R.G.: Factorization of Polynomials over Finite Fields. Pac. J. Math.\u00a019, 1099\u20131106 (1962)","journal-title":"Pac. J. Math."}],"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_10.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_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540773597"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77360-3_10","relation":{},"subject":[]}}