Bibliography

1

A. BEUTELSPACHER, Cryptology, Math. Assoc. of America, 1994.

2

H. COHEN, A Course in Computational Algebraic Number Theory, vol. 138 of Graduate Texts in Mathematics, Springer-Verlag, New York, 1993.

3

W. DIFFIE AND M. HELLMAN, New directions in cryptography, IEEE Trans. Inform. Theory, 22 (1976), pp. 644-654.

4

M. GARDNER, Mathematical games, Sci. Amer., (1977).

5

M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, 1979.

6

D. KAHN, Seizing the Enigma, Houghton Mifflin Co., 1991.

7

G. L. MILLER, Riemann's Hypothesis and tests for primality, J. Comput. System Sci., 13 (1976), pp. 300-317.

8

R. RIVEST, A. SHAMIR, AND L. ADLEMAN, A method for obtaining digital signatures and public-key cryptosystems, Comm. ACM, 21 (1978).

9

A. SHAMIR, A polynomial-time algorithm for breaking the basic Merkle-Hellman cryptosystem, IEEE Trans. Inform. Theory, 30 (1984), pp. 699-704.