cryptography - Performing modular arithmetic in Java to implement Diffie-Hellman -


I have a question, I try to apply encryption protocol between server and client based on Diffie-Hellman problem I am doing

The problem is that when I tried to do ((^ ^ TRC) mod p) ^ (1 / RC mod q) , then I would call (t ^ Rs. ) Mod is not p .

I also do (t ^ rc) mod p) ^ (1 / rc mod q) t.modpow (rc, p), even checked) .modpow (Rc.modInverse (q), p) This is not giving me t


Comments

Popular posts from this blog

Member with no value in F# -

java - Joda Time Interval Not returning what I expect -

c# - Showing a SelectedItem's Property -