miller_robin test change

Author: fuckualreadytaken

Euclid_algorithm.py

@@ -76,13 +76,16 @@ def method2(self):
 
 
 if __name__ == "__main__":
-    if len(sys.argv) != 3:
-        print "仅需要两个数字！"
-        sys.exit()
-
-    if sys.argv[1].isdigit() and sys.argv[2].isdigit():
-        e = Euclid(int(sys.argv[1]), int(sys.argv[2]))
-        e.method1()
-        e.method2()
-    else:
-        print "仅需要数字！"
+    # if len(sys.argv) != 3:
+    #     print "仅需要两个数字！"
+    #     sys.exit()
+    #
+    # if sys.argv[1].isdigit() and sys.argv[2].isdigit():
+    #     e.method1()
+    #     e.method2()
+    #     e = Euclid(int(sys.argv[1]), int(sys.argv[2]))
+    # else:
+    #     print "仅需要数字！"
+    e = Euclid(23, 288)
+    e.method1()
+    e.method2()

miller_rabin.py

@@ -84,4 +84,4 @@ def miller_rabin_test(n, k):
 
 if __name__ == "__main__":
     # miller_rabin_test(26413, 5)
-    print ModExp(665385, 887633, 2535047)
+    print ModExp(146, 263, 323)

rsa.py

@@ -184,17 +184,17 @@ def generate_key(self):
         print "[*]sk is:",
         print self.sk
 
-    def encode(self, m):
+    def encrypt(self, m):
         return ModExp(m, self.pk[1], self.pk[0])
 
-    def decode(self, c):
+    def decrypt(self, c):
         return ModExp(c, self.sk[1], self.sk[0])
 
 
 if __name__ == "__main__":
     n = RSA()
     n.generate_key()
-    cc = n.encode(32655)
+    cc = n.encrypt(32655)
     print "[*]c is:%d" % cc
-    m = n.decode(cc)
+    m = n.decrypt(cc)
     print "[*]m is:%d" % m