[ pycrypto-Bugs-1041588 ] wishlist: DH key agreement
"SourceForge.net" <[email protected]> Tue, 14 Jun 2005 14:07:57 -0700
| Newsgroups | gmane.comp.python.cryptography.cvs |
|---|---|
| Message-ID | <[email protected]> |
Bugs item #1041588, was opened at 2004-10-06 09:26 Message generated for change (Comment added) made by nobody You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=120937&aid=1041588&group_id=20937 Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: None Group: None Status: Open Resolution: None Priority: 5 Submitted By: Zooko O'Whielacronx (zooko) Assigned to: Nobody/Anonymous (nobody) Summary: wishlist: DH key agreement Initial Comment: I need something that is not encryption nor authentication, but key agreement. That is: Alice generates random x, Bob generates random y, Alice computes g^x mod p, Bob computes g^y mod p, Alice (given g^y), computes (g^y)^x. How can I accomplish this? ---------------------------------------------------------------------- Comment By: Nobody/Anonymous (nobody) Date: 2005-06-14 14:07 Message: Logged In: NO Umm...The plain DH is rather weak in itself. I'd strongly recommend that you pick up B. Schneiener's Practical Cryptography. -NcF ---------------------------------------------------------------------- Comment By: A.M. Kuchling (akuchling) Date: 2004-10-20 09:56 Message: Logged In: YES user_id=11375 Python supports pow(g,y,p) to compute g**y mod p. ---------------------------------------------------------------------- Comment By: Zooko O'Whielacronx (zooko) Date: 2004-10-06 09:36 Message: Logged In: YES user_id=52562 Well I looked into the source of pycrypto to see what it would take to add this functionality. It turns out that the El Gamal stuff is implemented in 100% Pure Python! That's kind of shocking, but at least it answers my question about how to compute this. The answer is something that includes lines like "pow(g, y) % p". I'll be interested to see how this performs. ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=120937&aid=1041588&group_id=20937 ------------------------------------------------------- SF.Net email is sponsored by: Discover Easy Linux Migration Strategies from IBM. Find simple to follow Roadmaps, straightforward articles, informative Webcasts and more! Get everything you need to get up to speed, fast. http://ads.osdn.com/?ad_id=7477&alloc_id=16492&op=click