{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T05:12:13Z","timestamp":1649135533583},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1997,7,1]],"date-time":"1997-07-01T00:00:00Z","timestamp":867715200000},"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":[[1997,7]]},"DOI":"10.1016\/s0020-0190(97)00089-6","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:36:00Z","timestamp":1051130160000},"page":"19-21","source":"Crossref","is-referenced-by-count":3,"title":["A simple approach for generating RSA keys"],"prefix":"10.1016","volume":"63","author":[{"given":"Chin-Chen","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shin-Jia","family":"Hwang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)00089-6_BIB1","first-page":"4","article-title":"A Course in Computational Algebraic Number Theory","author":"Cohen","year":"1993"},{"issue":"1","key":"10.1016\/S0020-0190(97)00089-6_BIB2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1049\/el:19930013","article-title":"Generating RSA keys without the Euclid algorithm","volume":"29","author":"Derome","year":"1993","journal-title":"Electronics Lett."},{"issue":"12","key":"10.1016\/S0020-0190(97)00089-6_BIB3","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1049\/el:19840357","article-title":"Strong RSA keys","volume":"20","author":"Gordon","year":"1984","journal-title":"Electronics Lett."},{"key":"10.1016\/S0020-0190(97)00089-6_BIB4","series-title":"The Art of Computer Programming, Vol. 2: Seminumerical Algorithms","author":"Knuth","year":"1981"},{"issue":"20","key":"10.1016\/S0020-0190(97)00089-6_BIB5","doi-asserted-by":"crossref","first-page":"1807","DOI":"10.1049\/el:19911123","article-title":"Efficient method for generating strong primes with constraint of bit length","volume":"27","author":"Laih","year":"1991","journal-title":"Electronics Lett."},{"key":"10.1016\/S0020-0190(97)00089-6_BIB6","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/0022-314X(80)90084-0","article-title":"Probabilistic algorithm for testing primality","volume":"12","author":"Rabin","year":"1980","journal-title":"J. Number Theory"},{"issue":"2","key":"10.1016\/S0020-0190(97)00089-6_BIB7","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"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097000896?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097000896?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T16:54:10Z","timestamp":1556643250000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097000896"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,7]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,7]]}},"alternative-id":["S0020019097000896"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00089-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1997,7]]}}}