diff options
author | Sybren A. St?vel <sybren@stuvel.eu> | 2011-07-19 22:20:37 +0200 |
---|---|---|
committer | Sybren A. St?vel <sybren@stuvel.eu> | 2011-07-19 22:20:37 +0200 |
commit | be3e81304139c6106a7869721d7cd9459510bdea (patch) | |
tree | 55683785a852a7228588c92a849f0598f9d02168 | |
parent | 9c9319212b1353e22ff1a1b9d244cea01634ebe8 (diff) | |
download | rsa-be3e81304139c6106a7869721d7cd9459510bdea.tar.gz |
Permanently removed safebit stuff
-rw-r--r-- | rsa/core.py | 10 |
1 files changed, 0 insertions, 10 deletions
diff --git a/rsa/core.py b/rsa/core.py index aa72957..7b8b837 100644 --- a/rsa/core.py +++ b/rsa/core.py @@ -6,8 +6,6 @@ mathematically on integers. import types -#import rsa.common - def encrypt_int(message, ekey, n): """Encrypts a message using encryption key 'ekey', working modulo n""" @@ -23,10 +21,6 @@ def encrypt_int(message, ekey, n): if message > n: raise OverflowError("The message %i is too long for n=%i" % (message, n)) - #Note: Bit exponents start at zero (bit counts start at 1) this is correct -# safebit = rsa.common.bit_size(n) - 2 # compute safe bit (MSB - 1) -# message += (1 << safebit) # add safebit to ensure folding - return pow(message, ekey, n) def decrypt_int(cyphertext, dkey, n): @@ -34,9 +28,5 @@ def decrypt_int(cyphertext, dkey, n): modulo n""" message = pow(cyphertext, dkey, n) - -# safebit = rsa.common.bit_size(n) - 2 # compute safe bit (MSB - 1) -# message -= (1 << safebit) # remove safebit before decode - return message |