Name: Anonymous 2011-08-24 0:32
Ive gotten to the point in RSA where i can generate the
exponent, the modulus and the private key
They all match up to what the assignment says they should.
When i go to apply
C ≡ x^e (mod N) to encrypt
M ≡ C^d ≡ x^{ed} (mod N). doesn't decrypt
im using python. my code to get the private key is
mod(mod(e, T)**mod(-1, T), T) where T = (p-1)*(q-1)
the exponent e and modulus = P*N
I basically need help converting the encrypt and decrypt lines to python.
d ≡ e^{-1} (mod (p-1)(q-1))
i wrote as mod(mod(e, T)**mod(-1, T), T)
exponent, the modulus and the private key
They all match up to what the assignment says they should.
When i go to apply
C ≡ x^e (mod N) to encrypt
M ≡ C^d ≡ x^{ed} (mod N). doesn't decrypt
im using python. my code to get the private key is
mod(mod(e, T)**mod(-1, T), T) where T = (p-1)*(q-1)
the exponent e and modulus = P*N
I basically need help converting the encrypt and decrypt lines to python.
d ≡ e^{-1} (mod (p-1)(q-1))
i wrote as mod(mod(e, T)**mod(-1, T), T)