{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:27:58Z","timestamp":1778128078379,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540611868","type":"print"},{"value":"9783540683391","type":"electronic"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-68339-9_22","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T01:31:14Z","timestamp":1186363874000},"page":"245-255","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":64,"title":["An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding"],"prefix":"10.1007","author":[{"given":"Jean-Bernard","family":"Fischer","sequence":"first","affiliation":[]},{"given":"Jacques","family":"Stern","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"22_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 J. Computing 17 (1988) 194\u2013209.","journal-title":"SIAM J. Computing"},{"key":"22_CR2","unstructured":"Berlekamp, E. R., McEliece, R. J., van Tilborg, H. C. A.:. On the inherent intractability of certain coding problems. In IEEE Trans. Information Theory (1978) IEEE pp. 384\u2013386."},{"key":"22_CR3","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 unpredictible pseudo-random number generator. SIAM J. Computing 15 (1986) 364\u2013383.","journal-title":"SIAM J. Computing"},{"key":"22_CR4","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 J. Computing 13 (1984) 850\u2013863.","journal-title":"SIAM J. Computing"},{"key":"22_CR5","unstructured":"Canteaut, A., Chabaud, F.:. A general improvement of the previous attacks on McEliece\u2019s cryptosystem. Unpublished."},{"key":"22_CR6","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology: Proc. of EUROCRYPT\u201994","author":"F. Chabaud","year":"1994","unstructured":"Chabaud, F.:. On the security of some cryptosystems based on error-correcting codes. In Advances in Cryptology: Proc. of EUROCRYPT\u201994 (1994) LNCS Springer-Verlag."},{"key":"22_CR7","unstructured":"Garey, M. R., Johnson, D. S.:. Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman and Co 1979."},{"key":"22_CR8","unstructured":"Goldreich, O.:. Foundations of cryptography (Fragments of a book). Weizmann Institut of Science 1995."},{"key":"22_CR9","unstructured":"Goldreich, O., Krawczyk, H., Luby, M.:. On the existence of pseudo-random generators. In Proc. 29th Symp. on Foundations of Computing Science (1988) IEEE pp. 12\u201324."},{"key":"22_CR10","unstructured":"Goldreich, O., Levin, L. A.:. Hard core predicate for any one-way function. In Proc. 21st Symp. on Theory of Computing (1989) ACM press pp. 25\u201332."},{"key":"22_CR11","unstructured":"Guillot, P.:. Algorithmes pour le codage \u00e0 poids constant. Unpublished."},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/0022-0000(93)90038-X","volume":"47","author":"J. H\u00e5stad","year":"1993","unstructured":"H\u00e5stad, J., Schrift, A. W., Shamir, A.: The discrete logarithm modulo a composite hides o(n) bits. J. of Computing and Systems Science 47 (1993) 376\u2013404.","journal-title":"J. of Computing and Systems Science"},{"key":"22_CR13","unstructured":"Impaggliazzo, R., Naor, M.:. Efficient cryptographic schemes provably as secure as subset sum. In Proc. 30th Symp. on Foundations of Computing Science (1989) IEEE pp. 236\u2013241."},{"key":"22_CR14","unstructured":"Impagliazzo, R., Levin, L. A., Luby, M.:. Pseudo-random generation from any one-way functions. In Proc. 21st Symp. on Theory of Computing (1989) ACM press pp. 12\u201324."},{"key":"22_CR15","unstructured":"Levin, L. A.:. One-way functions and pseudo-random generators. In Proc. 21st Symp. on Theory of Computing (1985) ACM pp. 363\u2013365."},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1137\/0217021","volume":"17","author":"D. L. Long","year":"1988","unstructured":"Long, D. L., Wigderson, A.: The discrete log hides o(log n) bits. SIAM J. Computing 17 (1988) 363\u2013372.","journal-title":"SIAM J. Computing"},{"key":"22_CR17","unstructured":"McWilliams, F. J., Sloane, N. J. A.:. The theory of error-correcting codes. North-Holland 1977."},{"key":"22_CR18","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology, Proc. of CRYPTO\u201988","author":"S. Micali","year":"1988","unstructured":"Micali, S., Schnorr, C. P.:. Efficient, perfect random number generators. In Advances in Cryptology, Proc. of CRYPTO\u201988 (1988) vol. 576 of LNCS Springer Verlag."},{"key":"22_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1007\/BFb0019850","volume-title":"A method for finding codewords of small weight","author":"J. Stern","year":"1989","unstructured":"Stern, J.:. A method for finding codewords of small weight. In Lecture Notes in Computer Science, Coding Theory and Applications vol. 388. Springer 1989 pp. 106\u2013113."},{"key":"22_CR20","series-title":"Lect Notes Comput Sci","first-page":"13","volume-title":"Advances in Cryptology, Proc. of CRYPTO\u201993","author":"J. Stern","year":"1993","unstructured":"Stern, J.:. A new identification scheme based on syndrome decoding. In Advances in Cryptology, Proc. of CRYPTO\u201993 (1993) vol. 773 of LNCS Springer-Verlag pp. 13\u201321."},{"key":"22_CR21","unstructured":"Vazirani, U. V., Vazirani, V. V.:. Efficient and secure pseudo-random sequences from slightly-random sources. In Proc. 25th Symp. on Foundations of Computing Science (1984) IEEE pp. 458\u2013463."},{"key":"22_CR22","unstructured":"Yao, A. C.:. Theory and application of trapdoor functions. In Proc. 25th Symp. on Foundations of Computing Science (1982) IEEE pp. 80\u201391."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201996"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-68339-9_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:55:37Z","timestamp":1558274137000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-68339-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540611868","9783540683391"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-68339-9_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"13 July 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}