help!

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)

python
There's your problem.

>>2
fuck off and die

Python wouldnt be on the list of approved Google languages if it was the problem

>>1
I hope you're using exp(x,e,n) instead of doing x**e % n like a little unoptimized fuckhead.

How do you do the 3 line "equal to"(=) sign?

import gmpy
d = gmpy.invert(e, phi)

Use the EEA to calculate the inverse of e and Square&Multiply to encrypt/decrypt instead of the naive exponentiations, ``programmer''.

>>6
I call it the equal as fuck sign.

>>6
Equivalence.

<D-D-D-DOUBLES!