RSA Algorithm

  • Thread starter mtanti
  • Start date
  • #1
172
0
How is it that you calculate e and d such that ed=(p-1)(q-1)+1? Isn't this a factoring problem?

How can you be sure that (p-1)(q-1)+1 is not prime?
 

Answers and Replies

  • #2
Hurkyl
Staff Emeritus
Science Advisor
Gold Member
14,916
19
You're interested in ed = k(p-1)(q-1) + 1.
The whole point is that you're looking for ed = 1 (mod phi(N)).
 
  • #3
saltydog
Science Advisor
Homework Helper
1,582
3
In case you don't already know, the program 'PARI' on the web is nice for working with number theory and some of the algorithms of RSA in general. Anyway, I used it, in conjunction with Mathematica's 'PowerMod' to easily encrypt a paragraph using two 256-digit primes (found by PARI).

Check um' out.:smile:
 

Related Threads on RSA Algorithm

  • Last Post
Replies
2
Views
1K
  • Last Post
Replies
1
Views
2K
  • Last Post
Replies
1
Views
2K
  • Last Post
Replies
7
Views
2K
  • Last Post
Replies
6
Views
2K
  • Last Post
Replies
5
Views
14K
Replies
3
Views
6K
  • Last Post
Replies
1
Views
2K
  • Last Post
Replies
11
Views
3K
  • Last Post
Replies
8
Views
2K
Top