References

1

M. Abadi and R. Needham. Prudent engineering practice for cryptographic protocols. In 1994 IEEE Symposium on Security and Privacy, pages 122-136. IEEE Press, 1994.

2

R. Anderson and R. Needham. Robustness principles for public key protocols. In D. Coppersmith, editor, Advances in Cryptology - Crypto'95, volume 963 of Lecture Notes in Computer Science, pages 236-247. Springer-Verlag, 1995.

3

D. Boneh, R. A. DeMillo, and R. J. Lipton. On the importance of checking cryptographic protocols for faults. In W. Fumy, editor, Advances in Cryptology - Eurocrypt'97, volume 1233 of Lecture Notes in Computer Science, pages 37-51. Springer-Verlag, 1997.

4

M. Burrows, M. Abadi, and R. Needham. A logic of authentication. ACM Trans. on Computer Systems, 8(1):18-36, February 1990.

5

G. Davida. Chosen signature cryptanalysis of the RSA (MIT) public key cryptosystem. Technical Report TR-CS-82-2, Dept. of Electrical Engineering and Computer Science, University of Wisconsin, Milwaukee, USA, October 1982.

6

A. Gillet, M. Joye, and J.-J. Quisquater. Cycling attacks against faulty hardware. Technical Report CG-1997/6, UCL Crypto Group, Louvain-la-Neuve, June 1997.

7

M. Joye, A. K. Lenstra, and J.-J. Quisquater. Chinese remaindering in the presence of faults. Submitted to Journal of Cryptology.

8

R. Kemmerer, C. Meadows, and J. Millen. Three systems for cryptographic protocol analysis. Journal of Cryptology, 7(2):79-130, 1994.

9

D. E. Knuth. The art of computer programming: Volume 2/Seminumerical algorithms. Addison-Wesley, 2nd edition, 1981.

10

A. K. Lenstra. Memo on RSA signature generation in the presence of faults, September 1996.

11

J. H. Moore. Protocol failures in cryptosystems. In G. Simmons, editor, Contemporary Cryptology, pages 541-558. IEEE Press, 1992.

12

J.-J. Quisquater and C. Couvreur. Fast decipherment algorithm for RSA public-key cryptosystem. Electronics Letters, 18(21):905-907, 1982.

13

R. L. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2):120-126, February 1978.

14

A. Shamir. How to check modular exponentiation. Presented at the rump session of Eurocrypt'97.