{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:53Z","timestamp":1760202533350},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540494751"},{"type":"electronic","value":"9783540494768"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11935230_13","type":"book-chapter","created":{"date-parts":[[2006,11,15]],"date-time":"2006-11-15T20:01:38Z","timestamp":1163620898000},"page":"194-209","source":"Crossref","is-referenced-by-count":23,"title":["On the Provable Security of an Efficient RSA-Based Pseudorandom Generator"],"prefix":"10.1007","author":[{"given":"Ron","family":"Steinfeld","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josef","family":"Pieprzyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huaxiong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"13_CR1","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1137\/0217013","volume":"17","author":"W. Alexi","year":"1988","unstructured":"Alexi, W., Chor, B., Goldreich, O., Schnorr, C.P.: RSA and Rabin Functions: Certain Parts Are as Hard as the Whole. SIAM Journal on Computing\u00a017(2), 194\u2013209 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"13_CR2","first-page":"421","volume-title":"Proc. 15-th STOC","author":"M. Ben-Or","year":"1983","unstructured":"Ben-Or, M., Chor, B., Shamir, A.: On the Cryptographic Security of Single RSA Bits. In: Proc. 15-th STOC, pp. 421\u2013430. ACM Press, New York (1983)"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/11761679_8","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"C. Berbain","year":"2006","unstructured":"Berbain, C., Gilbert, H., Patarin, J.: QUAD: a Practical Stream Cipher with Provable Security. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 109\u2013128. Springer, Heidelberg (2006)"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Blackburn, S.R., Gomez-Perez, D., Gutierrez, J., Shparlinski, I.E.: Reconstructing Noisy Polynomial Evaluation in Residue Rings. Journal of Algorithms (to appear)","DOI":"10.1016\/j.jalgor.2004.07.002"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"1471","DOI":"10.1090\/S0025-5718-04-01698-9","volume":"74","author":"S.R. Blackburn","year":"2004","unstructured":"Blackburn, S.R., Gomez-Perez, D., Gutierrez, J., Shparlinski, I.E.: Predicting Nonlinear Pseudorandom Number Generators. Mathematics of Computation\u00a074, 1471\u20131494 (2004)","journal-title":"Mathematics of Computation"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0215025","volume":"15","author":"L. Blum","year":"1986","unstructured":"Blum, L., Blum, M., Shub, M.: A Simple Unpredictable Pseudo-Random Number Generator. SIAM Journal on Computing\u00a015, 364\u2013383 (1986)","journal-title":"SIAM Journal on Computing"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"Blum, M., Micali, S.: How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. SIAM Journal on Computing\u00a013, 850\u2013864 (1984)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"13_CR8","doi-asserted-by":"publisher","first-page":"1339","DOI":"10.1109\/18.850673","volume":"46","author":"D. Boneh","year":"2000","unstructured":"Boneh, D., Durfee, G.: Cryptanalysis of RSA with private key d less than N\n                  0.292. IEEE Trans. on Info. Theory\u00a046(4), 1339\u20131349 (2000)","journal-title":"IEEE Trans. on Info. Theory"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-45682-1_3","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"D. Boneh","year":"2001","unstructured":"Boneh, D., Halevi, S., Howgrave-Graham, N.A.: The Modular Inversion Hidden Number Problem. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 36\u201351. Springer, Heidelberg (2001)"},{"key":"13_CR10","volume-title":"Proc. CCS 2001","author":"D. Catalano","year":"2001","unstructured":"Catalano, D., Gennaro, R., Howgrave-Graham, N., Nguyen, P.: Paillier\u2019s Cryptosystem Revisited. In: Proc. CCS 2001, November 2001, ACM, New York (2001)"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s001459900030","volume":"10","author":"D. Coppersmith","year":"1997","unstructured":"Coppersmith, D.: Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities. J. of Cryptology\u00a010, 233\u2013260 (1997)","journal-title":"J. of Cryptology"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/3-540-44670-2_3","volume-title":"Cryptography and Lattices","author":"D. Coppersmith","year":"2001","unstructured":"Coppersmith, D.: Finding Small Solutions to Low Degree Polynomials. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol.\u00a02146, pp. 20\u201331. Springer, Heidelberg (2001)"},{"key":"13_CR13","unstructured":"Dai, W.: Crypto++ 5.2.1 Benchmarks (2006), \n                    \n                      http:\/\/www.eskimo.com\/~weidai\/benchmarks.html"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s001459910008","volume":"13","author":"R. Fischlin","year":"2000","unstructured":"Fischlin, R., Schnorr, C.P.: Stronger Security Proofs for RSA and Rabin Bits. Journal of Cryptology\u00a013, 221\u2013244 (2000)","journal-title":"Journal of Cryptology"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00145-004-0215-y","volume":"18","author":"R. Gennaro","year":"2005","unstructured":"Gennaro, R.: An Improved Pseudo-Random Generator Based on the Discrete-Logarithm Problem. Journal of Cryptology\u00a018, 91\u2013110 (2005)","journal-title":"Journal of Cryptology"},{"key":"13_CR16","volume-title":"Foundations of Cryptography","author":"O. Goldreich","year":"2003","unstructured":"Goldreich, O.: Foundations of Cryptography, vol.\u00a0I. Cambridge University Press, Cambridge (2003)"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s00145-002-0038-7","volume":"16","author":"O. Goldreich","year":"2003","unstructured":"Goldreich, O., Rosen, V.: On the Security of Modular Exponentiation with Application to the Construction of Pseudorandom Generators. J. of Cryptology\u00a016, 71\u201393 (2003)","journal-title":"J. of Cryptology"},{"issue":"2","key":"13_CR18","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic Encryption. J. of Computer and System Sciences\u00a028(2), 270\u2013299 (1984)","journal-title":"J. of Computer and System Sciences"},{"key":"13_CR19","first-page":"134","volume-title":"Proc. FOCS 1982","author":"S. Goldwasser","year":"1982","unstructured":"Goldwasser, S., Micali, S., Tong, P.: Why and How to Establish a Private Code on a Public Network. In: Proc. FOCS 1982, pp. 134\u2013144. IEEE Computer Society Press, Los Alamitos (1982)"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BFb0024458","volume-title":"Cryptography and Coding","author":"N. Howgrave-Graham","year":"1997","unstructured":"Howgrave-Graham, N.: Finding Small Roots of Univariate Polynomials Revisited. In: Darnell, M.J. (ed.) Cryptography and Coding 1997. LNCS, vol.\u00a01355, pp. 131\u2013142. Springer, Heidelberg (1997)"},{"key":"13_CR21","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s001459900012","volume":"9","author":"R. Impagliazzo","year":"1996","unstructured":"Impagliazzo, R., Naor, M.: Efficient Cryptographic Schemes Provably as Secure as Subset Sum. Journal of Cryptology\u00a09, 199\u2013216 (1996)","journal-title":"Journal of Cryptology"},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring Polynomials with Rational Coefficients. Mathematische Annalen\u00a0261, 515\u2013534 (1982)","journal-title":"Mathematische Annalen"},{"key":"13_CR23","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s00145-001-0009-4","volume":"14","author":"A.K. Lenstra","year":"2001","unstructured":"Lenstra, A.K., Verheul, E.R.: Selecting Cryptographic Key Sizes. J. of Cryptology\u00a014, 255\u2013293 (2001)","journal-title":"J. of Cryptology"},{"key":"13_CR24","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00196909","volume":"3","author":"S. Micali","year":"1991","unstructured":"Micali, S., Schnorr, C.P.: Efficient, Perfect Polynomial Random Number Generators. J. of Cryptology\u00a03, 157\u2013172 (1991)","journal-title":"J. of Cryptology"},{"key":"13_CR25","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s00145-002-0021-3","volume":"15","author":"P.Q. Nguyen","year":"2002","unstructured":"Nguyen, P.Q., Shparlinski, I.E.: The insecurity of the digital signature algorithm with partially known nonces. J. Cryptology\u00a015, 151\u2013176 (2002)","journal-title":"J. Cryptology"},{"key":"13_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/3-540-44670-2_12","volume-title":"Cryptography and Lattices","author":"P.Q. Nguyen","year":"2001","unstructured":"Nguyen, P.Q., Stern, J.: The Two Faces of Lattices in Cryptology. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol.\u00a02146, pp. 146\u2013180. Springer, Heidelberg (2001)"},{"key":"13_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1007\/BFb0055737","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"S. Patel","year":"1998","unstructured":"Patel, S., Sundaram, G.: An Efficient Discrete Log Pseudo Random Generator. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 304\u2013317. Springer, Heidelberg (1998)"},{"key":"13_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/11586821_24","volume-title":"Cryptography and Coding","author":"A. Sidorenko","year":"2005","unstructured":"Sidorenko, A., Schoenmakers, B.: Concrete Security of the Blum-Blum-Shub Pseudorandom Generator. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol.\u00a03796, pp. 355\u2013375. Springer, Heidelberg (2005)"},{"key":"13_CR29","unstructured":"Steinfeld, R., Pieprzyk, J., Wang, H.: On the Provable Security of an Efficient RSA-Based Pseudorandom Generator. Cryptology ePrint Archive, Report 2006\/206 (2006), \n                    \n                      http:\/\/eprint.iacr.org\/2006\/206"},{"key":"13_CR30","first-page":"458","volume-title":"Proc. FOCS 1984","author":"U.V. Vazirani","year":"1982","unstructured":"Vazirani, U.V., Vazirani, V.V.: Efficient and Secure Pseudo-Random Number Generation. In: Proc. FOCS 1984, pp. 458\u2013463. IEEE Computer Society Press, Los Alamitos (1982)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11935230_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:48:19Z","timestamp":1619509699000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11935230_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540494751","9783540494768"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/11935230_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}