{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:43:28Z","timestamp":1725486208124},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540431688"},{"type":"electronic","value":"9783540456643"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45664-3_27","type":"book-chapter","created":{"date-parts":[[2007,6,3]],"date-time":"2007-06-03T17:32:07Z","timestamp":1180891927000},"page":"375-383","source":"Crossref","is-referenced-by-count":8,"title":["New Minimal Modified Radix-r Representation with Applications to Smart Cards"],"prefix":"10.1007","author":[{"given":"Marc","family":"Joye","sequence":"first","affiliation":[]},{"given":"Sung-Ming","family":"Yen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,2,5]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1109\/TEC.1961.5219227","volume":"EC-10","author":"A. Avizienis","year":"1961","unstructured":"A. Avizienis, Signed-digit number representations for fast parallel arithmetic, IRE Transactions on Electronic Computers EC-10 (1961), 389\u2013400, Reprinted in [Swa90, vol. II, pp. 54-65].","journal-title":"IRE Transactions on Electronic Computers"},{"issue":"8","key":"27_CR2","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1109\/12.238495","volume":"C-42","author":"S. Arno","year":"1993","unstructured":"S. Arno and F.S. Wheeler, Signed digit representations of minimal Hamming weight, IEEE Transactions on Computers C-42 (1993), no. 8, 1007\u20131010.","journal-title":"IEEE Transactions on Computers"},{"key":"27_CR3","series-title":"Lect Notes Comput Sci","first-page":"200","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201992","author":"E.F. Brickell","year":"1992","unstructured":"E.F. Brickell, D.M. Gordon, K.S. McCurley, and D.B. Wilson, Fast exponentiation with precomputation, Advances in Cryptology \u2014 EUROCRYPT\u201992, Lecture Notes in Computer Science, vol. 658, Springer-Verlag, 1992, pp. 200\u2013207."},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1093\/qjmam\/4.2.236","volume":"4","author":"A.D. Booth","year":"1951","unstructured":"A.D. Booth, A signed binary multiplication technique, The Quaterly Journal of Mechanics and Applied Mathematics 4 (1951), 236\u2013240, Reprinted in [Swa90, vol. I, pp. 100-104].","journal-title":"The Quaterly Journal of Mechanics and Applied Mathematics"},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1109\/TIT.1973.1055100","volume":"IT-19","author":"W.E. Clark","year":"1973","unstructured":"W.E. Clark and J.J. Liang, On arithmetic weight for a general radix representation of integers, IEEE Transactions on Information Theory IT-19 (1973), 823\u2013826.","journal-title":"IEEE Transactions on Information Theory"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"H. Cohen, A course in computational algebraic number theory, Springer-Verlag, 1993.","DOI":"10.1007\/978-3-662-02945-9"},{"issue":"2","key":"27_CR7","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/0304-3975(94)90037-X","volume":"129","author":"E\u011fecio\u011flu","year":"1994","unstructured":"\u00d6. E\u011fecio\u011flu and \u00c7.K. Ko\u00e7, Exponentiation using canonical recoding, Theoretical Computer Science 129 (1994), no. 2, 407\u2013417.","journal-title":"Theoretical Computer Science"},{"key":"27_CR8","first-page":"135","volume":"7","author":"D. Gollmann","year":"1996","unstructured":"D. Gollmann, Y. Han, and C.J. Mitchell, Redundant integer representation and fast exponentiation, Designs, Codes and Cryptography 7 (1996), 135\u2013151.","journal-title":"Designs, Codes and Cryptography"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1006\/jagm.1997.0913","volume":"27","author":"D.M. Gordon","year":"1998","unstructured":"D.M. Gordon, A survey of fast exponentiation methods, Journal of Algorithms 27 (1998), 129\u2013146.","journal-title":"Journal of Algorithms"},{"issue":"7","key":"27_CR10","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1109\/12.863044","volume":"49","author":"M. Joye","year":"2000","unstructured":"M. Joye and S.-M. Yen, Optimal left-to-right binary signed-digit recoding, IEEE Transactions on Computers 49 (2000), no. 7, 740\u2013748.","journal-title":"IEEE Transactions on Computers"},{"key":"27_CR11","unstructured":"D.E. Knuth, The art of computer programming\/Seminumerical algorithms, 2nd ed., vol. 2, Addison-Wesley, 1981."},{"key":"27_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/3-540-48071-4_25","volume-title":"Advances in Cryptology \u2014 CRYPTO\u201992","author":"K. Koyama","year":"1993","unstructured":"K. Koyama and Y. Tsurukoa, Speeding up elliptic cryptosystems by using a signed binary window method, Advances in Cryptology \u2014 CRYPTO\u201992, Lecture Notes in Computer Science, vol. 740, Springer-Verlag, 1993, pp. 345\u2013357."},{"key":"27_CR13","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1051\/ita\/1990240605311","volume":"24","author":"F. Morain","year":"1990","unstructured":"F. Morain and J. Olivos, Speeding up the computations on an elliptic curve using addition-subtraction chains, Theoretical Informatics and Applications 24 (1990), 531\u2013543.","journal-title":"Theoretical Informatics and Applications"},{"key":"27_CR14","unstructured":"A.J. Menezes, P.C. van Oorschot, and S.A. Vanstone, Handbook of applied cryptography, ch. 14, CRC Press, 1997."},{"key":"27_CR15","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0065-2458(08)60610-5","volume":"1","author":"G.W. Reitwiesner","year":"1960","unstructured":"G.W. Reitwiesner, Binary arithmetic, Advances in Computers 1 (1960), 231\u2013308.","journal-title":"Advances in Computers"},{"key":"27_CR16","unstructured":"E.E. Swartzlander, Jr. (ed.), Computer arithmetic, vol. I and II, IEEE Computer Society Press, 1990."},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"J.H. van Lint, Introduction to coding theory, Springer-Verlag, 1982.","DOI":"10.1007\/978-3-662-07998-0"},{"issue":"2","key":"27_CR18","first-page":"162","volume":"C-46","author":"H. Wu","year":"1997","unstructured":"H. Wu and M.A. Hasan, Efficient exponentiation of a primitive root in GF(2m), IEEE Transactions on Computers C-46 (1997), no. 2, 162\u2013172.","journal-title":"IEEE Transactions on Computers"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45664-3_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,12]],"date-time":"2018-10-12T04:11:12Z","timestamp":1539317472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45664-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540431688","9783540456643"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45664-3_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}