A. W. Schrift
A. Shamir
- {ACGS} Alexi, W., Chor, B., Goldreich, O., Schnorr, C.P., "RSA/Rabin bits are 1/2+1/poly(log N) secure", Proc. 25th FOCS, 1984, pp. 449- 457.Google Scholar
- {Ba} Bach, E., "Discrete Logarithms and Factoring", Report No. UCB/CSD 84/186, Univ. of California, 1984. Google ScholarDigital Library
- {BBS} Blum, L., Blum, M., Shub, M., "A Simple Secure Pseudo-Random Number Generator", SIAM J. on Computing, Vol. 15, No. 2, 1986, pp. 364-383. Google ScholarDigital Library
- {BG} Blum, M., Goldwasser, S., "An Efficient Probabilistic Public Key Encryption Scheme which Hides All Partial Information", Proc. CRYPTO 84, pp. 289-302. Google ScholarDigital Library
- {BM} Blum, M., Micali, S., "How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits", SIAM J. Computing, Vol. 13, No. 4, 1984, pp. 850-864. Google ScholarDigital Library
- {Ch} Chor, B., Two Issues in Public Key Cryptography: RSA Bit Security and a New Knapsack Type System, MIT Press, 1986. Google ScholarDigital Library
- {GKL} Goldreich, O., Krawczyk, H., Luby, M., "On the Existence of Pseudorandom Generators", Proc. 29th FOCS, 1988, pp. 12-24.Google Scholar
- {GL} Goldreich, O., Levin, L.A., "A Hard-Core Predicate for all One-Way Functions, Proc. 21st STOC, 1989, pp. 25-32. Google ScholarDigital Library
- {GM} Goldwasser, S., Micali, S., "Probabilistic Encryption", JCSS, Vol. 28, 1984, pp. 270- 299.Google ScholarCross Ref
- {Ha} Hastad, J., private communication.Google Scholar
- {ILL} Impagliazzo, R., Levin, L.A., Luby, M., "Pseudo-Random Generation from One-Way Functions", Proc. 20th STOC, 1988, pp. 12-24. Google ScholarDigital Library
- {IN} Impagliazzo, R., Naor, M., "Efficient Cryptographic Schemes Provably as Secure as Subset Sum", Proc. 30th FOCS, 1989, pp. 236-241.Google Scholar
- {IZ} Impagliazzo, R., Zuckerman, D., "How to Recycle Random Bits", Proc. 30th FOCS, 1989, pp. 248-254.Google Scholar
- {KMO} Kilian, J., Micali, S., Ostrovsky, R., "Minimum Resource Zero-Knowledge Proofs", Proc. 30th FOCS, 1989, pp. 474-479.Google Scholar
- {LW} Long, D.L., Wigderson, A., "The Discrete Logarithm Hides O(log n) Bits", SIAM J. Computing, Vol. 17, No. 2, 1988, pp. 363- 372. Also: "How discreet is the Discrete Log?" Proc. 15th STOC, 1983, pp. 413-420. Google ScholarDigital Library
- {Na} Naor, M., "Bit Commitment Using Pseudo-Randomness", Proc. Crypto 89. Google ScholarDigital Library
- {Ra} Rabin, M.O., "Digital Signature and Public Key Cryptosystems as Intractable as Factoring", Technical Report, MIT LCS TR-212, 1979. Google ScholarDigital Library
- {RS} Rivest, R.L., Shamir, A., "Efficient Factoring Based on Partial Information", Proc. Eurocrypt 85, pp. 31-34. Google ScholarDigital Library
- {RSA} Rivest, R.L., Shamir, A., Adleman, L., "A Method for Obtaining Digital Signatures and Public Key Cryptosystems", Comm. ACM 21:120-126, 1978. Google ScholarDigital Library
- {SS} Schrift, A.W., Shamir. A. "On the Universality of the Next Bit Test", unpublished manuscript, 1989.Google Scholar
- {VV} Vazirani, U.V., Vazirani, V.V., "Efficient and Secure Pseudo-Random Number Generator", Proc. 25th FOCS, 1984, pp. 458-463.Google Scholar
- {Y} Yao, A.C., "Theory and Applications of Trapdoor Functions", Proc. 23rd FOCS, 1982, pp. 80-91.Google Scholar
Index Terms
- The discrete log is very discreet
Comments