[ pycrypto-Bugs-1041588 ] wishlist: DH key agreement

Bugs item #1041588, was opened at 2004-10-06 12:26
Message generated for change (Comment added) made by akuchling
You can respond by visiting: 
https://sourceforge.net/tracker/?func=detail&atid=120937&aid=1041588&group_id=20937

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: A.M. Kuchling (akuchling)
Date: 2004-10-20 12: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 12: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


-------------------------------------------------------
This SF.net email is sponsored by: IT Product Guide on ITManagersJournal
Use IT products in your business? Tell us what you think of them. Give us
Your Opinions, Get Free ThinkGeek Gift Certificates! Click to find out more
http://productguide.itmanagersjournal.com/guidepromo.tmpl