Bibliography

1

L. M. Adleman, Factoring numbers using singular integers, to be published.

2

P. Barrett, Implementing the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signal processor, Advances in Cryptology: Proceedings of Crypto '86, A. M. Odlyzko, ed., Lecture Notes in Computer Science 263, Springer-Verlag, NY (1987), 311-323.

3

F. Bauspiess and H.-J. Knobloch, How to keep authenticity alive in a computer network, Advances in Cryptology: Proceedings of Eurocrypt '89, J.-J. Quisquater, ed., to appear.

4

T. Beth, Efficient zero-knowledge identification scheme for smart cards, Advances in Cryptology: Proceedings of Eurocrypt '88, C. G. Günther, ed., Lecture Notes in Computer Science 330, Springer-Verlag, NY (1988), 77-84.

5

I. F. Blake, R. Fuji-Hara, R. C. Mullin, and S. A. Vanstone, Computing logarithms in fields of characteristic two, SIAM J. Alg. Disc. Methods 5 (1984), 276-285.

6

J. Bos and M. Coster, Addition chain heuristics, Advances in Cryptology; Proceedings of Crypto '89, G. Brassard, ed., Lecture Notes in Computer Science 435, Springer-Verlag, NY (1990), 400-407.

7

J. Brandt, I. Damgard, P. Landrock, and T. Pedersen, Zero-knowledge authentication scheme with secrete key exchange, Advances in Cryptology: Proceedings of Crypto '88, S. Goldwasser, ed., Lecture Notes in Computer Science 403, Springer-Verlag (1989), 583-588.

8

E. F. Brickell, A survey of hardware implementations of RSA (Abstract), Advances in Cryptology; Proceedings of Crypto '89, G. Brassard, ed., Lecture Notes in Computer Science 435, Springer-Verlag, NY (1990), 368-370.

9

E. F. Brickell and K. S. McCurley, An interactive identification scheme based on discrete logarithms and factoring, Advances in Cryptology: Proceedings of Eurocrypt '90, I. Damgard, ed., to be published.

10

D. Coppersmith, Fast evaluation of discrete logarithms in fields of characteristic two, IEEE Transactions on Information Theory 30 (1984), 587-594.

11

D. Coppersmith, Modifications to the number field sieve, to be published.

12

D. Coppersmith, A. Odlyzko, and R. Schroeppel, Discrete logarithms in GF(p), Algorithmica 1 (1986), 1-15.

13

D. Denning, and G. Sacco, Timestamps in Key Distribution Protocols, Communications of the ACM 24 (1981) 533-536.

14

W. Diffie and M. Hellman, New Directions in Cryptography, IEEE Transactions on Information Theory 22 (1976), 472-492.

15

T. ElGamal, A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Transactions on Information Theory 31 (1985), 469-472.

16

T. ElGamal, A subexponential-time algorithm for computing discrete logarithms over GF(p²), IEEE Transactions on Information Theory 31 (1985), 473-481.

17

A. Fiat and A. Shamir, How to prove yourself: practical solution to identification and signature problems, Advances in Cryptology: Proceedings of Crypto '86, A. M. Odlyzko, ed., Lecture Notes in Computer Science 263, Springer-Verlag, NY (1987), 186-199.

18

D. M. Gordon, Discrete logarithms in GF(p) using the number field sieve, to be published.

19

L. C. Guillou and J.-J. Quisquater, A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory, Advances in Cryptology: Proceedings of Eurocrypt '87, D. Chaum, ed., Lecture Notes in Computer Science 304, Springer-Verlag, NY (1988), 127-141.

20

C. G. Günther, Diffie-Hellman and ElGamal protocols with one single authentication key, Advances in Cryptology: Proceedings of Eurocrypt '89, J.-J. Quisquater, ed., to appear.

21

D. E. Knuth, The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, 2nd ed., Addison-Wesley 1981.

22

N. Koblitz, Elliptic curve cryptosystems, Math. Comp. 48 (1987), 203-209.

23

K. Koyama and K. Ohta, Identity-based conference key distribution systems, Advances in Cryptology: Proceedings of Crypto '87, C. Pomerance, ed., Lecture Notes in Computer Science, 293, Springer-Verlag, NY (1988), 175-194.

24

B. A. LaMacchia and A. M. Odlyzko, Solving large sparse linear systems over finite fields, Advances in Cryptology: Proceedings of Crypto '90, A. Menezes, S. Vanstone, eds., to be published.

25

A. K. Lenstra, H. W. Lenstra, Jr., M. S. Manasse, and J. M. Pollard, The number field sieve, Proc. $22^{\mbox{nd}}$ACM Symp. Theory of Computing (1990), 564-572.

26

A. K. Lenstra and M. S. Manasse, Factoring by electronic mail, Advances in Cryptology: Proceedings of Eurocrypt '89, J.-J. Quisquater, ed., to be published.

27

A. K. Lenstra and M. S. Manasse, Factoring with two large primes, Advances in Cryptology: Proceedings of Eurocrypt '90, I. Damgard, ed., to be published.

28

K. S. McCurley, The discrete logarithm problem, in Cryptography and Computational Number Theory, C. Pomerance, ed., Proc. Symp. Appl. Math., Amer. Math. Soc., 1990, to appear.

29

A. Menezes, S. Vanstone, T. Okamoto, Reducing elliptic curve logarithms to logarithms in a finite field, to be published.

30

S. Micali and A. Shamir, An improvement of the Fiat-Shamir identification and signature scheme, Advances in Cryptology: Proceedings of Crypto '88, S. Goldwasser, ed., Lecture Notes in Computer Science 403, Springer-Verlag, NY (1989), 244-247.

31

V. Miller, Use of elliptic curves in cryptography, Advances in Cryptology: Proceedings of Crypto '85, H. C. Williams, ed., Lecture Notes in Computer Science 218, Springer-Verlag, NY (1986), 417-426.

32

P. L. Montgomery, Modular multiplication without trial division, Math. Comp. 44 (1985), 519-521.

33

R. Needham and M. Schroeder, Using encryption for authentication in large networks of computers, Comm. ACM 21 (1978), 993-999.

34

A. M. Odlyzko, Discrete logarithms in finite fields and their cryptographic significance, Advances in Cryptology: Proceedings of Eurocrypt '84, T. Beth, N. Cot, I. Ingemarsson, eds., Lecture Notes in Computer Science 209, Springer-Verlag, NY (1985), 224-314.

35

E. Okamoto, Key distribution systems based on identification information, Advances in Cryptology: Proceedings of Crypto '87, C. Pomerance, ed., Lecture Notes in Computer Science 293, Springer-Verlag, NY (1988), 194-202.

36

E. Okamoto and K. Tanaka, Key distribution system based on identification information, IEEE J. Selected Areas Commun. SAC-7 (1989), 481-485.

37

J. M. Pollard, Factoring with cubic integers (parts I and II), unpublished manuscripts, August 1988 and December 1988.

38

C. P. Schnorr, Efficient identification and signatures for smart cards, Advances in Cryptology: Proceedings of Crypto '89, G. Brassard, ed., Lecture Notes in Computer Science 435, Springer-Verlag, NY (1990), 239-251.

39

B. Taylor and D. Goldberg, Secure networking in the Sun environment, Proc. USENIX Assoc. Summer Conference, Atlanta 1986, 28-37.

40

Shigeo Tsujii and Toshiya Itoh, An ID-based cryptosystem based on the discrete logarithm problem, IEEE Journal on Selected Areas in Communications 8 (1989), 467-473.