In the article about Cryptography, I'm stuck at the "Modifications" to get the final Formula
In the article about Cryptography, I’m stuck at the “Modifications” to get the final Formula
Can somebody please explain more clearly how the “k” and the “+1” where inserted to get to the final formula m ^ k*phi(n)+1 ≡ m mod n ??
I reread that part many times (Modification #1 and Modification #2) but I still don’t get it.
Regards and thanks in advance for any help provided here.
Get started today
Already have an account? Sign In