Encryption, Post Quantum Cryptography, Elliptic Curve, Digital Signatures, Kyber.
very huge integer number and we’ll call it ‘z‘. Now you can calculate S using the equation : S = k^-1 (z + a* R) mod p Note here the k^-1 which is the modular multiplicative inverse of k… it’s ’s a number such that (k^-1 * k ) mod p is equal to 1. (For example 3*5 mod 7=1 so 3 and 5 are modular