{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:04:59Z","timestamp":1743120299502,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540494966"},{"type":"electronic","value":"9783540494973"}],"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\/11935308_33","type":"book-chapter","created":{"date-parts":[[2006,11,15]],"date-time":"2006-11-15T06:26:42Z","timestamp":1163572002000},"page":"469-478","source":"Crossref","is-referenced-by-count":2,"title":["Left-to-Right Signed-Bit \u03c4-Adic Representations of n Integers (Short Paper)"],"prefix":"10.1007","author":[{"given":"Billy Bob","family":"Brumley","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"2\u20133","key":"33_CR1","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\u20133), 195\u2013249 (2000)","journal-title":"Designs, Codes, and Cryptography"},{"key":"33_CR2","unstructured":"Solinas, J.A.: Low-weight binary representations for pairs of integers. Technical Report CORR 2001-41, Centre for Applied Cryptographic Research, University of Waterloo, Canada (2001)"},{"key":"33_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/3-540-39200-9_24","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"M. Ciet","year":"2003","unstructured":"Ciet, M., Lange, T., Sica, F., Quisquater, J.J.: Improved algorithms for efficient arithmetic on elliptic curves using fast endomorphisms. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 388\u2013400. Springer, Heidelberg (2003)"},{"key":"33_CR4","unstructured":"Proos, J.: Joint sparse forms and generating zero columns when combing. Technical Report CORR 2003-23, Centre for Applied Cryptographic Research, University of Waterloo, Canada (2003)"},{"issue":"1-3","key":"33_CR5","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/j.tcs.2004.02.012","volume":"319","author":"P.J. Grabner","year":"2004","unstructured":"Grabner, P.J., Heuberger, C., Prodinger, H.: Distribution results for low-weight binary representations for pairs of integers. Theoretical Computer Science\u00a0319(1-3), 307\u2013331 (2004)","journal-title":"Theoretical Computer Science"},{"key":"33_CR6","unstructured":"Ruan, X., Katti, R.S.: Low-weight left-to-right binary signed-digit representation of n integers. In: 2004 IEEE International Symposium on Information Theory (2004)"},{"key":"33_CR7","unstructured":"Brumley, B.B.: Efficient three-term simultaneous elliptic scalar multiplication with applications. In: Proceedings of the 11th Nordic Workshop on Secure IT Systems (NordSec 2006), Link\u00f6ping, Sweden (to appear, 2006)"},{"key":"33_CR8","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, New York (2004)"},{"key":"33_CR9","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)"},{"issue":"4","key":"33_CR10","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"IT-31","author":"T. ElGamal","year":"1985","unstructured":"ElGamal, T.: A Public-Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE Transactions on Information Theory\u00a0IT-31(4), 469\u2013472 (1985)","journal-title":"IEEE Transactions on Information Theory"},{"key":"33_CR11","doi-asserted-by":"publisher","first-page":"806","DOI":"10.2307\/2312327","volume":"71","author":"E.G. Straus","year":"1964","unstructured":"Straus, E.G.: Addition chains of vectors (problem 5125). American Mathematical Monthly\u00a071, 806\u2013808 (1964)","journal-title":"American Mathematical Monthly"},{"key":"33_CR12","unstructured":"NIST: Recommended elliptic curves for federal government use. Technical report, National Institute of Standards and Technology (NIST) (1999)"},{"key":"33_CR13","unstructured":"J\u00e4rvinen, K.: Unified elliptic curve point addition and subtraction algorithm. Technical report, Packet Level Authentication Project, Signal Processing Laboratory, Helsinki University of Technology, Espoo, Finland (2006) Internal"}],"container-title":["Lecture Notes in Computer Science","Information and Communications Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11935308_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,25]],"date-time":"2019-08-25T20:09:56Z","timestamp":1566763796000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11935308_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540494966","9783540494973"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11935308_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}