Problem 59
19 December 2003
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 cipher1.txt (right click and 'Save Link/Target As...'), 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 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.
107359
C#
class Problem59 {
static string decrypt(string s, string key) {
var r = new StringBuilder(s.Length);
var keyPos = 0;
foreach (var c in s) {
r.Append((char)(c ^ key[keyPos]));
keyPos = (keyPos + 1) % key.Length;
}
return r.ToString();
}
public static void run() {
var encrypted = new string(File.ReadAllText("cipher1.txt").Split(',').Select(x => (char)Convert.ToInt32(x)).ToArray());
for (char k1 = 'a'; k1 <= 'z'; k1++)
for (char k2 = 'a'; k2 <= 'z'; k2++)
for (char k3 = 'a'; k3 <= 'z'; k3++) {
var key = new string(new[] { k1, k2, k3 });
var d = decrypt(encrypted, key);
if (d.Contains("The ")) {
Console.WriteLine(d);
Console.WriteLine(d.Select(x => (int) x).Aggregate((x, y) => (x + y)));
return;
}
}
}
}
Python
def decrypt(s, key):
r = []
keyPos = 0
for c in s:
r.append(chr(ord(c) ^ ord(key[keyPos])))
keyPos = (keyPos + 1) % len(key)
return ''.join(r)
def problem59():
with open("cipher1.txt") as cfile:
encrypted = [chr(int(c)) for c in cfile.readline().split(',')]
for k1 in xrange(ord('a'), ord('z') + 1):
for k2 in xrange(ord('a'), ord('z') + 1):
for k3 in xrange(ord('a'), ord('z') + 1):
key = chr(k1) + chr(k2) + chr(k3)
d = decrypt(encrypted, key)
if d.find("The ") >= 0:
print d
print sum([ord(c) for c in d])
return
problem59()
Go
func decrypt(s string, key string) string {
r := make([]rune, len(s))
keyPos := 0
for i, _ := range s {
r[i] = rune(s[i] ^ key[keyPos])
keyPos = (keyPos + 1) % len(key)
}
return string(r)
}
func problem59() {
str, err := ioutil.ReadFile("cipher1.txt")
if err != nil {
panic("File open error")
}
strV := strings.Split(string(str), ",")
encrypted := ""
for _, c := range strV {
val, _ := strconv.ParseInt(strings.TrimSpace(c), 10, 16)
encrypted += string([]byte{byte(val)})
}
for k1 := 'a'; k1 <= 'z'; k1++ {
for k2 := 'a'; k2 <= 'z'; k2++ {
for k3 := 'a'; k3 <= 'z'; k3++ {
key := string([]rune{k1, k2, k3})
d := decrypt(encrypted, key)
if strings.Contains(d, "The ") {
fmt.Println(d)
sum := 0
for _, b := range d {
sum += int(b)
}
fmt.Println(sum)
return
}
}
}
}
}
func main() {
problem59()
}
C++
string decrypt(string s, string key) {
string r;
int keyPos = 0;
for (auto itr = s.begin(); itr != s.end(); itr++) {
auto c = *itr;
r += (char)(c ^ key[keyPos]);
keyPos = (keyPos + 1) % key.length();
}
return r;
}
void problem59() {
string encrypted;
ifstream fin("cipher1.txt");
string tempStr;
while (!fin.eof()) {
getline(fin, tempStr, ',');
encrypted += atoi(tempStr.c_str());
}
fin.close();
for (char k1 = 'a'; k1 <= 'z'; k1++)
for (char k2 = 'a'; k2 <= 'z'; k2++)
for (char k3 = 'a'; k3 <= 'z'; k3++) {
char k[] = {k1, k2, k3};
string key(k);
string d = decrypt(encrypted, key);
if (d.find("The ") != string::npos) {
cout << d << endl;
int sum = 0;
for (auto itr = d.begin(); itr != d.end(); itr++) {
sum += *itr;
}
cout << sum << endl;
return;
}
}
}