Pseudorandom Generators from Regular One-Way Functions: New Constructions with Improved Parameters
作者： Yu Yu , Xiangxue Li , Jian Weng
DOI: 10.1007/978-3-642-42045-0_14
关键词:
摘要: We revisit the problem of basing pseudorandom generators on regular one-way functions, and present following constructions:
springer.com
core.ac.uk
sci-hub.st 参考文章(28)
Oded Goldreich, Foundations of Cryptography: Basic Tools Cambridge University Press. ,(2000)
Boaz Barak, Ronen Shaltiel, Avi Wigderson, Computational Analogues of Entropy randomization and approximation techniques in computer science. pp. 200- 215 ,(2003) , 10.1007/978-3-540-45198-3_18
Thomas Holenstein, Pseudorandom Generators from One-Way Functions: A Simple Construction for Any Hardness Theory of Cryptography. pp. 443- 461 ,(2006) , 10.1007/11681878_23
Nenad Dedić, Danny Harnik, Leonid Reyzin, Saving private randomness in one-way functions and pseudorandom generators theory of cryptography conference. pp. 607- 625 ,(2008) , 10.1007/978-3-540-78524-8_33
Oded Goldreich, Foundations of Cryptography Cambridge University Press. ,(2001) , 10.1017/CBO9780511546891
Yevgeniy Dodis, Ariel Elbaz, Roberto Oliveira, Ran Raz, Improved Randomness Extraction from Two Independent Sources Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. ,vol. 3122, pp. 334- 344 ,(2004) , 10.1007/978-3-540-27821-4_30
Umesh V. Vazirani, Vijay V. Vazirani, Vijay V. Vazirani, Efficient and Secure Pseudo-Random Number Generation (Extended Abstract) foundations of computer science. pp. 458- 463 ,(1984)
Salil Vadhan, Colin Jia Zheng, A Uniform Min-Max Theorem with Applications in Cryptography international cryptology conference. ,vol. 2013, pp. 93- 110 ,(2013) , 10.1007/978-3-642-40041-4_6
N. Nisan, Pseudorandom generators for space-bounded computations symposium on the theory of computing. pp. 204- 212 ,(1990) , 10.1145/100216.100242