Cryptography, Rsa, Cybersecurity.
fixed values of k0 and k1. k1 defines the number of zeros to pad onto the message, and k0 defines the number of bits in a random number (r). The number of bits we are processing in the message is thus n−k0−k1 bits. We then have two hashing functions of G and H. The G function expands the k0 bits of