{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:57:26Z","timestamp":1725555446418},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642128264"},{"type":"electronic","value":"9783642128271"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12827-1_6","type":"book-chapter","created":{"date-parts":[[2010,5,5]],"date-time":"2010-05-05T15:15:11Z","timestamp":1273072511000},"page":"67-84","source":"Crossref","is-referenced-by-count":3,"title":["Width-3 Joint Sparse Form"],"prefix":"10.1007","author":[{"given":"Katsuyuki","family":"Okeya","sequence":"first","affiliation":[]},{"given":"Hidehiro","family":"Kato","sequence":"additional","affiliation":[]},{"given":"Yasuyuki","family":"Nogami","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"Avanzi, R.: On multi-exponentiation in cryptography, Cryptology ePrint Archive: Report 2002\/154 (2002)"},{"issue":"2","key":"6_CR2","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1093\/qjmam\/4.2.236","volume":"4","author":"A. Booth","year":"1951","unstructured":"Booth, A.: A signed binary multiplication technique. Quarterly Journal of Mechanics and Applied Mathematics\u00a04(2), 236\u2013240 (1951)","journal-title":"Quarterly Journal of Mechanics and Applied Mathematics"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/11601494_16","volume-title":"Security and Privacy in Ad-hoc and Sensor Networks","author":"E. Dahmen","year":"2005","unstructured":"Dahmen, E., Okeya, K., Takagi, T.: An Advanced Method for Joint Scalar Multiplications on Memory Constraint Devices. In: Molva, R., Tsudik, G., Westhoff, D. (eds.) ESAS 2005. LNCS, vol.\u00a03813, pp. 189\u2013204. Springer, Heidelberg (2005)"},{"key":"6_CR4","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.P. Gallant","year":"2001","unstructured":"Gallant, R.P., Lambert, J.L., Vanstone, S.A.: Faster Point Multiplication on Elliptic Curves with Efficient Endomorphism. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 190\u2013200. Springer, Heidelberg (2001)"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.tcs.2005.03.050","volume":"341","author":"C. Heuberger","year":"2005","unstructured":"Heuberger, C., Katti, R., Prodinger, H., Ruan, X.: The Alternating Greedy Expansion and Applications to Left-To-Right Algorithms in Cryptography. Theoret. Comput. Sci.\u00a0341, 55\u201372 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR6","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. Comp.\u00a048, 203\u2013209 (1987)","journal-title":"Math. Comp."},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/978-3-540-24852-1_34","volume-title":"Applied Cryptography and Network Security","author":"B. Kuang","year":"2004","unstructured":"Kuang, B., Zhu, Y., Zhang, Y.: An Improved Algorithm for uP+vQ using JSF\n                  3. In: Jakobsson, M., Yung, M., Zhou, J. (eds.) ACNS 2004. LNCS, vol.\u00a03089, pp. 467\u2013478. Springer, Heidelberg (2004)"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/3-540-48658-5_11","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"C. Lim","year":"1994","unstructured":"Lim, C., Lee, P.: More flexible exponentiation with precomputation. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 95\u2013107. Springer, Heidelberg (1994)"},{"key":"6_CR9","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.S. Miller","year":"1986","unstructured":"Miller, V.S.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol.\u00a0218, pp. 417\u2013426. Springer, Heidelberg (1986)"},{"key":"6_CR10","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1051\/ita\/1990240605311","volume":"24","author":"F. Morain","year":"1990","unstructured":"Morain, F., Olivos, J.: Speeding up the computations on an elliptic curve using addition-subtraction chains. Inform. Theor. Appl.\u00a024, 531\u2013543 (1990)","journal-title":"Inform. Theor. Appl."},{"key":"6_CR11","unstructured":"Shoup, V.: NTL: A Library for doing Number Theory (version 5.5.2), \n                    \n                      http:\/\/www.shoup.net\/ntl\/"},{"key":"6_CR12","unstructured":"Proos, J.: Joint Sparse Forms and Generating Zero Columns when Combing, Technical Report of the Centre for Applied Cryptographic Research, University of Waterloo - CACR, CORR 2003-23 (2003), \n                    \n                      http:\/\/www.cacr.math.uwaterloo.ca"},{"key":"6_CR13","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0065-2458(08)60610-5","volume":"1","author":"G.W. Reitwiesner","year":"1960","unstructured":"Reitwiesner, G.W.: Binary arithmetic. Advances in Computers\u00a01, 231\u2013308 (1960)","journal-title":"Advances in Computers"},{"key":"6_CR14","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, 195\u2013249 (2000)","journal-title":"Designs, Codes and Cryptography"},{"key":"6_CR15","unstructured":"Solinas, J.A.: Low-weight binary representations for pairs of integers, Technical Report of the Centre for Applied Cryptographic Research, University of Waterloo - CACR, CORR 2001-41 (2001), \n                    \n                      http:\/\/www.cacr.math.uwaterloo.ca"}],"container-title":["Lecture Notes in Computer Science","Information Security, Practice and Experience"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12827-1_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T07:47:29Z","timestamp":1619768849000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12827-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642128264","9783642128271"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12827-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}