Search for a tool
Modular multiplicative inverse

Tool to compute the modular inverse of a number. The modular multiplicative inverse of an integer N modulo m is an integer n such as the inverse of N modulo m equals n.

Results

Modular multiplicative inverse -

Tag(s) : Cryptography,Substitution Cipher

dCode and you

dCode is free and its tools are a valuable help in games, puzzles and problems to solve every day!
You have a problem, an idea for a project, a specific need and dCode can not (yet) help you? You need custom development? Contact-me!

Team dCode read all messages and answer them if you leave an email (not published). It is thanks to you that dCode has the best Modular multiplicative inverse tool. Thank you.

# Modular multiplicative inverse

## Modular Inverse Calculator

Tool to compute the modular inverse of a number. The modular multiplicative inverse of an integer N modulo m is an integer n such as the inverse of N modulo m equals n.

### How to calculate a modular inverse?

dCode uses the Extended Euclidian algorithm and arbitrary precision functions to get resulsts with bg integers.

3^-1 mod 11 is equivalent to 4 because 4x3 = 12 and 12 is equivalent to 1 modulo 11.

The Euclidean algorithm is similar to that used in the calculation of GCD or the identity of Bezout.

### What is the modular Inverse?

The value of the inverse modular of a by the modulus n is the value u such as $$u \equiv a^{-1} \pmod n$$ $$a u \equiv1 \pmod n$$

### What does invmod mean?

The keyword invmod is the abbreviation of inverse modular.