{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,3]],"date-time":"2025-03-03T06:01:26Z","timestamp":1740981686465,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642193781"},{"type":"electronic","value":"9783642193798"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19379-8_7","type":"book-chapter","created":{"date-parts":[[2011,3,1]],"date-time":"2011-03-01T17:29:44Z","timestamp":1299000584000},"page":"109-127","source":"Crossref","is-referenced-by-count":0,"title":["Faster and Lower Memory Scalar Multiplication on Supersingular Curves in Characteristic Three"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Avanzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Clemens","family":"Heuberger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-540-73074-3_8","volume-title":"Arithmetic of Finite Fields","author":"O. Ahmadi","year":"2007","unstructured":"Ahmadi, O., Hankerson, D., Menezes, A.: Software Implementation of Arithmetic in $\\mathbb{F}_{3^m}$ . In: Carlet, C., Sunar, B. (eds.) WAIFI 2007. LNCS, vol.\u00a04547, pp. 85\u2013102. Springer, Heidelberg (2007)"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/11935230_9","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2006","author":"R.M. Avanzi","year":"2006","unstructured":"Avanzi, R.M., Dimitrov, V.S., Doche, C., Sica, F.: Extending scalar multiplication using double bases. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol.\u00a04284, pp. 130\u2013144. Springer, Heidelberg (2006)"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-540-74462-7_20","volume-title":"Selected Areas in Cryptography","author":"R.M. Avanzi","year":"2007","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, pp. 285\u2013301. Springer, Heidelberg (2007)"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Avanzi, R.M., Heuberger, C., Prodinger, H.: Redundant \u03c4-adic Expansions I: Non-Adjacent Digit Sets and their Applications to Scalar Multiplication, Design, Codes and Cryptography (2010) (to appear)","DOI":"10.1007\/s10623-010-9396-6"},{"key":"7_CR5","unstructured":"Avanzi, R.M., Heuberger, C., Prodinger, H.: Arithmetic of Koblitz Curves in Characteristic Three (2010) (preprint)"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/3-540-45708-9_23","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"P.S.L.M. Barreto","year":"2002","unstructured":"Barreto, P.S.L.M., Kim, H.Y., Lynn, B., Scott, M.: Efficient Algorithms for Pairing-Based Cryptosystems. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 354\u2013368. Springer, Heidelberg (2002)"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-540-85538-5_20","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"J.-L. Beuchat","year":"2008","unstructured":"Beuchat, J.-L., Brisebarre, N., Detrey, J., Okamoto, E., Rodr\u00edguez-Henr\u00edquez, F.: A Comparison between Hardware Accelerators for the Modified Tate Pairing over F $_{2^m}$ and F $_{3^m}$ . In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol.\u00a05209, pp. 297\u2013315. Springer, Heidelberg (2008)"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-642-10433-6_28","volume-title":"Cryptology and Network Security","author":"J.-L. Beuchat","year":"2009","unstructured":"Beuchat, J.-L., L\u00f3pez-Trejo, E., Mart\u00ednez-Ramos, L., Mitsunari, S., Rodr\u00edguez-Henr\u00edquez, F.: Multi-core implementation of the tate pairing over supersingular elliptic curves. In: Garay, J.A., Miyaji, A., Otsuka, A. (eds.) CANS 2009. LNCS, vol.\u00a05888, pp. 413\u2013432. Springer, Heidelberg (2009)"},{"key":"7_CR9","first-page":"97","volume-title":"ARITH 2007","author":"J.-L. Beuchat","year":"2007","unstructured":"Beuchat, J.-L., Shirase, M., Takagi, T., Okamoto, E.: An Algorithm for the \u03b7 T Pairing Calculation in Characteristic Three and its Hardware Implementation. In: ARITH 2007, pp. 97\u2013104. IEEE Computer Society, Los Alamitos (2007)"},{"issue":"1","key":"7_CR10","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.jda.2004.04.011","volume":"3","author":"I.F. Blake","year":"2005","unstructured":"Blake, I.F., Murty, V.K., Xu, G.: Efficient algorithms for Koblitz curves over fields of characteristic three. J. Discrete Algorithms\u00a03(1), 113\u2013124 (2005)","journal-title":"J. Discrete Algorithms"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-540-68979-9_13","volume-title":"Trusted Computing - Challenges and Applications","author":"E. Brickell","year":"2008","unstructured":"Brickell, E., Chen, L., Li, J.: A new direct anonymous attestation scheme from bilinear maps. In: Lipp, P., Sadeghi, A.-R., Koch, K.-M. (eds.) Trust 2008. LNCS, vol.\u00a04968, pp. 166\u2013178. Springer, Heidelberg (2008)"},{"key":"7_CR12","unstructured":"Cesena, E.: Trace Zero Varieties in Pairing-based Cryptography. Ph.D. Thesis, Universit\u00e0 degli Studi Roma TRE (2010)"},{"key":"7_CR13","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 Math.\u00a07, 385\u2013434 (1986)","journal-title":"Advances in Applied Math."},{"key":"7_CR14","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":"7_CR15","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":"2","key":"7_CR16","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/s00145-009-9048-z","volume":"23","author":"D. Freeman","year":"2010","unstructured":"Freeman, D., Scott, M., Teske, E.: A Taxonomy of Pairing-Friendly Elliptic Curves. J. Cryptology\u00a023(2), 224\u2013280 (2010)","journal-title":"J. Cryptology"},{"key":"7_CR17","first-page":"10","volume":"4","author":"F. Halter-Koch","year":"1972","unstructured":"Halter-Koch, F.: Einseinheitengruppen und prime Restklassengruppen in quadratischen Zahlk\u00f6rpern. Journal of Number Theory\u00a04, 10\u201317 (1972)","journal-title":"Journal of Number Theory"},{"key":"7_CR18","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1112\/S1461157000000747","volume":"5","author":"K. Harrison","year":"2002","unstructured":"Harrison, K., Page, D., Smart, N.: Software Implementation of Finite Fields of Characteristic Three, for Use in Pairing Based Cryptosystems. LMS Journal of Computation and Mathematics\u00a05, 181\u2013193 (2002)","journal-title":"LMS Journal of Computation and Mathematics"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Kim, K.-H., N\u00e8gre, C.: Point multiplication on supersingular elliptic curves defined over fields of characteristic 2 and 3. In: SECRYPT 2008. INSTICC Press, pp. 373\u2013376 (2008)","DOI":"10.5220\/0001926103730376"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BFb0055739","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"N. Koblitz","year":"1998","unstructured":"Koblitz, N.: An elliptic curve implementation of the finite field digital signature algorithm. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 327\u2013337. Springer, Heidelberg (1998)"},{"key":"7_CR21","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1017\/S0027763000018316","volume":"73","author":"N. Nakagoshi","year":"1979","unstructured":"Nakagoshi, N.: The structure of the multiplicative group of residue classes modulo $\\mathfrak{p}\\sp{N+1}$ . Nagoya Mathematical Journal\u00a073, 41\u201360 (1979)","journal-title":"Nagoya Mathematical Journal"},{"key":"7_CR22","unstructured":"Mitsunari, S.: A fast implementation of \u03b7 T pairing in characteristic three on intel processor. Cryptology ePrint Archive, report 2009\/032 (2009)"},{"key":"7_CR23","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/PL00003820","volume":"12","author":"N. Smart","year":"1999","unstructured":"Smart, N.: Elliptic Curve Cryptosystems over Small Fields of Odd Characteristic. J. Cryptology\u00a012, 141\u2013151 (1999)","journal-title":"J. Cryptology"},{"key":"7_CR24","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1023\/A:1008306223194","volume":"19","author":"J.A. Solinas","year":"2000","unstructured":"Solinas, J.A.: Efficient arithmetic on Koblitz curves. Design, Codes and Cryptography\u00a019, 195\u2013249 (2000)","journal-title":"Design, Codes and Cryptography"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2013 PKC 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19379-8_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,3]],"date-time":"2025-03-03T02:15:31Z","timestamp":1740968131000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19379-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642193781","9783642193798"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19379-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}