Performing modular arithmetic in Java to implement Diffie-Hellman

Asked Aug 01 '14 at 13:02

Active Nov 03 '14 at 13:43

Viewed 215 times

I have a question, I am trying to implement the encryption protocol between server and client based on Diffie-Hellman problem.

The problem is when I tried to ((t^RsRc) mod p)^(1/Rc mod q) it is not giving me (t^Rs) mod p.

I have checked even if I am doing ((t^Rc) mod p)^(1/Rc mod q) t.modPow(Rc, p)).modPow(Rc.modInverse(q), p) it is not giving me t.

edited Aug 03 '14 at 15:18

Maarten Bodewes

asked Aug 01 '14 at 13:02

user3899457

1

What does your code look like? In particular, what data types are you using for your calculations? – biziclop Aug 01 '14 at 13:05
You've got your mod p's and mod q's mixed up. – President James K. Polk Aug 02 '14 at 01:00

0 Answers0