{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:01:49Z","timestamp":1742400109065},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642004674"},{"type":"electronic","value":"9783642004681"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","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-00468-1_25","type":"book-chapter","created":{"date-parts":[[2009,3,11]],"date-time":"2009-03-11T14:54:35Z","timestamp":1236783275000},"page":"443-462","source":"Crossref","is-referenced-by-count":17,"title":["Fast Multibase Methods and Other Several Optimizations for Elliptic Curve Scalar Multiplication"],"prefix":"10.1007","author":[{"given":"Patrick","family":"Longa","sequence":"first","affiliation":[]},{"given":"Catherine","family":"Gebotys","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-540-77026-8_13","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2007","author":"D. Bernstein","year":"2007","unstructured":"Bernstein, D., Birkner, P., Lange, T., Peters, C.: Optimizing Double-Base Elliptic-Curve Single-Scalar Multiplication. In: Srinathan, K., Rangan, C.P., Yung, M. (eds.) INDOCRYPT 2007. LNCS, vol.\u00a04859, pp. 167\u2013182. Springer, Heidelberg (2007)"},{"key":"25_CR2","unstructured":"Bernstein, D., Lange, T.: Analysis and Optimization of Elliptic-Curve Single-Scalar Multiplication. Cryptology ePrint Archive, Report 2007\/455 (2007)"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-540-76900-2_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"D. Bernstein","year":"2007","unstructured":"Bernstein, D., Lange, T.: Faster Addition and Doubling on Elliptic Curves. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol.\u00a04833, pp. 29\u201350. Springer, Heidelberg (2007)"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-540-77224-8_4","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"D. Bernstein","year":"2007","unstructured":"Bernstein, D., Lange, T.: Inverted Edwards Coordinates. In: Bozta\u015f, S., Lu, H.-F(F.) (eds.) AAECC 2007. LNCS, vol.\u00a04851, pp. 20\u201327. Springer, Heidelberg (2007)"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/3-540-44828-4_5","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"O. Billet","year":"2003","unstructured":"Billet, O., Joye, M.: The Jacobi Model of an Elliptic Curve and Side-Channel Analysis. In: Fossorier, M.P.C., H\u00f8holdt, T., Poli, A. (eds.) AAECC 2003. LNCS, vol.\u00a02643, pp. 34\u201342. Springer, Heidelberg (2003)"},{"issue":"2","key":"25_CR6","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10623-005-3299-y","volume":"39","author":"M. Ciet","year":"2006","unstructured":"Ciet, M., Joye, M., Lauter, K., Montgomery, P.L.: Trading Inversions for Multiplications in Elliptic Curve Cryptography. Designs, Codes and Cryptography\u00a039(2), 189\u2013206 (2006)","journal-title":"Designs, Codes and Cryptography"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Dimitrov, V., Jullien, G., Miller, W.: Theory and Applications for a Double-Base Number System. ARITH 1997, p. 44 (1997)","DOI":"10.1109\/ARITH.1997.614878"},{"key":"25_CR8","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.K.: 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":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-540-75496-1_26","volume-title":"Information Security","author":"V. Dimitrov","year":"2007","unstructured":"Dimitrov, V., Mishra, P.K.: Efficient Quintuple Formulas for Elliptic Curves and Efficient Scalar Multiplication using Multibase Number Representation. In: Garay, J.A., Lenstra, A.K., Mambo, M., Peralta, R. (eds.) ISC 2007. LNCS, vol.\u00a04779, pp. 390\u2013406. Springer, Heidelberg (2007)"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-540-70500-0_32","volume-title":"Information Security and Privacy","author":"C. Doche","year":"2008","unstructured":"Doche, C., Habsieger, L.: A Tree-Base Approach for Computing Double-Base Chains. In: Mu, Y., Susilo, W., Seberry, J. (eds.) ACISP 2008. LNCS, vol.\u00a05107, pp. 433\u2013446. Springer, Heidelberg (2008)"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/11941378_24","volume-title":"Progress in Cryptology - INDOCRYPT 2006","author":"C. Doche","year":"2006","unstructured":"Doche, C., Imbert, L.: Extended Double-Base Number System with Applications to Elliptic Curve Cryptography. In: Barua, R., Lange, T. (eds.) INDOCRYPT 2006. LNCS, vol.\u00a04329, pp. 335\u2013348. Springer, Heidelberg (2006)"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1090\/S0273-0979-07-01153-6","volume":"44","author":"H. Edwards","year":"2007","unstructured":"Edwards, H.: A Normal Form for Elliptic Curves. Bulletin of the American Mathematical Society\u00a044, 393\u2013422 (2007)","journal-title":"Bulletin of the American Mathematical Society"},{"key":"25_CR13","unstructured":"Elmegaard-Fessel, L.: Efficient Scalar Multiplication and Security against Power Analysis in Cryptosystems based on the NIST Elliptic Curves over Prime Fields. Master Thesis, University of Copenhagen (2006)"},{"key":"25_CR14","volume-title":"Guide to Elliptic Curve Cryptography","author":"D. Hankerson","year":"2004","unstructured":"Hankerson, D., Menezes, A., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer, Heidelberg (2004)"},{"key":"25_CR15","unstructured":"Hisil, H., Wong, K., Carter, G., Dawson, E.: Faster Group Operations on Elliptic Curves. Cryptology ePrint Archive, Report 2007\/441 (2007)"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Hisil, H., Wong, K., Carter, G., Dawson, E.: An Intersection Form for Jacobi-Quartic Curves. Personal communication (2008)","DOI":"10.1007\/978-3-642-02620-1_31"},{"key":"25_CR17","unstructured":"Longa, P.: Accelerating the Scalar Multiplication on Elliptic Curve Cryptosystems over Prime Fields. Master Thesis, University of Ottawa (2007), http:\/\/patricklonga.bravehost.com\/publications.html"},{"key":"25_CR18","unstructured":"Longa, P.: ECC Point Arithmetic Formulae (EPAF), http:\/\/patricklonga.bravehost.com\/jacobian.html"},{"key":"25_CR19","unstructured":"Longa, P., Gebotys, C.: Setting Speed Records with the (Fractional) Multibase Non-Adjacent Form Method for Efficient Elliptic Curve Scalar Multiplication. CACR Technical Report, CACR 2008-06, University of Waterloo (2008)"},{"key":"25_CR20","unstructured":"Longa, P., Gebotys, C.: Novel Precomputation Schemes for Elliptic Curve Cryptosystems. Cryptology ePrint Archive, Report 2008\/526 (2008)"},{"issue":"3","key":"25_CR21","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1109\/TC.2007.70815","volume":"57","author":"P. Longa","year":"2008","unstructured":"Longa, P., Miri, A.: Fast and Flexible Elliptic Curve Point Arithmetic over Prime Fields. IEEE Trans. Comp.\u00a057(3), 289\u2013302 (2008)","journal-title":"IEEE Trans. Comp."},{"key":"25_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-540-78440-1_14","volume-title":"Public Key Cryptography \u2013 PKC 2008","author":"P. Longa","year":"2008","unstructured":"Longa, P., Miri, A.: New Composite Operations and Precomputation Scheme for Elliptic Curve Cryptosystems over Prime Fields. In: Cramer, R. (ed.) PKC 2008. LNCS, vol.\u00a04939, pp. 229\u2013247. Springer, Heidelberg (2008)"},{"key":"25_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-540-73074-3_15","volume-title":"Arithmetic of Finite Fields","author":"N. Meloni","year":"2007","unstructured":"Meloni, N.: New Point Addition Formulae for ECC Applications. In: Carlet, C., Sunar, B. (eds.) WAIFI 2007. LNCS, vol.\u00a04547, pp. 189\u2013201. Springer, Heidelberg (2007)"},{"key":"25_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/3-540-36552-4_21","volume-title":"Information Security and Cryptology - ICISC 2002","author":"B. M\u00f6ller","year":"2003","unstructured":"M\u00f6ller, B.: Improved Techniques for Fast Exponentiation. In: Lee, P.J., Lim, C.H. (eds.) ICISC 2002. LNCS, vol.\u00a02587, pp. 298\u2013312. Springer, Heidelberg (2003)"},{"key":"25_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/11496618_11","volume-title":"Information Security and Cryptology \u2013 ICISC 2004","author":"B. M\u00f6ller","year":"2005","unstructured":"M\u00f6ller, B.: Fractional windows revisited:Improved signed-digit representations for efficient exponentiation. In: Park, C.-s., Chee, S. (eds.) ICISC 2004. LNCS, vol.\u00a03506, pp. 137\u2013153. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2013 PKC 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00468-1_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T16:12:54Z","timestamp":1558195974000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00468-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642004674","9783642004681"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00468-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}