Bibliography - A Classical Introduction to Cryptography: Applications for Communications Security - page 319

[144] H. Ong, C.P. Schnorr, A. Shamir. An Efficient Signature Scheme Based on Quadratic Equa-
tions. In Proceedings of the 16th ACM Symposium on Theory of Computing , Washington,
D.C. ACM Press, NY, 1984, pp. 208-216.

[145] S. Pohlig, M. Hellman. An Improved Algorithm for Computing Logarithms over GF( q )
and Its Cryptographic Significance. IEEE Transactions on Information Theory , vol. IT-24,
pp. 106-110, 1978.

[146] D. Pointcheval, J. Stern. Security Proofs for Signature Schemes. In Advances in Cryptology
EUROCRYPT'96 , Zaragoza, Spain, Lecture Notes in Computer Science 1070. Springer-
Verlag, NY, 1996, pp. 387-398.

[147] D. Pointcheval, S. Vaudenay. On Provable Security for Digital Signature Algorithms. Tech-
nical Report LIENS 96-17, Ecole Normale Superieure, 1996.

[148] J.M. Pollard. Theorems on Factorization and Primality Testing. Mathematical Proceedings
of the Cambridge Philosophical Society , vol. 76, pp. 521-528, 1974.

[149] J.M. Pollard. A Monte Carlo Method for Factorization. Nordisk Tidskrift for Informations-
behandlung (BIT) , vol. 15, pp. 331-334, 1975.

[150] J.M. Pollard. Monte Carlo Methods for Index Computation mod p . Mathematics of Com-
putation , vol. 32, pp. 918-924, 1978.

[151] J.M. Pollard, C.P. Schnorr. An Efficient Solution of the Congruence x 2 + ky 2 = m

(mod n ). IEEE Transactions on Information Theory , vol. IT-33, pp. 702-709, 1987.

[152] C. Pomerance. Fast, Rigorous Factorization and Discrete Logarithm Algorithms. In Dis-
crete Algorithms and Complexity, D.S. Johnson, T. Nishizeki, A. Nozaki, and H.S. Wilf
(Eds.). Academic Press, NY, 1987, pp. 119-143.

[153] M.O. Rabin. Digitalized Signatures and Public-Key Functions as Intractable as Factor-
ization. Technical Report MIT/LCS/TR-212, MIT Laboratory for Computer Science,
1979.

[154] M.O. Rabin. Probabilistic Algorithm for Testing Primality. Journal of Number Theory ,
vol. 12, pp. 128-138, 1980.

[155] A. Renyi. Probability Theory . Elsevier, NY, 1970.

[156] R.L. Rivest. The MD4 Message Digest Algorithm. In Advances in Cryptology
CRYPTO'90 , Santa Barbara, CA, Lecture Notes in Computer Science 537. Springer-
Verlag, NY, 1991, pp. 303-311.

[157] R.L. Rivest. The MD5 Message Digest Algorithm. RFC 1321, 1992.

[158] R.L. Rivest, A. Shamir, L.M. Adleman. A Method for Obtaining Digital Signatures and
Public-Key Cryptosystem. Communications of the ACM , vol. 21, pp. 120-126, 1978.