I've written some code for encrypting traffic over sockets, and would
appreciate analysis of both the protocol and the implementation.

The code, which includes documentation and test code, is at -

http://gawth.com/bram/BSockWrapper.py

It uses a very conservative design based on Diffie-Hellman. The one thing
I'm a little unsure of is how private keys should be selected (this
implementation skirts the issue by accepting them from elsewhere). Is
selecting a 20-bit random number as the private key reasonable?

-Bram Cohen

"Markets can remain irrational longer than you can remain solvent"
                                        -- John Maynard Keynes




---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to [EMAIL PROTECTED]

Reply via email to