Omniadisce

Modular Inverse of 7 mod 17

Multiple choice Intermediate New no attempts yet
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.
Principles it rests on
  • Modular Arithmetic: Congruences are computed over the ring $\mathbb{Z}_p$ under addition and multiplication modulo $p$.
  • Bรฉzout's Identity: For $\gcd(a, p) = 1$ there exist integers $x, y$ with $a x + p y = 1$.
  • Existence and Uniqueness: An inverse in $\mathbb{Z}_p^\times$ exists only when $a$ is coprime to the modulus, and is then unique.
Question
What is the unique modular multiplicative inverse of 7 modulo 17?
Nobody has tried this yet.Be the first. Your answer starts the stats.

Only each person's first answer, given before viewing the solution, is counted.

Discussion 0 comments

Log in to join the discussion.

× Enlarged view