Re: RSA decryption exponent d (c++)
Available news archives: comp.lang.tcl - comp.lang.python - comp.security.firewalls - sci.crypt - comp.lang.php - comp.lang.javascript
Google
 
Web news.hping.org


sci.crypt archive

Re: RSA decryption exponent d (c++)

From: Ray <raimundo4u@hotmail.com>
Date: Fri Mar 31 2006 - 09:56:19 CEST



You can calculate  d = e^-1 (mod phi(n))  using the Extended Euclidean


Algorithm.


If you google for it, you find plenty of info about it.


For example, start on www.Wikipedia.com



Kind regards


Received on Mon May  1 01:54:07 2006