Jump to content

X -1 mod n: Difference between revisions

From Hackerpedia
imported>Unknown user
No edit summary
imported>Unknown user
No edit summary
 
(No difference)

Latest revision as of 00:24, 20 January 2026

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: