Cryptography Reference
In-Depth Information
[8]
Kelsey, J., B. Schneier, and N. Ferguson, “Yarrow-160: Notes on the Design and Analysis of
the Yarrow Cryptographic Pseudorandom Number Generator,”
Proceedings of the 6th Annual
Workshop on Selected Areas in Cryptography
, Springer-Verlag, August 1999.
[9]
Blum, M., and S. Micali, “How to Generate Cryptographically Strong Sequences of Pseudo-
Random Bits,”
SIAM Journal of Computing
, Vol. 13, No. 4, November 1984, pp. 850-863.
[10]
Blum, L., M. Blum, and M. Shub, “A Simple Unpredictable Pseudo-Random Number Generator,”
SIAM Journal of Computing
, Vol. 15, May 1986, pp. 364-383.
[11]
Alexi, W., et al., “RSA/Rabin Functions: Certain Parts Are as Hard as the Whole,”
SIAM Journal
of Computing
, Vol. 17, No. 2, April 1988, pp. 194-209.
[12]
Yao, A.C., “Theory and Application of Trapdoor Functions,”
Proceedings of the 23rd IEEE
Symposium on Foundations of Computer Science
, 1982, pp. 80-91.
[13]
Turing, A.M., “Computing Machinery and Intelligence,”
Mind
, Vol. 59, No. 236, 1950, pp. 433-
460.
[14]
Hastad, J., et al., “A Pseudorandom Generator from Any One-Way Function,”
SIAM Journal of
Computing
, Vol. 28, No. 4, 1999, pp. 1364-1396.
[15]
Goldwasser, S., and S. Micali, “Probabilistic Encryption,”
Journal of Computer and System
Sciences
, Vol. 28, No. 2, 1984, pp. 270-299.
