Coin flipping in Scheme


From Applied Cryptography, 2e.

In Applied Cryptography on pages 89 through 92, Schneier presents several methods of secure coin flipping, by which Alice flips a coin, Bob guesses which side it came up, and the protocol eliminates any chance of cheating by either party. For a class I took spring semester, Modern Cryptography, I was asked to implement one of these protocols. By accident, I did a wrong one first, and then the right one. Using my language of choice, PLT Scheme, I wrote code to flip coins by one-way functions and flip coins by public-key cryptography (RSA to be exact). In order to do this, I had to create a Gödel pairing function, program RSA from scratch, and write some ugly Scheme code. I'm rather proud of my work, so I'm posting it here for the world to use and enjoy.

coinflip_ss.zip Coin flipping in PLT Scheme (Pretty Big)

Posted: Sun - May 8, 2005 at 12:35 PM        

©