Cryptography, Encryption, Cybersecurity.
multiply. This is basically: a/b (mod p) = a* b^{-1} (mod p) Basically, it is the value of x which will make this true: b.x (mod p) = 1 This x is thus the multiplicative modular inverse value of b. So, let’s find the inverse of 3 (mod p): >>> pow(3,-1,5) 2 Note that the pow(x,y,p) function is x^y