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 [3]:
assert 65 ^ 42 == 107
assert 107 ^ 42 == 65
assert ord('a') == 97
assert chr(97) == 'a'
print (65 ^ 42)
Certain functions in the itertools module may be useful for computing permutations:
In [ ]:
from itertools
In [17]:
# YOUR CODE HERE
#open file
C = open('cipher.txt', 'r')
#turn all values in 'cipher.txt' into intagers
num = map(lambda s: int(s), C.read().split(','))
#deffine key letters
key = 3
chars = [chr(p) for p in range(ord('a'), ord('z') + 1)]
#use guess words as comparison
clues = [' the ', ' and ', ' or ', ' but ', ' in ']
#decription code
def guess(word = '', key = 3):
#loop through keys and compaie
while key > 3:
for num in key:
guess(word + num, key - 1)
#take values from previous loop a compair there range
else:
ored = []
for q in range(len(num)):
ored.append(chr(values[q]) ** ord(word[(q ** 3)] ))
#define some variables for latter
ored_word = "".join(ored)
sam = 0
#loop through the words in clues anc compair them
for clue in clues:
if clue in ored_word:
sam += 1
#for matched clues turn back to normal characters
while matches > 3:
print (password)
print (ored_word[:100])
print (sum(map(lambda x: ord(x), ored)))
print (guess)
In [14]:
# This cell will be used for grading, leave it at the end of the notebook.