Project Euler: Problem 59

https://projecteuler.net/problem=59

Each character on a computer is assigned a unique code and the preferred standard is ASCII (American Standard Code for Information Interchange). For example, uppercase A = 65, asterisk (*) = 42, and lowercase k = 107.

A modern encryption method is to take a text file, convert the bytes to ASCII, then XOR each byte with a given value, taken from a secret key. The advantage with the XOR function is that using the same encryption key on the cipher text, restores the plain text; for example, 65 XOR 42 = 107, then 107 XOR 42 = 65.

For unbreakable encryption, the key is the same length as the plain text message, and the key is made up of random bytes. The user would keep the encrypted message and the encryption key in different locations, and without both "halves", it is impossible to decrypt the message.

Unfortunately, this method is impractical for most users, so the modified method is to use a password as a key. If the password is shorter than the message, which is likely, the key is repeated cyclically throughout the message. The balance for this method is using a sufficiently long password key for security, but short enough to be memorable.

Your task has been made easy, as the encryption key consists of three lower case characters. Using cipher.txt (in this directory), a file containing the encrypted ASCII codes, and the knowledge that the plain text must contain common English words, decrypt the message and find the sum of the ASCII values in the original text.

The following cell shows examples of how to perform XOR in Python and how to go back and forth between characters and integers:



In [1]:

    
assert 65 ^ 42 == 107
assert 107 ^ 42 == 65
assert ord('a') == 97
assert chr(97) == 'a'

Certain functions in the itertools module may be useful for computing permutations:



In [2]:

    
import itertools



In [3]:

    
#this cell brings the numbers from cipher.txt and appends them to a list as integers
stuff = open('cipher.txt', 'r')
i = stuff.read().split(',')
numbers=[]
for j in i:
    numbers.append(int(j))



In [4]:

    
#Made this encode function as prilimiary/test for my decode function
#works basically the same way as decode funtion
def encode(text, key):
    encrypted=[]
    count=0
    for n in range(len(text)):
        if len(key)<=count:
            count=0
        k=key[count]
        n= text[n]
        count+=1
        encrypted.append(ord(n)^ord(k))
    return (encrypted)



In [5]:

    
def decode(text, key):
    message=[]
    count=0
    for n in range(len(text)):
        #count starts at 0 and goes up by 1 for every character in key
        #when count is greater than the length of key resets to 0
        #will use count to call a specific letter in key
        if len(key)<=count:
            count=0
        k = key[count]
        n = text[n]
        count += 1
        #appends the corresponding character of: n XOR with correspoding the number of key 
        message.append(chr(n^ord(k)))
    return (''.join(message))



In [6]:

    
#returns possible keys for the decryption
def find_key(text, keywords):
    words=[]
    #goes through all letters in alphebet 
    #uses chr to turn numbers to letters
    #appends three letter words to list words
    for x in range(97,123):
        for y in range(97,123):
            for z in range(97,123):
                words.append(chr(x)+chr(y)+chr(z))
    pos=[]
    #takes the words in list words and puts them in the decode function
    for key in words:
        d=decode(text, key)
        #goes through the input keywords
        #if not in the decoded message break, if is append to pos
        for w in keywords:
            if w not in d:
                break
        else:
            pos.append(key)
    return (pos)



In [7]:

    
find_key(numbers, [' the ',])









    Out[7]:





['god']



In [8]:

    
TEXT = decode(numbers, 'god')
TEXT









    Out[8]:





"(The Gospel of John, chapter 1) 1 In the beginning the Word already existed. He was with God, and he was God. 2 He was in the beginning with God. 3 He created everything there is. Nothing exists that he didn't make. 4 Life itself was in him, and this life gives light to everyone. 5 The light shines through the darkness, and the darkness can never extinguish it. 6 God sent John the Baptist 7 to tell everyone about the light so that everyone might believe because of his testimony. 8 John himself was not the light; he was only a witness to the light. 9 The one who is the true light, who gives light to everyone, was going to come into the world. 10 But although the world was made through him, the world didn't recognize him when he came. 11 Even in his own land and among his own people, he was not accepted. 12 But to all who believed him and accepted him, he gave the right to become children of God. 13 They are reborn! This is not a physical birth resulting from human passion or plan, this rebirth comes from God.14 So the Word became human and lived here on earth among us. He was full of unfailing love and faithfulness. And we have seen his glory, the glory of the only Son of the Father."



In [9]:

    
#sums all the numbers corresponding to each character in the decoded message
sum(ord(i) for i in TEXT)









    Out[9]:





107359



In [10]:

    
stuff.close()



In [11]:

    
# YOUR CODE HERE



In [12]:

    
# This cell will be used for grading, leave it at the end of the notebook.