0
Я работаю над реализацией rsa. Я довольно много закончил, я думаю, у меня случайные ошибки, где, когда я запускаю мой код, это ошибка, всплывают в оболочке:RSA Implemenations
TraceBack (самый последний вызов последнего):
File "/home/damion/Documents/projects/project2.py", line 164, in <module>
decrypt_message = decrypt(encrypted_message,d,n)# decrypt message that was encrypted.
File "/home/damion/Documents/projects/project2.py", line 115, in decrypt
decrypt_string+=DecimalToChar(m)#add each charactor to a string
File "/home/damion/Documents/projects/project2.py", line 96, in DecimalToChar
return str(chr(d))
ValueError: chr() arg not in range(256)
и это мой код:
from random import randint
def prime(n):
for i in range(2,n):
if n%i==0:
return False
return True
def isprime(n):
"""
return true if n is a prime number and false otherwise"""
if prime(n):
return True
else:
return False
def prime_generator():
primeone=12
while not isprime(primeone):
primeone=randint(11,5000)
print primeone
print "prime number is: "+str(primeone)
primetwo = primeone
primetwo+=1
while not isprime(primetwo):
primetwo+=1
print primetwo
return primeone,primetwo
def gcd(x,y):
"""
use to calculate the greatest common divisible of x and y """
if y == 0:
return x
else:
return gcd(y,x%y)
def n(prime1,prime2):
"""
calculte and return 'N' That is used to find phi(N),and that is also used as to
make up the private and public key
"""
return prime1*prime2
def caculatePhi(prime1,prime2):
"""
calculate Phi(N) and return Phi(N)"""
return (prime1-1)*(prime2-1)
def e_finder(e,phi):
"""
calculate e for the public key and return Phi(n),e,n"""
while True:
if gcd(phi,e) == 1:# check to see if phi and e has no common factor except one(1)
return e
else:
e +=2 #increment e by to if there is a gcd>1
def Extended_Euclidean_Algorithm(PHI, E):
phi = PHI
e = E
A,X,previous_X,Y,previous_Y = phi,0,1,1,0
while e != 0:
temp = e
quotient = int(phi/e)
e = phi % e
phi = temp
temp = X
phi = previous_X - quotient * X
previous_X = temp
temp = Y
Y = previous_Y - quotient * Y
previous_Y = temp
return A + previous_Y
def generate_keys(E,D,N):
e,d,n = E,D,N
"""Calcualte private key(d),generate keys and return these keys
ie. public and private keys for encryption and decryption"""
return {"public_key":{"e":e,"n":n}},{"private_key":{"d":d,"n":n}}
def CharToDecimal(char):
"""convert a charactor to its decimal value
"""
c=char
return int(ord(c))
def DecimalToChar(decimal):
d=decimal
return str(chr(d))
def encrypt(m,e,n):
"""encrypt message and return that encrypted message """
encryped_string = ""
encrypt_lst=[]
for i in m:# loop through message, getting charactor at a time for encryption
m_char = CharToDecimal(i)#convert each charactor to its decimal equivalent
c=pow(m_char,e,n)#equivalent to c=(m**e)%n
encrypt_lst.append(c) # add each encrypted charactor to a LIST
encryped_string+=str(c)
return encrypt_lst,encryped_string
def decrypt(c,d,n):
"""decrypt message and return that decrypted message"""
decrypt_string = ""
for i in c: #loop through LIST of encrypted values,for decryption index by index
m=pow(i,d,n)#equivalent to m=(i**d)%n
decrypt_string+=DecimalToChar(m)#add each charactor to a string
return decrypt_string
if __name__ == "__main__":
"""Main for excuting programme"""
message = str(raw_input("Enter message to encrypt: "))
## prime_one = int(raw_input("Please Enter First Prime Number: "))
## prime_two = int(raw_input("Please Enter Second Prime Number: "))
##
prime_one,prime_two = prime_generator()
while (not isprime(prime_one) or not isprime(prime_two)):#prompt user to enter value if not prime
print""
print""
print"_________________________________________________________"
if not isprime(prime_one):print "first number was not prime!!!"
if not isprime(prime_two):print "Second number was not prime!!!"
print""
print"_________________________________________________________"
print""
prime_one = int(raw_input("Please enter first prime nuber: "))
prime_two = int(raw_input("Please enter second prime : "))
while prime_one<11 or prime_two<11: # prompt user to re-enter prime if less than 11
print""
print""
print"_________________________________________________________"
if prime_one<11:print "first number Must Be greater Than 10!!!"
if prime_two<11:print "Second number Must Be greater Than 10!!!"
print""
print"_________________________________________________________"
print""
prime_one = int(raw_input("Please enter first prime nuber: "))
prime_two = int(raw_input("Please enter second prime : "))
n= n(prime_one,prime_two)
phi = caculatePhi(prime_one,prime_two)
e=e_finder(3,phi)
d=Extended_Euclidean_Algorithm(phi,e)
keys = generate_keys(e,d,n) #get generated keys(public and private) and store them in keys
print "keys are: ",keys
encrypted_message,encryped_string = encrypt(message,e,n)#encrypt message from user
print "Encrypted string: "+str(encryped_string)#display string of encrypted input
print encrypted_message
decrypt_message = decrypt(encrypted_message,d,n)# decrypt message that was encrypted.
print "Our message decrypted is: "+str(decrypt_message)
пожалуйста, любая помощь поможет, точка в правильном направлении - это все, что мне нужно – damionlowers
Пожалуйста, попробуйте сами и внесите свой вопрос и код. Я понимаю, что английский - это не ваш родной язык, но строчный «им» вместо «Я», кажется, просто лени. Вы не можете просто обозначить все фрагмент кода. Только обозначайте его как фрагмент кода, если он действительно может работать как один. Также поясняйте комментарий, где возникает исключение, и что вы сделали для отладки вашего кода ... –
Причина очевидна из исключения - d превышает 256 или ниже 0. Поместите точку останова и отлаживайте ее. – Korem