{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:17:52Z","timestamp":1725700672324},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642334801"},{"type":"electronic","value":"9783642334818"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33481-8_10","type":"book-chapter","created":{"date-parts":[[2012,8,22]],"date-time":"2012-08-22T09:00:27Z","timestamp":1345626027000},"page":"177-193","source":"Crossref","is-referenced-by-count":20,"title":["Faster Implementation of Scalar Multiplication on Koblitz Curves"],"prefix":"10.1007","author":[{"given":"Diego F.","family":"Aranha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Armando","family":"Faz-Hern\u00e1ndez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julio","family":"L\u00f3pez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francisco","family":"Rodr\u00edguez-Henr\u00edquez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/3-540-46766-1_22","volume-title":"Advances in Cryptology - CRYPTO \u201991","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_CR2","volume-title":"Guide to Elliptic Curve Cryptography","author":"D. Hankerson","year":"2003","unstructured":"Hankerson, D., Menezes, A.J., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer, Secaucus (2003)"},{"issue":"3","key":"10_CR3","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s13389-011-0017-8","volume":"1","author":"J. Taverne","year":"2011","unstructured":"Taverne, J., Faz-Hern\u00e1ndez, A., Aranha, D.F., Rodr\u00edguez-Henr\u00edquez, F., Hankerson, D., L\u00f3pez, J.: Speeding scalar multiplication over binary elliptic curves using the new carry-less multiplication instruction. Journal of Cryptographic Engineering\u00a01(3), 187\u2013199 (2011)","journal-title":"Journal of Cryptographic Engineering"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-15031-9_6","volume-title":"Cryptographic Hardware and Embedded Systems, CHES 2010","author":"P. Longa","year":"2010","unstructured":"Longa, P., Gebotys, C.: Efficient Techniques for High-Speed Elliptic Curve Cryptography. In: Mangard, S., Standaert, F.-X. (eds.) CHES 2010. LNCS, vol.\u00a06225, pp. 80\u201394. Springer, Heidelberg (2010)"},{"key":"10_CR5","unstructured":"Gaudry, P., Thom\u00e9, E.: The mpFq library and implementing curve-based key exchanges. In: Software Performance Enhancement of Encryption and Decryption (SPEED 2007), pp. 49\u201364 (2009), \n                    \n                      http:\/\/www.hyperelliptic.org\/SPEED\/record.pdf"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/3-540-45353-9_19","volume-title":"Topics in Cryptology - CT-RSA 2001","author":"M. Brown","year":"2001","unstructured":"Brown, M., Hankerson, D., L\u00f3pez, J., Menezes, A.: Software Implementation of the NIST Elliptic Curves Over Prime Fields. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol.\u00a02020, pp. 250\u2013265. Springer, Heidelberg (2001)"},{"key":"10_CR7","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":"Advances in Cryptology - 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: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol.\u00a05479, pp. 518\u2013535. Springer, Heidelberg (2009)"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-642-23951-9_9","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2011","author":"D.J. Bernstein","year":"2011","unstructured":"Bernstein, D.J., Duif, N., Lange, T., Schwabe, P., Yang, B.-Y.: High-Speed High-Security Signatures. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol.\u00a06917, pp. 124\u2013142. Springer, Heidelberg (2011)"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-642-23951-9_8","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2011","author":"J. Taverne","year":"2011","unstructured":"Taverne, J., Faz-Hern\u00e1ndez, A., Aranha, D.F., Rodr\u00edguez-Henr\u00edquez, F., Hankerson, D., L\u00f3pez, J.: Software Implementation of Binary Elliptic Curves: Impact of the Carry-Less Multiplier on Scalar Multiplication. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol.\u00a06917, pp. 108\u2013123. Springer, Heidelberg (2011)"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-642-14712-8_9","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2010","author":"D.F. Aranha","year":"2010","unstructured":"Aranha, D.F., L\u00f3pez, J., Hankerson, D.: Efficient Software Implementation of Binary Field Arithmetic Using Vector Instruction Sets. In: Abdalla, M., Barreto, P.S.L.M. (eds.) LATINCRYPT 2010. LNCS, vol.\u00a06212, pp. 144\u2013161. Springer, Heidelberg (2010)"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-642-12678-9_14","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2010","author":"J.W. Bos","year":"2010","unstructured":"Bos, J.W., Kleinjung, T., Niederhagen, R., Schwabe, P.: ECC2K-130 on Cell CPUs. In: Bernstein, D.J., Lange, T. (eds.) AFRICACRYPT 2010. LNCS, vol.\u00a06055, pp. 225\u2013242. Springer, Heidelberg (2010)"},{"issue":"4","key":"10_CR12","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1109\/TC.2008.207","volume":"58","author":"M. Cenk","year":"2009","unstructured":"Cenk, M., \u00d6zbudak, F.: Improved Polynomial Multiplication Formulas over \n                    \n                      \n                    \n                    $\\mathbb{F}_2$\n                   Using Chinese Remainder Theorem. IEEE Trans. Computers\u00a058(4), 572\u2013576 (2009)","journal-title":"IEEE Trans. Computers"},{"key":"10_CR13","unstructured":"Intel: Intel Architecture Software Developer\u2019s Manual Volume 2: Instruction Set Reference (2002), \n                    \n                      http:\/\/www.intel.com"},{"key":"10_CR14","unstructured":"Firasta, N., Buxton, M., Jinbo, P., Nasri, K., Kuo, S.: Intel AVX: New frontiers in performance improvement and energy efficiency (2008), White paper available at \n                    \n                      http:\/\/software.intel.com\/"},{"key":"10_CR15","unstructured":"Fog, A.: Instruction tables: List of instruction latencies, throughputs and micro-operation breakdowns for Intel, AMD and VIA CPUs (2012), \n                    \n                      http:\/\/www.agner.org\/optimize\/instruction_tables.pdf"},{"issue":"3","key":"10_CR16","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1109\/TC.2005.49","volume":"54","author":"P. Montgomery","year":"2005","unstructured":"Montgomery, P.: Five, six, and seven-term Karatsuba-like formulae. IEEE Transactions on Computers\u00a054(3), 362\u2013369 (2005)","journal-title":"IEEE Transactions on Computers"},{"key":"10_CR17","unstructured":"Gaudry, P., Brent, R., Zimmermann, P., Thom\u00e9, E.: The gf2x binary field multiplication library, \n                    \n                      https:\/\/gforge.inria.fr\/projects\/gf2x\/"},{"key":"10_CR18","unstructured":"Scott, M.: Optimal Irreducible Polynomials for GF(2\n                    m\n                  ) Arithmetic. Cryptology ePrint Archive, Report 2007\/192 (2007), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"issue":"3","key":"10_CR19","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0890-5401(88)90024-7","volume":"78","author":"T. Itoh","year":"1988","unstructured":"Itoh, T., Tsujii, S.: A fast algorithm for computing multiplicative inverses in GF(2\n                    m\n                  ) using normal bases. Inf. Comput.\u00a078(3), 171\u2013177 (1988)","journal-title":"Inf. Comput."},{"issue":"2","key":"10_CR20","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1023\/A:1013860532636","volume":"25","author":"J. Guajardo","year":"2002","unstructured":"Guajardo, J., Paar, C.: Itoh-Tsujii inversion in standard basis and its application in cryptography and codes. Designs, Codes and Cryptography\u00a025(2), 207\u2013216 (2002)","journal-title":"Designs, Codes and Cryptography"},{"issue":"1","key":"10_CR21","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10623-007-9073-6","volume":"45","author":"F. Rodr\u00edguez-Henr\u00edquez","year":"2007","unstructured":"Rodr\u00edguez-Henr\u00edquez, F., Morales-Luna, G., Saqib, N.A., Cruz-Cort\u00e9s, N.: Parallel Itoh\u2014Tsujii multiplicative inversion algorithm for a special class of trinomials. Des. Codes Cryptography\u00a045(1), 19\u201337 (2007)","journal-title":"Des. Codes Cryptography"},{"issue":"2-3","key":"10_CR22","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. Designs, Codes and Cryptography\u00a019(2-3), 195\u2013249 (2000)","journal-title":"Designs, Codes and Cryptography"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-44647-8_11","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"R. Gallant","year":"2001","unstructured":"Gallant, R., Lambert, R., Vanstone, S.: Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 190\u2013200. Springer, Heidelberg (2001)"},{"issue":"3","key":"10_CR24","first-page":"481","volume":"14","author":"O. Ahmadi","year":"2008","unstructured":"Ahmadi, O., Hankerson, D., Rodr\u00edguez-Henr\u00edquez, F.: Parallel formulations of scalar multiplication on Koblitz curves. Journal of Universal Computer Science\u00a014(3), 481\u2013504 (2008)","journal-title":"Journal of Universal Computer Science"},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/3-540-48892-8_16","volume-title":"Selected Areas in Cryptography","author":"J. L\u00f3pez","year":"1999","unstructured":"L\u00f3pez, J., Dahab, R.: Improved Algorithms for Elliptic Curve Arithmetic in GF(2\n                    n\n                  ). In: Tavares, S., Meijer, H. (eds.) SAC 1998. LNCS, vol.\u00a01556, pp. 201\u2013212. Springer, Heidelberg (1999)"},{"issue":"8","key":"10_CR26","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1109\/TC.2002.1024743","volume":"51","author":"E. Al-Daoud","year":"2002","unstructured":"Al-Daoud, E., Mahmod, R., Rushdan, M., Kili\u00e7man, A.: A New Addition Formula for Elliptic Curves over GF(2n). IEEE Trans. Computers\u00a051(8), 972\u2013975 (2002)","journal-title":"IEEE Trans. Computers"},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1007\/BFb0055747","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"D. Weber","year":"1998","unstructured":"Weber, D., Denny, T.: The Solution of McCurley\u2019s Discrete Log Challenge. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 458\u2013471. Springer, Heidelberg (1998)"},{"key":"10_CR28","unstructured":"Kim, K.H., Kim, S.I.: A new method for speeding up arithmetic on elliptic curves over binary fields. Cryptology ePrint Archive, Report 2007\/181 (2007), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"10_CR29","unstructured":"Birkner, P., Longa, P., Sica, F.: Four-Dimensional Gallant-Lambert-Vanstone Scalar Multiplication. Cryptology ePrint Archive, Report 2011\/608 (2011), \n                    \n                      http:\/\/eprint.iacr.org\/\n                    \n                    \n                  , \n                    \n                      http:\/\/www.patricklonga.bravehost.com\/speed_ecc.html#speed"},{"key":"10_CR30","unstructured":"Bernstein, D.J., Lange, T. (eds.): eBACS: ECRYPT Benchmarking of Cryptographic Systems (May 18, 2012), \n                    \n                      http:\/\/bench.cr.yp.to"},{"issue":"12","key":"10_CR31","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1016\/j.ipl.2012.03.012","volume":"112","author":"C. Su","year":"2012","unstructured":"Su, C., Fan, H.: Impact of Intel\u2019s new instruction sets on software implementation of GF(2)[x] multiplication. Inf. Process. Lett.\u00a0112(12), 497\u2013502 (2012)","journal-title":"Inf. Process. Lett."},{"key":"10_CR32","unstructured":"Hamburg, M.: Fast and compact elliptic-curve cryptography. Cryptology ePrint Archive, Report 2012\/309 (2012), \n                    \n                      http:\/\/eprint.iacr.org\/"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 LATINCRYPT 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33481-8_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:11:56Z","timestamp":1620130316000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33481-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642334801","9783642334818"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33481-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}