Jump to content

X -1 mod n

From Hackerpedia
Revision as of 01:42, 15 January 2026 by imported>Unknown user
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Languages: English | Français

X -1 mod n

The multiplicative inverse of the integer x modulo the positive integer n. This quantity is defined if and only if x is relatively prime to n. For the purposes of this Recommendation, y = x-1 mod n is the unique integer satisfying the following two conditions:

Source: NIST SP 800-56B Rev. 2 | Category:

Retrieved from "https://hackerpedia.org/index.php?title=X_-1_mod_n&oldid=4535"