{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T04:31:46Z","timestamp":1776832306080,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540465591","type":"print"},{"value":"9783540465614","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11894063_35","type":"book-chapter","created":{"date-parts":[[2006,10,16]],"date-time":"2006-10-16T17:49:01Z","timestamp":1161020941000},"page":"445-459","source":"Crossref","is-referenced-by-count":23,"title":["FPGA Implementation of Point Multiplication on Koblitz Curves Using Kleinian Integers"],"prefix":"10.1007","author":[{"given":"V. S.","family":"Dimitrov","sequence":"first","affiliation":[]},{"given":"K. U.","family":"J\u00e4rvinen","sequence":"additional","affiliation":[]},{"suffix":"Jr.","given":"M. J.","family":"Jacobson","sequence":"additional","affiliation":[]},{"given":"W. F.","family":"Chan","sequence":"additional","affiliation":[]},{"given":"Z.","family":"Huang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N. Koblitz","year":"1987","unstructured":"Koblitz, N.: Elliptic curve cryptosystems. Math. Comp.\u00a048, 203\u2013209 (1987)","journal-title":"Math. Comp."},{"key":"35_CR2","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":"35_CR3","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":"35_CR4","unstructured":"National Institute of Standards and Technology (NIST): Digital signature standard (DSS). Federal Information Processing Standard, FIPS PUB 186-2 (2000)"},{"key":"35_CR5","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1023\/A:1008306223194","volume":"19","author":"J. Solinas","year":"2000","unstructured":"Solinas, J.: Efficient arithmetic on Koblitz curves. Designs, Codes, and Cryptography\u00a019, 195\u2013249 (2000)","journal-title":"Designs, Codes, and Cryptography"},{"key":"35_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/11693383_23","volume-title":"Selected Areas in Cryptography","author":"R. Avanzi","year":"2006","unstructured":"Avanzi, R., Heuberger, C., Prodinger, H.: Minimality of the Hamming weight of the \u03c4-NAF for Koblitz curves and improved combination with point halving. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol.\u00a03897, pp. 332\u2013344. Springer, Heidelberg (2006)"},{"key":"35_CR7","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0020-0190(98)00044-1","volume":"66","author":"V. Dimitrov","year":"1998","unstructured":"Dimitrov, V., Jullien, G., Miller, W.: An algorithm for modular exponentiation. Inform. Process. Lett.\u00a066, 155\u2013159 (1998)","journal-title":"Inform. Process. Lett."},{"key":"35_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/11554868_12","volume-title":"Progress in Cryptology \u2013 Mycrypt 2005","author":"M. Ciet","year":"2005","unstructured":"Ciet, M., Sica, F.: An analysis of double base number systems and a sublinear scalar multiplication algorithm. In: Dawson, E., Vaudenay, S. (eds.) Mycrypt 2005. LNCS, vol.\u00a03715, pp. 171\u2013182. Springer, Heidelberg (2005)"},{"key":"35_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/11593447_4","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"V. Dimitrov","year":"2005","unstructured":"Dimitrov, V., Imbert, L., Mishra, P.: Efficient and secure elliptic curve point multiplication using double-base chains. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol.\u00a03788, pp. 59\u201378. Springer, Heidelberg (2005)"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Avanzi, R., Sica, F.: Scalar multiplication on Koblitz curves using double bases. Technical Report Number 2006\/067, Cryptology ePrint Archive (2006)","DOI":"10.1007\/11958239_9"},{"key":"35_CR11","unstructured":"Sica, F.: Personal communication (2006)"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Conway, J., Smith, D.: On quaternions and octonions. AK Peters (2003)","DOI":"10.1201\/9781439864180"},{"key":"35_CR13","first-page":"319","volume":"26","author":"R. Tijdeman","year":"1973","unstructured":"Tijdeman, R.: On integers with many small prime factors. Compos. Math.\u00a026, 319\u2013330 (1973)","journal-title":"Compos. Math."},{"key":"35_CR14","first-page":"204","volume":"15","author":"A. Baker","year":"1968","unstructured":"Baker, A.: Linear forms in the logarithms of algebraic numbers IV. Mathematica\u00a015, 204\u2013216 (1968)","journal-title":"Mathematica"},{"key":"35_CR15","doi-asserted-by":"crossref","unstructured":"Mignotte, M., Waldshmidt, M.: Linear forms in two logarithms and Schneider\u2019s method III. Annales Fas. Sci. Toulouse, 43\u201375 (1990)","DOI":"10.5802\/afst.688"},{"key":"35_CR16","unstructured":"Tijdeman, R.: Personal communication (2006)"},{"key":"35_CR17","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)"},{"key":"35_CR18","first-page":"267","volume-title":"Handbook of Elliptic and Hyperelliptic Curve Cryptography","author":"C. Doche","year":"2006","unstructured":"Doche, C., Lange, T.: Arithmetic of elliptic curves. In: Cohen, H., Frey, G. (eds.) Handbook of Elliptic and Hyperelliptic Curve Cryptography, pp. 267\u2013302. Chapman & Hall\/CRC, Boca Raton (2006)"},{"key":"35_CR19","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0020-0190(00)00134-4","volume":"76","author":"A. Higuchi","year":"2000","unstructured":"Higuchi, A., Takagi, N.: A fast addition algorithm for elliptic curve arithmetic in GF(2\n                    n\n                  ) using projective coordinates. Inform. Process. Lett.\u00a076, 101\u2013103 (2000)","journal-title":"Inform. Process. Lett."},{"key":"35_CR20","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."},{"key":"35_CR21","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. Inform. Comput.\u00a078, 171\u2013177 (1988)","journal-title":"Inform. Comput."},{"key":"35_CR22","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1109\/TC.1985.1676616","volume":"34","author":"C. Wang","year":"1985","unstructured":"Wang, C., Troung, T., Shao, H., Deutsch, L., Omura, J., Reed, I.: VLSI architectures for computing multiplications and inverses in GF(2\n                    m\n                  ). IEEE Trans. Comput.\u00a034, 709\u2013717 (1985)","journal-title":"IEEE Trans. Comput."},{"key":"35_CR23","doi-asserted-by":"crossref","unstructured":"Bednara, M., Daldrup, M.: von\u00a0zur Gathen, J., Shokrollahi, J., Teich, J.: Reconfigurable implementation of elliptic curve crypto algorithms. In: IPDPS 2002, pp. 157\u2013164 (2002)","DOI":"10.1109\/IPDPS.2002.1016557"},{"key":"35_CR24","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1109\/TVLSI.2002.801608","volume":"10","author":"P. Leong","year":"2002","unstructured":"Leong, P., Leung, K.: A microcoded elliptic curve processor using FPGA technology. IEEE Trans. VLSI Syst.\u00a010, 550\u2013559 (2002)","journal-title":"IEEE Trans. VLSI Syst."},{"key":"35_CR25","unstructured":"Eberle, H., Gura, N., Shantz, S., Gupta, V.: A cryptographic processor for arbitrary elliptic curves over GF(2m). Technical Report SMLI TR-2003-123, Sun Microsystems, Inc. (2003)"},{"key":"35_CR26","doi-asserted-by":"crossref","unstructured":"Lutz, J., Hasan, A.: High performance FPGA based elliptic curve cryptographic co-processor. In: Proc. of the Int\u2019l Conf. on Information Technology: Coding and Computing, vol.\u00a02, pp. 486\u2013492 (2004)","DOI":"10.1109\/ITCC.2004.1286701"}],"container-title":["Lecture Notes in Computer Science","Cryptographic Hardware and Embedded Systems - CHES 2006"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11894063_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T16:24:11Z","timestamp":1580315051000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11894063_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540465591","9783540465614"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/11894063_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}