How to exchange (secret) keys

A protocol is presented whereby two adversaries may exchange secrets, although neither trusts the other. The secrets are the prime factors of their publicly announced composite numbers. The two adversaries can exchange their secrets bit by bit, but each fears the other will cheat by sending "junk" bits. To solve this problem we show how each of the two can prove, for each bit delivered, that the bit is good. Applications are suggested to such electronic business transactions as signing contracts and sending certified electronic mail.

[1]  Gary L. Miller.  Riemann's Hypothesis and Tests for Primality , 1976, J. Comput. Syst. Sci..

[2]  Oded Goldreich,et al.  A randomized protocol for signing contracts , 1985, CACM.

[3]  W. Leveque.  Fundamentals of number theory , 1977 .

[4]  M. Rabin.  DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION , 1979 .

[5]  M. Rabin.  Probabilistic algorithm for testing primality , 1980 .

[6]  D. Shanks.  Solved and Unsolved Problems in Number Theory , 1964 .

[7]  Michael O. Rabin,et al.  Transaction Protection by Beacons , 1983, J. Comput. Syst. Sci..

[8]  G B Kolata.  Cryptographers gather to discuss research. , 1981, Science.

[9]  Gary L. Miller,et al.  On taking roots in finite fields , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[10]  M.E. Hellman,et al.  Privacy and authentication: An introduction to cryptography , 1979, Proceedings of the IEEE.

[11]  Clifford Grobstein,et al.  Defining human life. , 1981, Science.

[12]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[13]  E. Berlekamp.  Factoring polynomials over large finite fields* , 1970, SYMSAC '71.

[14]  Gary L. Miller,et al.  Riemann's Hypothesis and tests for primality , 1975, STOC.

[15]  E. Berlekamp.  Factoring polynomials over large finite fields* , 1971, SYMSAC '71.

[16]  Eric Bach,et al.  Fast algorithms under the extended riemann hypothesis: A concrete estimate , 1982, STOC '82.

[17]  Volker Strassen,et al.  A Fast Monte-Carlo Test for Primality , 1977, SIAM J. Comput..