{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:42:26Z","timestamp":1725540146278},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642054433"},{"type":"electronic","value":"9783642054457"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","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-05445-7_21","type":"book-chapter","created":{"date-parts":[[2009,11,3]],"date-time":"2009-11-03T10:03:23Z","timestamp":1257242603000},"page":"331-349","source":"Crossref","is-referenced-by-count":8,"title":["On Repeated Squarings in Binary Fields"],"prefix":"10.1007","author":[{"given":"Kimmo U.","family":"J\u00e4rvinen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in Cryptology","author":"V. Miller","year":"1986","unstructured":"Miller, V.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol.\u00a0218, pp. 417\u2013426. Springer, Heidelberg (1986)"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"203","DOI":"10.2307\/2007884","volume":"48","author":"N. Koblitz","year":"1987","unstructured":"Koblitz, N.: Elliptic curve cryptosystems. Math. Comput.\u00a048, 203\u2013209 (1987)","journal-title":"Math. Comput."},{"key":"21_CR3","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, 171\u2013177 (1988)","journal-title":"Inf. Comput."},{"key":"21_CR4","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 Cryptogr.\u00a025, 207\u2013216 (2002)","journal-title":"Designs Codes Cryptogr."},{"key":"21_CR5","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":"21_CR6","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.micpro.2008.08.002","volume":"33","author":"K. J\u00e4rvinen","year":"2009","unstructured":"J\u00e4rvinen, K., Skytt\u00e4, J.: Fast point multiplication on Koblitz curves: Parallelization method and implementations. Microprocess. Microsyst.\u00a033, 106\u2013116 (2009)","journal-title":"Microprocess. Microsyst."},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-540-89754-5_29","volume-title":"Progress in Cryptology - INDOCRYPT 2008","author":"C. Rebeiro","year":"2008","unstructured":"Rebeiro, C., Mukhopadhyay, D.: High speed compact elliptic curve cryptoprocessor for FPGA platforms. In: Chowdhury, D.R., Rijmen, V., Das, A. (eds.) INDOCRYPT 2008. LNCS, vol.\u00a05365, pp. 376\u2013388. Springer, Heidelberg (2008)"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1145\/1015047.1015052","volume":"3","author":"T. Wollinger","year":"2004","unstructured":"Wollinger, T., Guajardo, J., Paar, C.: Security on FPGAs: State-of-the-art implementations and attacks. ACM Trans. Embedd. Comput. Syst.\u00a03, 534\u2013574 (2004)","journal-title":"ACM Trans. Embedd. Comput. Syst."},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1109\/ITCC.2004.1286701","volume-title":"International Conference on Information Technology: Coding and Computing","author":"J. Lutz","year":"2004","unstructured":"Lutz, J., Hasan, A.: High performance FPGA based elliptic curve cryptographic co-processor. In: International Conference on Information Technology: Coding and Computing, vol.\u00a02, pp. 486\u2013492. IEEE Computer Society, Los Alamitos (2004)"},{"key":"21_CR10","unstructured":"National Institute of Standards and Technology (NIST): Digital signature standard (DSS). Federal Information Processing Standard, FIPS PUB 186-2 (2000)"},{"key":"21_CR11","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. J. Univers. Comput. Sci.\u00a014, 481\u2013504 (2008)","journal-title":"J. Univers. Comput. Sci."},{"key":"21_CR12","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. J. Algorithms\u00a027, 129\u2013146 (1998)","journal-title":"J. Algorithms"},{"key":"21_CR13","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 Cryptogr.\u00a019, 195\u2013249 (2000)","journal-title":"Designs Codes Cryptogr."},{"key":"21_CR14","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                    m\n                  ). In: Tavares, S., Meijer, H. (eds.) SAC 1998. LNCS, vol.\u00a01556, pp. 201\u2013212. Springer, Heidelberg (1999)"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1007\/3-540-48405-1_25","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"P. Kocher","year":"1999","unstructured":"Kocher, P., Jaffe, J., Jun, B.: Differential power analysis. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 388\u2013397. Springer, Heidelberg (1999)"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1109\/12.956092","volume":"50","author":"M.A. Hasan","year":"2001","unstructured":"Hasan, M.A.: Power analysis attacks and algorithmic approaches to their countermeasures for Koblitz curve cryptosystems. IEEE Trans. Comput.\u00a050, 1071\u20131083 (2001)","journal-title":"IEEE Trans. Comput."},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/TVLSI.2007.912228","volume":"16","author":"W.N. Chelton","year":"2008","unstructured":"Chelton, W.N., Benaissa, M.: Fast elliptic curve cryptography on FPGA. IEEE Trans. Very Large Scale Integr (VLSI) Syst.\u00a016, 198\u2013205 (2008)","journal-title":"IEEE Trans. Very Large Scale Integr. (VLSI) Syst."},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1109\/TC.2007.70824","volume":"57","author":"C. Vuillaume","year":"2008","unstructured":"Vuillaume, C., Okeya, K., Takagi, T.: Short-memory scalar multiplication for Koblitz curves. IEEE Trans. Comput.\u00a057, 481\u2013489 (2008)","journal-title":"IEEE Trans. Comput."},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"1469","DOI":"10.1109\/TC.2008.65","volume":"57","author":"V.S. Dimitrov","year":"2008","unstructured":"Dimitrov, V.S., J\u00e4rvinen, K.U., Jacobson, M.J., Chan, W.F., Huang, Z.: Provably sublinear point multiplication on Koblitz curves and its hardware implementation. IEEE Trans. Comput.\u00a057, 1469\u20131481 (2008)","journal-title":"IEEE Trans. Comput."},{"key":"21_CR20","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1109\/TC.2007.70822","volume":"57","author":"F. Rodr\u00edguez-Henr\u00edquez","year":"2008","unstructured":"Rodr\u00edguez-Henr\u00edquez, F., Morales-Luna, G., L\u00f3pez, J.: Low-complexity bit-parallel square root computation over GF(2\n                    m\n                  ) for all trinomials. IEEE Trans. Comput.\u00a057, 471\u2013480 (2008)","journal-title":"IEEE Trans. Comput."},{"key":"21_CR21","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., Kilicman, A.: A new addition formula for elliptic curves over GF(2\n                    n\n                  ). IEEE Trans. Comput.\u00a051, 972\u2013975 (2002)","journal-title":"IEEE Trans. Comput."}],"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-642-05445-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T11:37:12Z","timestamp":1580297832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-05445-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642054433","9783642054457"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-05445-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}