• Status: Solved
  • Priority: Medium
  • Security: Public
  • Views: 797
  • Last Modified:

How to compute d in RSA ?

Hi ..
I made the first steps from RSA Algorithm :
Generate p , q
n=pq
phi(n)
gcd (e , phi)=1
then comes the Modular Inverse d ...................................
d=e^-1 mod phi
I need an algorithm explained to put the source code of a function called Compute_d(e,phi)
0
alim_maze
Asked:
alim_maze
  • 2
1 Solution
 
geobulCommented:
Hi,

Check this link. The algorithm is there.
http://www-math.cudenver.edu/~wcherowi/courses/m5410/exeucalg.html

Regards, Geo
0
 
alim_mazeAuthor Commented:
Thank you Geo ..
I am reading ..
and will see if it solves my problem ..
0
 
alim_mazeAuthor Commented:
Thank's to you Geo ..
       you deserve it
I made the [function Compute_d (e,phi:integer):integer;] helping with your link , and it works ..
I'll ask another question (new) about RSA programming in Delphi:
 (How to handle mod & power with huge numbers over int64 bits) ,so please keep in touch ..
but for this one it's done and you've got it .

0

Featured Post

Free Tool: Path Explorer

An intuitive utility to help find the CSS path to UI elements on a webpage. These paths are used frequently in a variety of front-end development and QA automation tasks.

One of a set of tools we're offering as a way of saying thank you for being a part of the community.

  • 2
Tackle projects and never again get stuck behind a technical roadblock.
Join Now