How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
Combinatorics, complexity, and randomness
Communications of the ACM
An efficient probabilistic public key encryption scheme which hides all partial information
Proceedings of CRYPTO 84 on Advances in cryptology
Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Random instances of a graph coloring problem are hard
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A hard-core predicate for all one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
An introduction to Kolmogorov complexity and its applications
An introduction to Kolmogorov complexity and its applications
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
A Machine-Independent Theory of the Complexity of Recursive Functions
Journal of the ACM (JACM)
Journal of the ACM (JACM)
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
| Hi-index | 0.00 |