x -1 mod n

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:

📚 Reference: NIST SP 800-56B Rev. 2
🏷️ Category: Cybersecurity
📊 Commonality: common