diff --git a/rsa/core.py b/rsa/core.py
index 2df4be5..aa72957 100755
--- a/rsa/core.py
+++ b/rsa/core.py
@@ -6,7 +6,7 @@
 
 import types
 
-import rsa.common
+#import rsa.common
 
 def encrypt_int(message, ekey, n):
     """Encrypts a message using encryption key 'ekey', working modulo n"""
@@ -24,8 +24,8 @@ def encrypt_int(message, ekey, 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
+#    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)
 
@@ -35,8 +35,8 @@ def decrypt_int(cyphertext, dkey, 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
+#    safebit = rsa.common.bit_size(n) - 2        # compute safe bit (MSB - 1)
+#    message -= (1 << safebit)                   # remove safebit before decode
 
     return message