[gravity226]

Hey everyone, thanks for stopping by.

I wanted to write a simple RSA encryption program using Python but I'm having an issue decrypting the data that I have already encrypted. Below is the line where it gets hung up and says Overflow error 'Result to Large':

for item in Encryptor:
    Decryptor.insert(len(Decryptor), long(math.fmod(pow(item, 2011), 3127)))

The item value is usually greater than 1000. Is there anything besides long that I can use to store this gigantic value?
Thanks,
Tommy

[Nallo]

The problem is not long, the problem is that math.fmod converts its arguments to floats. So regardless which number type you pass to math.fmod you will get the same error when the numbers are to big to be floats.

Do you need fmod or is the normal integer % operator good enough for you?
I mean is item always an integer? If so you can use the % operator and adjust for the sign rule of fmod:

n = pow(item, 2011)
x = n % m
#x has now same sign as m. But using fmod it would have same sign as n.
#so adjust for that (if n and m always have the same sign you don't need that)
if m >= 0 and n < 0:
    x -= m
elif m < 0 and n >= 0:
    x += m

#instead of
n = pow(item, 2011)
x = math.fmod(n, m)

[gravity226]

That solves it, thanks Nallo!

Tommy