Modular Inverse of 7 mod 17
In asymmetric cryptography (such as RSA key derivation), one requires finding the unique modular multiplicative inverse x in the finite field $\mathbb{Z}_{17}$ such that (7 * x) mod 17 = 1.
1 post matches
In asymmetric cryptography (such as RSA key derivation), one requires finding the unique modular multiplicative inverse x in the finite field $\mathbb{Z}_{17}$ such that (7 * x) mod 17 = 1.