| You can use
CypherCalc to compute the Modular Inverse of a
number. The Modular Inverse of a number a is
defined as a-1, such that:
(a)(a-1) mod n = 1, where n is the modulus and a-1 is the Modular Inverse we desire. You provide a and n, and CypherCalc will compute a-1. The modulus n is assumed to be loaded into CypherCalc's "N" operand memory. Here's the procedure:
|
![]() |