{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T08:29:01Z","timestamp":1776846541798,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540583332","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-48658-5_11","type":"book-chapter","created":{"date-parts":[[2007,8,9]],"date-time":"2007-08-09T16:50:39Z","timestamp":1186678239000},"page":"95-107","source":"Crossref","is-referenced-by-count":149,"title":["More Flexible Exponentiation with Precomputation"],"prefix":"10.1007","author":[{"given":"Chae Hoon","family":"Lim","sequence":"first","affiliation":[]},{"given":"Pil Joong","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"D.E. Knuth, The art of computer programming, Vol.2: Seminumerical algorithms, second Edition, Addison-Wesley (1981)."},{"issue":"17","key":"11_CR2","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1049\/el:19890785","volume":"25","author":"J. Jedwab","year":"1989","unstructured":"J. Jedwab and C.J. Mitchell, \u201cMinimum weight modified signed-digit representations and fast exponentiation,\u201d Elect. Let. 25(17), 1171\u20131172 (1989).","journal-title":"Elect. Let."},{"issue":"6","key":"11_CR3","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0898-1221(93)90295-7","volume":"25","author":"C.N. Zhang","year":"1993","unstructured":"C.N. Zhang, \u201cAn improved binary algorithm for RSA,\u201d Computers Math. Applic. 25(6), 15\u201324 (1993).","journal-title":"Computers Math. Applic."},{"key":"11_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1007\/0-387-34805-0_37","volume-title":"Advances in Cryptoloy-Crypto\u201989","author":"J. Bos","year":"1990","unstructured":"J. Bos and M. Coster, \u201cAddition chain heuristics,\u201d In Advances in Cryptoloy-Crypto\u201989, Lecture Notes in Computer Science 435, (edited by G. Brassard), pp.400\u2013407, Springer-Verlag (1990)."},{"key":"11_CR5","unstructured":"J. Sauerbrey and A. Dietel, \u201cResource requirements for the application of addition chains modulo exponentiation,\u201d In Proc. Eurocrypt\u201992, Balatonfured, Hungary (1992)."},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1137\/0210047","volume":"3","author":"P. Downey","year":"1981","unstructured":"P. Downey, B. Leony and R. Sethi, \u201cComputing sequences with addition chains,\u201d Siam J. Comput. 3, 638\u2013696 (1981).","journal-title":"Siam J. Comput."},{"issue":"2","key":"11_CR7","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"R.L. Rivest, A. Shamir and L. Adleman, \u201cA method for obtaining digital signatures and public-key cryptosystems,\u201d Commun. ACM, 21(2), 120\u2013126 (1978).","journal-title":"Commun. ACM"},{"issue":"4","key":"11_CR8","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. ElGmal","year":"1985","unstructured":"T. ElGmal, \u201cA public key cryptosystem and a signature scheme based on the discrete logarithm,\u201d IEEE Trans. Inform. Theory 31(4), 469\u2013472 (1985).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"11_CR9","unstructured":"E.F. Brickell, D.M. Gordon, K.S. McCurley and D. Wilson, \u201cFast exponentiation with precomputation,\u201d In Proc. Eurocrypt\u201992, Balatonfured, Hungary (1992)."},{"issue":"3","key":"11_CR10","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C.P. Schnorr","year":"1991","unstructured":"C.P. Schnorr, \u201cEfficient signature generation by smart cards,\u201d J. Cryptology 4(3), 161\u2013174 (1991).","journal-title":"J. Cryptology"},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/BF00191319","volume":"5","author":"E.F. Brickell","year":"1992","unstructured":"E.F. Brickell and K.S. McCurley, \u201cAn interactive identification scheme based on discrete logarithms and factoring,\u201d J. Cryptology 5(1) 29\u201339, (1992).","journal-title":"J. Cryptology"},{"key":"11_CR12","unstructured":"T. Okamoto, \u201cProvably secure and practical identification schemes and corresponding signature schemes,\u201d In Proc. Crypto\u201992, Santa Barbara, CA (1992)."},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1145\/322344.322355","volume":"29","author":"D.W. Matula","year":"1982","unstructured":"D.W. Matula, \u201cBasic digit sets for radix representation,\u201d J. ACM 29, 1131\u20131143 (1982).","journal-title":"J. ACM"},{"issue":"169","key":"11_CR14","first-page":"42980","volume":"56","author":"A proposed Federal information processing standard for digital signature standard (DSS)","year":"1991","unstructured":"A proposed Federal information processing standard for digital signature standard (DSS), Federal Register 56(169), 42980\u201342982 (1991).","journal-title":"Federal Register"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO \u201994"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48658-5_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:16:07Z","timestamp":1605629767000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48658-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540583332"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-48658-5_11","relation":{},"subject":[]}}