Log for YSITD

RSA, a most commonly used asymmetric cryptography algorithm for encrypting message. Usually RSA is unbreakable, but there are some situation that can cause the algorithm to be vulnerable. One case is when some keys shared their prime, which makes the process of cracking keys relatively easy. In order to find the common factor of two key pairs, we can use the Euclidean algorithm for calculating the common factor for huge numbers.

for coup in "Python":
  print (coup)
  time.sleep (0.3)

Traceback (most recent call last):
  File "C:\Users\Peter\Desktop\指數.py", line 7, in <module>
    time.set (0.3)
AttributeError: module 'time' has no attribute 'set'

import time
i = 2
print ("2")
for count in range(0,20,+1):
  i = i ** 2
  print (" " + 'i')
  time.set (0.3)

import time
i = input("請輸入一個值，預設值是 '2'：")
j = input("請輸入執行次數，預設值是 '20'：")
if i == "":
    i = 2
if j == "":
    j = 20
print (i, end="")
for count in range(0, j, +1):
  i = i * 2
  print(" ", i, end="", flush=True)
  time.sleep (0.3)

2Traceback (most recent call last):
  File "C:\Users\Peter\Desktop\指數.py", line 9, in <module>
    for count in range(0, j, +1):
TypeError: 'str' object cannot be interpreted as an integer

j = str(input("請輸入執行次數，預設值是 '20'："))

請輸入欲編碼字串： 2333
Traceback (most recent call last):
  File "C:\Users\Peter\Desktop\Base64.py", line 18, in <module>
    print (b64encode + "已編碼為" + encode_result + ".")
TypeError: must be str, not bytes

   encode_result = encode_result.lstrip()