Search code examples
encryptionrsamaple

Using maple to calculate a value for mod computation

I am working on some security stuff and am trying to implement a basic form of RSA encryption. I am working with Maple to compute some values, but I am struggle with being able to compute this:

These are the values I have: e, p, q

I need to compute which value for 'd' will work in the following equation:

d*e ≡ 1 mod (p-1)*(q-1)

Notation note: If a - b is a multiple of the number c, we write "a ≡ b mod c".

I was told I could use some sort of Power(a,b) mod c functionality in Maple, but I am not sure how to do it. Shed any light on how I can calculate the a value for 'd' in Maple? In my case, e = 65537, and both p and q are really large prime numbers (100+ digits each).

Solution

  • It's as simple as d:= 1/e mod (p-1)*(q-1);