{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:55:18Z","timestamp":1759146918702},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540000099"},{"type":"electronic","value":"9783540360773"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36077-8_43","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:24:15Z","timestamp":1184603055000},"page":"405-414","source":"Crossref","is-referenced-by-count":18,"title":["Efficient Parallel Modular Exponentiation Algorithm"],"prefix":"10.1007","author":[{"given":"Nadia","family":"Nedjah","sequence":"first","affiliation":[]},{"given":"Luiza","family":"de Macedo Mourelle","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,10,24]]},"reference":[{"key":"43_CR1","series-title":"Lect Notes Comput Sci","first-page":"400","volume-title":"Addition chain heuristics","author":"J. Bos","year":"1989","unstructured":"J. Bos and M. Coster, Addition chain heuristics, Proceedings of CRYPTO\u201989, Lecture Notes in Computer Science 435:400\u2013407, Springer-Verlag, 1989."},{"key":"43_CR2","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, Computing sequences with addition chains, SIAM Journal on Computing, 3:638\u2013696, 1981.","journal-title":"SIAM Journal on Computing"},{"key":"43_CR3","unstructured":"B.S. Kaliski Jr., The Z80180 and big-number arithmetic, Dr. Dobb\u2019s Journal, 50:58, September 1993."},{"key":"43_CR4","volume-title":"The art of programming: seminumerical algorithms","author":"D.E. Knuth","year":"1981","unstructured":"D.E. Knuth, The art of programming: seminumerical algorithms, volume 2. Reading, MA: Addison-Wesley, Second edition, 1981.","edition":"Second edition"},{"issue":"10","key":"43_CR5","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0898-1221(95)00153-P","volume":"30","author":"K. Ko\u00e7","year":"1995","unstructured":"\u00c7.K. Ko\u00e7, Analysis of sliding window techniques for exponentiation, Computers and Mathematics with Applications, 30(10):17\u201324, 1995.","journal-title":"Computers and Mathematics with Applications"},{"key":"43_CR6","unstructured":"\u00c7.K. Ko\u00e7, High speed RSA implementation, Research Report, RSA Laboratories, Version 2, California, United States of America, 1994."},{"issue":"3","key":"43_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0898-1221(92)90209-Z","volume":"24","author":"K. Ko\u00e7","year":"1992","unstructured":"\u00c7.K. Ko\u00e7 and C.Y. Hung, Adaptive m-ary segmentation and canonical recoding algorithms for multiplication of large binary numbers, Computers and Mathematics with Applications, 24(3):3\u201312,1992.","journal-title":"Computers and Mathematics with Applications"},{"key":"43_CR8","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1080\/00207169108804009","volume":"40","author":"K. Ko\u00e7","year":"1991","unstructured":"\u00c7.K. Ko\u00e7, High-radix and bit recoding techniques for modular exponentiation, International Journal of Computer Mathematics, 40(3&4):139\u2013156, 1991.","journal-title":"International Journal of Computer Mathematics"},{"issue":"1","key":"43_CR9","first-page":"72","volume":"E81-A","author":"N. Kunihiro","year":"1998","unstructured":"N. Kunihiro and H. Yamamoto, Window and extended window methods for addition chain and addition-subtraction chain, IEICE Transactions, E81-A(1):72\u201381, January 1998.","journal-title":"IEICE Transactions"},{"issue":"1","key":"43_CR10","first-page":"60","volume":"E83-A","author":"N. Kunihiro","year":"2000","unstructured":"N. Kunihiro and H. Yamamoto, New methods for generating short addition chain, IEICE Transactions, E83-A(1):60\u201367, January 2000.","journal-title":"IEICE Transactions"},{"key":"43_CR11","doi-asserted-by":"crossref","unstructured":"A. Menezes, P. van Oorschot and S. Vanstone, Handbook of applied cryptography, CRC Press, 1996.","DOI":"10.1201\/9781439821916"},{"key":"43_CR12","first-page":"169","volume":"56","author":"National Institute of Standards and Technology","year":"1991","unstructured":"National Institute of Standards and Technology, Digital signature standard\u2014DSS, Federal Register, 56:169, 1991.","journal-title":"Digital signature standard\u2014DSS"},{"issue":"2","key":"43_CR13","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, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, 21(2):120\u2013126, 1978.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Advances in Information Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36077-8_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T00:32:54Z","timestamp":1550449974000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36077-8_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540000099","9783540360773"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-36077-8_43","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}