Project Euler:Problem 59 XOR decryption

原创 2015年07月08日 22:33:16

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 (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.


看到题目想到了维吉尼亚密码,秘钥长度为3,显然每隔三位的字符都是用同一个字母加密的,并且这同一字符加密的字符按理应该是满足英文字母使用频率分布表的。

事与愿违!这统计出来的出现频率最高的字符与e的ASCII异或得到的东西很奇怪啊!可能是字符数太小的缘故。

还好秘钥长度为3,来个三层循环便历一下就好了。如果在加密过程中出现了除字母和标点符号以外的字符的话,说明这个秘钥不正确;如果像这种常见的字符比如,、.、the、that、is、to、it、in等在译出的明文中没有出现的话说明这个秘钥也是不正确的。


#include <iostream>
#include <fstream>
#include <string>
#include <vector>
using namespace std;

int main()
{
	ifstream input;
	input.open("cipher.txt");
	string src;
	input >> src;
	vector<char> asc;
	int a = 0;
	for (int i = 0; i < src.length(); i++)
	{
		if (src[i] == ',')
		{
			asc.push_back(a);
			a = 0;
		}
		else
		{
			int b = src[i] - '0';
			a = a * 10 + b;
		}
	}
	asc.push_back(a);
	vector<char> msg = asc;
	char key[3];
	bool the = false, and = false, to = false;
	int sum = 0;
	for (int x = 'a'; x <= 'z'; x++)
	{
		for (int y = 'a'; y <= 'z'; y++)
		{
			for (int z = 'a'; z <= 'z'; z++)
			{
				key[0] = x;
				key[1] = y;
				key[2] =  z;

				for (int i = 0; i < asc.size(); i++)
				{
					msg[i] = asc[i] ^ key[i % 3];
					if (i >= 2)
					{
						the = (msg[i - 2] == 't'&&msg[i - 1] == 'h'&&msg[i] == 'e') || the;
						and = (msg[i - 2] == 'a'&&msg[i - 1] == 'n'&&msg[i] == 'd') || and;
						to = (msg[i - 1] == 't'&&msg[i] == 'o') || to;
					}
					sum += msg[i];
				}
				if (the&&and&&to)
				{
					cout << sum << endl;
					for (int j = 0; j < msg.size(); j++)
						cout << msg[j];
					cout << endl;
				}
				the = false;
				and = false;
				to = false;
				sum = 0;
			}
		}
	}

	system("pause");
	return 0;
}


总共会输出四个结果,然后里面只有一个结果是能读懂的明文。

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

Project Euler problem 59

这题题意是: 用三个小写字母组成的密钥去加密一个文章。 因为密钥比较短,所以循环着来。 加密的方法是用ASCII码来异或 然后这种题。。 我会说我是26*26*26 然后把所有可能枚...

project euler problem 5

  • 2010-12-18 10:58
  • 18KB
  • 下载

Project Euler 59

其实突然觉得这个字号大小正好~ 这道题,有点意思。 关于解密码的。 题目内容简单说说,用三个字母来作为key,对一小篇文章进行加密。 那么关键点就在于找关键字,很多人说:找“t...

Project Euler:Problem 49 Prime permutations

The arithmetic sequence, 1487, 4817, 8147, in which each of the terms increases by 3330, is unusual ...

Project Euler:Problem 22 Names scores

Using names.txt (right click and 'Save Link/Target As...'), a 46K text file containing over five-t...

Project Euler Problem 32 Pandigital products

Pandigital products Problem 32 We shall say that an n-digit number is pandigital if it makes use ...

Project Euler:Problem 51 Prime digit replacements

By replacing the 1st digit of the 2-digit number *3, it turns out that six of the nine possible valu...

Project Euler:Problem 86 Cuboid route

A spider, S, sits in one corner of a cuboid room, measuring 6 by 5 by 3, and a fly, F, sits in the o...

Project Euler:Problem 18 Maximum path sum I

By starting at the top of the triangle below and moving to adjacent numbers on the row below, the ma...

Project Euler - Problem 5

2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any rema...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)