{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:52:06Z","timestamp":1764996726520},"reference-count":28,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7168,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1993,12]]},"DOI":"10.1016\/0022-0000(93)90038-x","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"376-404","source":"Crossref","is-referenced-by-count":45,"title":["The discrete logarithm modulo a composite hides 0(n) Bits"],"prefix":"10.1016","volume":"47","author":[{"given":"J.","family":"H\u00e5stad","sequence":"first","affiliation":[]},{"given":"A.W.","family":"Schrift","sequence":"additional","affiliation":[]},{"given":"A.","family":"Shamir","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(93)90038-X_BIB1","series-title":"Proceedings, 25th FOCS","first-page":"449","article-title":"RSA\/Rabin bits are 1\/2 + 1\/poly(log N) secure","author":"Alexi","year":"1984"},{"key":"10.1016\/0022-0000(93)90038-X_BIB2","article-title":"Discrete Logarithms and Factoring","author":"Bach","year":"1984"},{"key":"10.1016\/0022-0000(93)90038-X_BIB3","series-title":"Proceedings, 15th STOC","first-page":"184","article-title":"How to generate random integers with known factorization","author":"Bach","year":"1983"},{"issue":"No. 2","key":"10.1016\/0022-0000(93)90038-X_BIB4","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1137\/0215025","article-title":"A simple secure pseudo-random number generator","volume":"15","author":"Blum","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(93)90038-X_BIB5","doi-asserted-by":"crossref","unstructured":"M. Blum and S. Goldwasser, An efficient probabilistic public key encryption scheme which hides all partial information, in \u201cProceedings, CRYPTO 84,\u201d pp. 289\u2013302.","DOI":"10.1007\/3-540-39568-7_23"},{"issue":"No. 4","key":"10.1016\/0022-0000(93)90038-X_BIB6","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1137\/0213053","article-title":"How to generate cryptographically strong sequences of pseudorandom bits","volume":"13","author":"Blum","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(93)90038-X_BIB7","unstructured":"R.B. Boppana and R. Hirschfeld, Pseudorandom generators and complexity classes, in \u201cAdvances in Computer Research,\u201d Vol. 5 (S. Micali, Ed.) JAI Press, Greenwich, CT, to appear."},{"key":"10.1016\/0022-0000(93)90038-X_BIB8","series-title":"Two Issues in Public Key Cryptography: RSA Bit Security and a New Knapsack Type System","author":"Chor","year":"1986"},{"key":"10.1016\/0022-0000(93)90038-X_BIB9","series-title":"Proceedings, 29th FOCS","first-page":"12","article-title":"On the existence of pseudorandom generators","author":"Goldreich","year":"1988"},{"key":"10.1016\/0022-0000(93)90038-X_BIB10","series-title":"Proceedings, 21st STOC","first-page":"25","article-title":"A hard-core predicate for all one-way functions","author":"Goldreich","year":"1989"},{"key":"10.1016\/0022-0000(93)90038-X_BIB11","series-title":"Proceedings, 18th STOC","first-page":"316","article-title":"Almost all primes can be quickly certified","author":"Goldwasser","year":"1986"},{"key":"10.1016\/0022-0000(93)90038-X_BIB12","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","article-title":"Probabilistic Encryption","volume":"28","author":"Goldwasser","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(93)90038-X_BIB13","series-title":"Proceedings, 22nd STOC","first-page":"395","article-title":"Pseudo-random generators under uniform assumptions","author":"H\u00e5stad","year":"1990"},{"issue":"2","key":"10.1016\/0022-0000(93)90038-X_BIB14","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1112\/jlms\/s2-18.1.7","article-title":"The difference between consecutive primes","volume":"18","author":"Heath-Brown","year":"1978","journal-title":"J. London Math Soc."},{"key":"10.1016\/0022-0000(93)90038-X_BIB15","series-title":"Proceedings, 20th STOC","first-page":"12","article-title":"Pseudo-random generation from one-way functions","author":"Impagliazzo","year":"1988"},{"key":"10.1016\/0022-0000(93)90038-X_BIB16","series-title":"Proceedings, 30th FOCS","first-page":"236","article-title":"Efficient cryptographic schemes provably as secure as subset sum","author":"Impagliazzo","year":"1989"},{"key":"10.1016\/0022-0000(93)90038-X_BIB17","series-title":"Proceedings, 30th FOCS","first-page":"248","article-title":"How to recycle random bits","author":"Impagliazzo","year":"1989"},{"key":"10.1016\/0022-0000(93)90038-X_BIB18","series-title":"Proceedings, 30th FOCS","first-page":"474","article-title":"Minimum resource zero-knowledge proofs","author":"Kilian","year":"1989"},{"issue":"No. 2","key":"10.1016\/0022-0000(93)90038-X_BIB19_1","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1137\/0217021","article-title":"The discrete logarithm hides O(log n) bits","volume":"17","author":"Long","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(93)90038-X_BIB19_2","series-title":"Proceedings, 15th STOC","first-page":"413","article-title":"How discrete is the discrete log?","author":"Long","year":"1983"},{"key":"10.1016\/0022-0000(93)90038-X_BIB20","unstructured":"M. NAOR, Bit commitment using pseudo-randomness, presented in \u201cCRYPTO 89\u201d."},{"key":"10.1016\/0022-0000(93)90038-X_BIB21","article-title":"Digital Signature and Public Key Cryptosystems as Intractable as Factoring","author":"Rabin","year":"1979"},{"key":"10.1016\/0022-0000(93)90038-X_BIB22","doi-asserted-by":"crossref","unstructured":"R. L. Rivest and A. Shamir, Efficient factoring based on partial information, in \u201cProceedings, Eurocrypt 85,\u201d pp. 31\u201334.","DOI":"10.1007\/3-540-39805-8_3"},{"key":"10.1016\/0022-0000(93)90038-X_BIB23","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"},{"key":"10.1016\/0022-0000(93)90038-X_BIB24","unstructured":"A. W. Schrift and A. Shamir, On the universality of the next bit test, presented in \u201cCrypto 90\u201d."},{"key":"10.1016\/0022-0000(93)90038-X_BIB25","series-title":"Proceedings, 22nd STOC","first-page":"405","article-title":"The discrete log is very discreet","author":"Schrift","year":"1990"},{"key":"10.1016\/0022-0000(93)90038-X_BIB26","series-title":"Proceedings, 25th FOCS","first-page":"458","article-title":"Efficient and secure pseudo-random number generator","author":"Vazirani","year":"1984"},{"key":"10.1016\/0022-0000(93)90038-X_BIB27","series-title":"Proceedings, 23rd FOGS","first-page":"80","article-title":"Theory and applications of trapdoor functions","author":"Yao","year":"1982"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009390038X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009390038X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:58:20Z","timestamp":1550325500000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009390038X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["002200009390038X"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(93)90038-x","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}