Cryptography2080Numerical: RSA encryption decryptionRSA Algorithm
Discrete Logarithms and RSA Cryptosystem
Discrete Logarithms and RSA Cryptosystem
- Primes: $p = 13$, $q = 7$ - Plaintext: $M = \text{'hi'}$ - Encoding: $a=0, b=1, \ldots, z=25$ All required data is present. --- Given a prime $p$, a primitive root (generator) $g$, and a value $y$, the discrete logarithm is the integer $x$ such that: $$g^x \bmod p = y$$ Properties: - It is the ...