Jump to content

X -1 mod n

From Hackerpedia
Revision as of 02:53, 15 January 2026 by imported>Unknown user

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: