{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:19:23Z","timestamp":1725488363253},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540629757"},{"type":"electronic","value":"9783540690535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-69053-0_19","type":"book-chapter","created":{"date-parts":[[2007,8,5]],"date-time":"2007-08-05T21:24:05Z","timestamp":1186349045000},"page":"267-279","source":"Crossref","is-referenced-by-count":14,"title":["Stronger Security Proofs for RSA and Rabin Bits"],"prefix":"10.1007","author":[{"given":"R.","family":"Fischlin","sequence":"first","affiliation":[]},{"given":"C. P.","family":"Schnorr","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1137\/0217013","volume":"17","author":"W. Alexi","year":"1988","unstructured":"W. Alexi, B. Chor, O. Goldreich and C.P. Schnorr: RSA and Rabin Functions: certain parts are as hard as the whole. Siam J. Comp. 17 (1988), pp. 194\u2013209.","journal-title":"Siam J. Comp."},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, B. Chor and A. Shamir: On the Cryptographic Security of Single RSA-Bits. Proc. 15th ACM Symp. on Theory of Computation, April 1983, pp. 421\u2013430.","DOI":"10.1145\/800061.808773"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0215025","volume":"15","author":"L. Blum","year":"1986","unstructured":"L. Blum, M. Blum and M. Shub: A Simple Unpredictible Pseudo-Random Number Generator. Siam J. Comp. 15 (1986), pp. 364\u2013383.","journal-title":"Siam J. Comp."},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"J.P. Buhler, H.W. Lenstra, Jr. and C. Pomerance: Factoring Integers with the Number Field Sieve. in: The Development of the number field sieve, (Ed. A.K. Lenstra, H.W. Lenstra, Jr.) Springer LNM 1554 (1993), pp. 50\u201394.","DOI":"10.1007\/BFb0091539"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"M. Blum and S. Micali: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits. Siam J. Comp., 13 (1984), pp. 850\u2013864.","journal-title":"Siam J. Comp."},{"key":"19_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/3-540-68339-9_22","volume-title":"Proc. EUROCRYPT\u201996","author":"J.B. Fischer","year":"1996","unstructured":"J.B. Fischer and J. Stern: An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding. Proc. EUROCRYPT\u201996, Springer LNCS 1070 (1996) pp. 245\u2013255."},{"key":"19_CR7","unstructured":"O. Goldreich: personal information at the Oberwolfach workshop on Complexity Theory, November 10\u201316, 1996."},{"key":"19_CR8","unstructured":"O. Goldreich and L.A. Levin: Hard Core Bit for any One Way Function. Proc. of ACM Symp. on Theory of Computing (1989) pp. 25\u201332."},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali and P. Tong: Why and How to Establish a Private Code on a Public Network. Proc. 23rd IEEE Symp. on Foundations of Computer Science, Nov. 1982, pp. 134\u2013144.","DOI":"10.1109\/SFCS.1982.100"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/0022-0000(93)90038-X","volume":"47","author":"J. H\u00e5stad","year":"1993","unstructured":"J. H\u00e5stad, A.W. Schrift and A. Shamir: The Discrete Logarithm Modulo a Composite Hides O(n) bits. J. of Computing and Systems Science 47 (1993), pp. 376\u2013404.","journal-title":"J. of Computing and Systems Science"},{"key":"19_CR11","volume-title":"Seminumerical Algorithms","author":"D.E. Knuth","year":"1997","unstructured":"D.E. Knuth: Seminumerical Algorithms, 3rd edn. Addison-Wesley, Reading, MA (1997). Also Amendments to Volume 2. January 1997. http:\/\/www-cs-staff.Stanford.EDU\/~uno\/taocp.html","edition":"3rd edn."},{"key":"19_CR12","first-page":"1102","volume":"58","author":"L.A. Levin","year":"1993","unstructured":"L.A. Levin: Randomness and Nondeterminism. J. Symbolic Logic 58 (1993), pp. 1102\u20131103.","journal-title":"J. Symbolic Logic"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00196909","volume":"3","author":"S. Micali","year":"1991","unstructured":"S. Micali and C.P. Schnorr: Efficient, Perfect Polynomial Random Number Generators. J. Cryptology 3 (1991), pp. 157\u2013172.","journal-title":"J. Cryptology"},{"key":"19_CR14","first-page":"5","volume":"1","author":"A.M. Odlyzko","year":"1995","unstructured":"A.M. Odlyzko: The Future of Integer Factorization. CryptoBytes, RSA Laboratories, 1 (1995), pp. 5\u201312.","journal-title":"CryptoBytes"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"R. Peralta: On the Distribution of Quadratic Residues and Non-residues Modulo a Prime Number. Math. Comp., 58","DOI":"10.2307\/2153045"},{"key":"19_CR16","unstructured":"M.O. Rabin: Digital signatures and public key functions as intractable as factorization. TM-212, Laboratory of Computer Science, MIT, 1979."},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"R.L. Rivest. A. Shamir and L. Adleman: A Method for Obtaining Digital Signatures and Public Key Cryptosystems. Comm. ACM, 21 (1978), pp. 120\u2013126.","journal-title":"Comm. ACM"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"U.V. Vazirani and V.V. Vazirani: Efficient and Secure Pseudo-Random Number Generation. In Proc. 25th Symp. on Foundations of Computing Science (1984) IEEE, pp. 458\u2013463.","DOI":"10.1109\/SFCS.1984.715948"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"A.C. Yao: Theory and Application of Trapdoor Functions. Proc. of IEEE Symp. on Foundations of Computer Science (1982), pp. 80\u201391.","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201997"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-69053-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T15:32:15Z","timestamp":1556724735000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-69053-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540629757","9783540690535"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-69053-0_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1997]]}}}