{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:24:08Z","timestamp":1725488648185},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540564133"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-47555-9_33","type":"book-chapter","created":{"date-parts":[[2007,8,8]],"date-time":"2007-08-08T19:23:49Z","timestamp":1186601029000},"page":"408-419","source":"Crossref","is-referenced-by-count":0,"title":["Local Randomness in Candidate One-Way Functions"],"prefix":"10.1007","author":[{"given":"H.","family":"Niederreiter","sequence":"first","affiliation":[]},{"given":"C. P.","family":"Schnorr","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"33_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. and Schnorr, C.P.: RSA and Rabin Functions: certain parts are as hard as the whole. SIAM J. Comput., 17,2 (1988), pp. 194\u2013208.","journal-title":"SIAM J. Comput."},{"key":"33_CR2","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/0196-6774(86)90019-2","volume":"7","author":"N. Alon","year":"1986","unstructured":"Alon, N., Babai, L. and Itai, A.: A fast and simple randomised parallel algorithm for the maximal independent set problem. J. of Alg. 7 (1986), pp. 567\u2013583.","journal-title":"J. of Alg."},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Alon, N., Goldreich, O., Hastad, J. and Peralta, R.: Simple constructions of almost k-wise independent random variables. Proceedings of the 31st IEEE Symposium on Foundations of Computer Science (1990) pp. 544\u2013552.","DOI":"10.1109\/FSCS.1990.89575"},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0215025","volume":"15","author":"L. Blum","year":"1986","unstructured":"Blum, L, Blum, M., and Shub, M.: A simple unpredictable pseudo-random number generator. SIAM J. Comput. 15 (1986), pp. 364\u2013383.","journal-title":"SIAM J. Comput."},{"key":"33_CR5","volume-title":"Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science","author":"M. Blum","year":"1982","unstructured":"Blum, M. and Micali, S.: How to generate cryptographically strong sequences of pseudo-random bits. Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, IEEE, New York (1982); also SIAM J. Comput. 13 (1984), pp. 850\u2013864."},{"key":"33_CR6","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1215\/S0012-7094-57-02406-7","volume":"24","author":"L. Carlitz","year":"1957","unstructured":"Carlitz, L. and Uchiyama, S.: Bounds for exponential sum. Duke Math. J. 24, (1957), pp. 37\u201341.","journal-title":"Duke Math. J."},{"key":"33_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"L. Carter","year":"1979","unstructured":"Carter, L. and Wegman, M.: Universal hash functions. J. Comp. and Syst. Sci. 18, (1979) pp. 143\u2013154.","journal-title":"J. Comp. and Syst. Sci."},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Goldwasser, S. and Micali, S.: How to Construct Random Functions. Proceedings of the 25th IEEE Symposium on Foundations of Computer Science, New York (1984); also Journal ACM 33, 4 (1986), pp. 792\u2013807.","DOI":"10.1145\/6490.6503"},{"key":"33_CR9","volume-title":"Finite Fields","author":"R. Lidl","year":"1983","unstructured":"Lidl, R. and Niederreiter, H.: Finite Fields. Reading: Addison-Wesley 1983."},{"key":"33_CR10","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1137\/0215074","volume":"15","author":"M. Luby","year":"1986","unstructured":"Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput., 15 (1986), pp. 1036\u20131053.","journal-title":"SIAM J. Comput."},{"key":"33_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/0-387-34805-0_11","volume-title":"Proceedings Crypto\u2019 89","author":"U. M. Maurer","year":"1990","unstructured":"Maurer, U. M., and Massey, J.L.: Perfect local randomness in pseudo-random sequences. Proceedings Crypto\u2019 89, Lecture Notes in Computer Science, Vol. 435, Springer-Verlag 1990, pp. 100\u2013112."},{"key":"33_CR12","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00196909","volume":"3","author":"S. Micali","year":"1991","unstructured":"Micali, S. and Schnorr, C.P.: Efficient, perfect polynomial random number generators. J. of Cryptology 3, (1991), pp. 157\u2013172.","journal-title":"J. of Cryptology"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Naor, J. and Naor, M: Small-bias Probability Spaces: Efficient Constructions and Applications. Proceedings of the 22nd ACM Symposium on Theory of Computing (1990), pp. 213\u2013223.","DOI":"10.1145\/100216.100244"},{"key":"33_CR14","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0001-8708(77)90028-7","volume":"26","author":"H. Niederreiter","year":"1977","unstructured":"Niederreiter, H.: Pseudo-random numbers and optimal coefficients. Advances in Math. 26, (1977) pp. 99\u2013181.","journal-title":"Advances in Math."},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"Nisan, N.: Pseudorandom generators for space-bounded computation. Proceedings of the 22nd ACM Symposium on Theory of Computing (1990), pp. 204\u2013208.","DOI":"10.1145\/100216.100242"},{"key":"33_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/3-540-45961-8_19","volume-title":"Proc. EUROCRYPT\u2019 88","author":"C.P. Schnorr","year":"1988","unstructured":"Schnorr, C.P.: On the construction of random number generators and random function generators. Proc. EUROCRYPT\u2019 88, Lecture Notes in Computer Science, Vol. 330, Springer-Verlag 1988, pp. 225\u2013232."},{"key":"33_CR17","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1073\/pnas.34.5.204","volume":"34","author":"A. Wil","year":"1948","unstructured":"Wil, A.: On some exponential sums. Proc. Nat. Acad. Sci. USA 34, (1948), pp. 204\u2013207.","journal-title":"Proc. Nat. Acad. Sci. USA"},{"key":"33_CR18","first-page":"80","volume-title":"Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science","author":"A.C. Yao","year":"1982","unstructured":"Yao, A.C.: Theory and applications of trapdoor functions. Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, IEEE, New York (1982), pp. 80\u201391."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT\u2019 92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47555-9_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:14:00Z","timestamp":1605629640000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47555-9_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540564133"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-47555-9_33","relation":{},"subject":[]}}