The Tale of One-Way Functions
暂无分享,去创建一个
[1] Yuri Gurevich,et al. The challenger-Solver Game: variations on the Theme of P=NP , 2017, Current Trends in Theoretical Computer Science.
[2] Peter W. Shor,et al. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..
[3] P. Kidwell,et al. The universal turing machine: a half-century survey , 1996, IEEE Annals of the History of Computing.
[4] David Thomas,et al. The Art in Computer Programming , 2001 .
[5] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.
[6] Leonid A. Levin,et al. Randomness Conservation Inequalities; Information and Independence in Mathematical Theories , 1984, Inf. Control..
[7] A. Kolmogorov,et al. ALGORITHMS AND RANDOMNESS , 1988 .
[8] Leonid A. Levin,et al. A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..
[9] Moni Naor,et al. Universal one-way hash functions and their cryptographic applications , 1989, STOC '89.
[10] Leonid A. Levin,et al. One-way functions and pseudorandom generators , 1985, STOC '85.
[11] Rolf Herken,et al. The Universal Turing Machine: A Half-Century Survey , 1992 .
[12] Adi Shamir,et al. Factoring Numbers in O(log n) Arithmetic Steps , 1979, Inf. Process. Lett..
[13] Charles H. Bennett. Logical depth and physical complexity , 1988 .
[14] Gary L. Miller,et al. Riemann's Hypothesis and tests for primality , 1975, STOC.
[15] David S. Johnson,et al. The NP-completeness column , 2005, TALG.
[16] Yuri Gurevich. Complete and incomplete randomized NP problems , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[17] 今井 浩. 20世紀の名著名論:Peter Shor : Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 2004 .
[18] Ramarathnam Venkatesan,et al. Average case intractability of matrix and diophantine problems (extended abstract) , 1992, STOC '92.
[19] A. Kolmogorov. Three approaches to the quantitative definition of information , 1968 .
[20] Silvio Micali,et al. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems , 1991, JACM.
[21] L. Levin,et al. THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS , 1970 .
[22] Leonid A. Levin,et al. Average Case Complete Problems , 1986, SIAM J. Comput..
[23] S. Banach,et al. Sur la décomposition des ensembles de points en parties respectivement congruentes , 1924 .
[24] Manuel Blum,et al. How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[25] Leonid A. Levin,et al. Random instances of a graph coloring problem are hard , 1988, STOC '88.
[26] Andrew Chi-Chih Yao,et al. Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[27] Jie Wang,et al. Average-case completeness of a word problem for groups , 1995, STOC '95.
[28] Leonid A. Levin,et al. Security preserving amplification of hardness , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[29] Whitfield Diffie,et al. New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.
[30] Ming Li,et al. An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.
[31] C. Greg Plaxton,et al. Conference Proceedings of the Annual ACM Symposium on Theory of Computing , 1992, STOC 1992.
[32] Donald E. Knuth,et al. The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .
[33] Leonid A. Levin,et al. A hard-core predicate for all one-way functions , 1989, STOC '89.
[34] Leonid A. Levin,et al. No better ways to generate hard NP instances than picking uniformly at random , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.