{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T04:31:45Z","timestamp":1776832305255,"version":"3.51.2"},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1998,5,1]],"date-time":"1998-05-01T00:00:00Z","timestamp":893980800000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1998,5]]},"DOI":"10.1016\/s0020-0190(98)00044-1","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:32:24Z","timestamp":1049736744000},"page":"155-159","source":"Crossref","is-referenced-by-count":57,"title":["An algorithm for modular exponentiation"],"prefix":"10.1016","volume":"66","author":[{"given":"V.S.","family":"Dimitrov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.A.","family":"Jullien","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W.C.","family":"Miller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(98)00044-1_BIB1","article-title":"The computational complexity of algebraic and numeric problems","volume":"Vol. 1","author":"Borodin","year":"1974","journal-title":"Theory Comput. Ser."},{"key":"10.1016\/S0020-0190(98)00044-1_BIB2","series-title":"Advances in Cryptology\u2014Proceedings of Eurocrypt-92","first-page":"200","article-title":"Fast exponentiation with precomputation","volume":"Vol. 658","author":"Brickell","year":"1993"},{"issue":"1","key":"10.1016\/S0020-0190(98)00044-1_BIB3","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF00191319","article-title":"An interactive identification scheme based on discrete logarithms and factoring","volume":"5","author":"Brickell","year":"1992","journal-title":"J. Cryptology"},{"issue":"6","key":"10.1016\/S0020-0190(98)00044-1_BIB4","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1049\/el:19960345","article-title":"Hybrid method for modular exponentiation with precomputations","volume":"32","author":"Chen","year":"1996","journal-title":"Electron. Lett."},{"key":"10.1016\/S0020-0190(98)00044-1_BIB5","doi-asserted-by":"crossref","unstructured":"P. de Rooij, Efficient exponentiation using precomputations and vector addition chains, in: Proceedings Eurocrypt-94, pp. 403\u2013415.","DOI":"10.1007\/BFb0053453"},{"key":"10.1016\/S0020-0190(98)00044-1_BIB6","article-title":"Algorithms for Diophantine Equations","volume":"Vol. 65","author":"de Weger","year":"1989"},{"issue":"1","key":"10.1016\/S0020-0190(98)00044-1_BIB7","first-page":"82","article-title":"Two algorithms for modular exponentiation using nonstandard arithmetics","volume":"E78-A","author":"Dimitrov","year":"1995","journal-title":"IEICE Trans. Fundam."},{"issue":"4","key":"10.1016\/S0020-0190(98)00044-1_BIB8","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","article-title":"A public key cryptosystem and a signature scheme based on discrete logarithms","volume":"IT-31","author":"ElGamal","year":"1985","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0020-0190(98)00044-1_BIB9","series-title":"Ramanujan","author":"Hardy","year":"1940"},{"key":"10.1016\/S0020-0190(98)00044-1_BIB10","article-title":"Seminumerical Algorithms","volume":"Vol. 2","author":"Knuth","year":"1981"},{"issue":"4","key":"10.1016\/S0020-0190(98)00044-1_BIB11","first-page":"337","article-title":"A survey on modern integer factorizing algorithms","volume":"7","author":"Montgomery","year":"1994","journal-title":"CWI Quarterly"},{"issue":"3","key":"10.1016\/S0020-0190(98)00044-1_BIB12","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF00196725","article-title":"Efficient signature generation by smart cards","volume":"4","author":"Shnorr","year":"1991","journal-title":"J. Cryptology"},{"key":"10.1016\/S0020-0190(98)00044-1_BIB13","first-page":"159","article-title":"On the maximal distance between integers composed of small primes","volume":"28","author":"Tijdeman","year":"1974","journal-title":"Compositio Math."},{"key":"10.1016\/S0020-0190(98)00044-1_BIB14","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0020-0190(92)90259-X","article-title":"Processor-efficient exponentiation in finite fields","volume":"41","author":"von zur Gathen","year":"1992","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000441?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000441?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,9]],"date-time":"2021-05-09T18:17:45Z","timestamp":1620584265000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098000441"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,5]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,5]]}},"alternative-id":["S0020019098000441"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00044-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,5]]}}}