{"title":"伪随机发生器的空间下界","authors":"Xiangdong Yu, M. Yung","doi":"10.1109/SCT.1994.315805","DOIUrl":null,"url":null,"abstract":"Pseudorandom generation is a fundamental notion with many applications such as cryptography and deterministic simulation of random computation. A strong pseudorandom generator w.r.t. a tester class C is one that will \"fool\" any Turing-test in C to \"believe\" its output is truly random. We establish the first lower-bounds on the space complexity of general pseudorandom generators (namely, generators with no restrictions on their access to the input seed) which are strong w.r.t the typical time-/space-bounded classes of testers.<<ETX>>","PeriodicalId":386782,"journal":{"name":"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory","volume":"28 3","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Space lower-bounds for pseudorandom-generators\",\"authors\":\"Xiangdong Yu, M. Yung\",\"doi\":\"10.1109/SCT.1994.315805\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Pseudorandom generation is a fundamental notion with many applications such as cryptography and deterministic simulation of random computation. A strong pseudorandom generator w.r.t. a tester class C is one that will \\\"fool\\\" any Turing-test in C to \\\"believe\\\" its output is truly random. We establish the first lower-bounds on the space complexity of general pseudorandom generators (namely, generators with no restrictions on their access to the input seed) which are strong w.r.t the typical time-/space-bounded classes of testers.<<ETX>>\",\"PeriodicalId\":386782,\"journal\":{\"name\":\"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory\",\"volume\":\"28 3\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-06-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCT.1994.315805\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCT.1994.315805","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Pseudorandom generation is a fundamental notion with many applications such as cryptography and deterministic simulation of random computation. A strong pseudorandom generator w.r.t. a tester class C is one that will "fool" any Turing-test in C to "believe" its output is truly random. We establish the first lower-bounds on the space complexity of general pseudorandom generators (namely, generators with no restrictions on their access to the input seed) which are strong w.r.t the typical time-/space-bounded classes of testers.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
