{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T18:10:45Z","timestamp":1675275045128},"reference-count":9,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[1999,6,1]],"date-time":"1999-06-01T00:00:00Z","timestamp":928195200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Communications"],"published-print":{"date-parts":[[1999,6]]},"DOI":"10.1016\/s0140-3664(99)00043-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:56:11Z","timestamp":1027652171000},"page":"871-874","source":"Crossref","is-referenced-by-count":2,"title":["A fast modular multiplication method based on the Lempel\u2013Ziv binary tree"],"prefix":"10.1016","volume":"22","author":[{"given":"C.-Y.","family":"Chen","sequence":"first","affiliation":[]},{"given":"T.-C.","family":"Liu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0140-3664(99)00043-2_BIB1","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","article-title":"A method for obtaining digital signatures and public-key cryptosystems","volume":"21","author":"Rivest","year":"1978","journal-title":"Comm. ACM"},{"issue":"15","key":"10.1016\/S0140-3664(99)00043-2_BIB2","doi-asserted-by":"crossref","first-page":"794","DOI":"10.1049\/el:19870563","article-title":"Fast computation of A*B modulo N","volume":"23","author":"Baker","year":"1987","journal-title":"Electron. Lett."},{"issue":"5","key":"10.1016\/S0140-3664(99)00043-2_BIB3","first-page":"497","article-title":"A computer algorithm for calculating the product AB modulo M","volume":"C-32","author":"Blakley","year":"1983","journal-title":"IEEE Trans."},{"issue":"24","key":"10.1016\/S0140-3664(99)00043-2_BIB4","doi-asserted-by":"crossref","first-page":"2017","DOI":"10.1049\/el:19941383","article-title":"Iterative modular multiplication algorithm without magnitude comparison","volume":"30","author":"Chiou","year":"1994","journal-title":"Electron. Lett."},{"issue":"170","key":"10.1016\/S0140-3664(99)00043-2_BIB5","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","article-title":"Modular multiplication without trial division","volume":"44","author":"Montgomery","year":"1985","journal-title":"Math. Comput."},{"key":"10.1016\/S0140-3664(99)00043-2_BIB6","unstructured":"F.-F. Su, T. Hwang, Comments on iterative modular multiplication without magnitude comparison, Proceedings of The Sixth National Conference on Information Security, Taichung, Taiwan, 1996 pp. 21\u201322."},{"key":"10.1016\/S0140-3664(99)00043-2_BIB7","article-title":"The art of computer programming","volume":"2","author":"Knuth","year":"1981"},{"issue":"5","key":"10.1016\/S0140-3664(99)00043-2_BIB8","first-page":"530","article-title":"Compression of individual sequences via variable rate coding","volume":"IT-24","author":"Lempel","year":"1978","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0140-3664(99)00043-2_BIB9","doi-asserted-by":"crossref","unstructured":"Y. Yacobi, Exponentiating faster with addition chains, Proceedings of EUROCRYPT\u201990, 1990 pp. 205\u2013212.","DOI":"10.1007\/3-540-46877-3_20"}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366499000432?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366499000432?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T06:05:52Z","timestamp":1580882752000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366499000432"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,6]]},"references-count":9,"journal-issue":{"issue":"9","published-print":{"date-parts":[[1999,6]]}},"alternative-id":["S0140366499000432"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(99)00043-2","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[1999,6]]}}}