find inverse in modular arithmetic
This video will teach you how to find inverse in modular arithmetic very easily and quickly, this inverse is also called multiplicative inverse
This method uses Extended Euclidean algorithm to find the multiplicative inverse.
Finding the inverse of given number in modular arithmetic is useful while doing encryption and decryption in HILL cipher algorithm.
Every number do not have its equivalent inverse in modular operation or modular arthimetic, sometimes some number do not have its inverse, using this method you can easily find out whether the given number has its inverse or not very quickly and easily.
Multiplicative inverse in cryptography is very important and useful concept.
Modular inverse is also known as Modular reciprocal.
Modular arithmetic is the part of sub part of finite mathematics.
The method shown in this video is fastest way to find modular inverse.
find inverse in modular arithmetic

свернуть