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;
}


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

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

《Deep Learning》译文 第六章 深度前馈网络 从异或函数说起

6.1 从异或函数说起              为了使前馈网络的概念更具体化,我们先从一个简单地例子说起,这个例子中,我们使用前馈网络解决一个简单的任务:学习异或函数。              众...
  • kai940325
  • kai940325
  • 2016年07月13日 14:21
  • 1840

异或(XOR)运算加密/解密算法

本文将介绍一个简单易用的加密/解密算法:使用异或(XOR)运算。本算法原理简单,旨在使读者对信息的加密/解密有一个更加直观的印象。   XOR算法原理   从加密的主要方法看,换位法过于简单,特别...
  • hsxbbsd71st
  • hsxbbsd71st
  • 2014年05月05日 22:17
  • 2216

获取当天的0点0分0秒的日期和23点59分59秒的日期

方法一:也是推荐使用的方法 //可以定义一个函数,函数的参数有小时、分、秒、相比今天的日期,今天就输入0,明天输入1,昨天输入-1,以此类推 //(毫秒是可选参数,可以输入也可以不输入,毫...
  • u012453843
  • u012453843
  • 2016年12月27日 17:49
  • 5011

project euler problem 5

  • 2010年12月18日 10:58
  • 18KB
  • 下载

Project Euler:Problem 50 Consecutive prime sum

The prime 41, can be written as the sum of six consecutive primes: 41 = 2 + 3 + 5 + 7 + 11 + 13 ...
  • youb11
  • youb11
  • 2015年06月07日 14:20
  • 417

Project Euler:Problem 75 Singular integer right triangles

It turns out that 12 cm is the smallest length of wire that can be bent to form an integer sided rig...
  • youb11
  • youb11
  • 2015年07月18日 15:53
  • 684

Project Euler:Problem 49 Prime permutations

The arithmetic sequence, 1487, 4817, 8147, in which each of the terms increases by 3330, is unusual ...
  • youb11
  • youb11
  • 2015年06月07日 11:12
  • 411

Project Euler:Problem 22 Names scores

Using names.txt (right click and 'Save Link/Target As...'), a 46K text file containing over five-t...
  • youb11
  • youb11
  • 2015年06月01日 21:01
  • 560

Project Euler Problem 32 Pandigital products

Pandigital products Problem 32 We shall say that an n-digit number is pandigital if it makes use ...
  • tigerisland45
  • tigerisland45
  • 2017年03月29日 06:38
  • 743

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...
  • youb11
  • youb11
  • 2015年07月01日 19:58
  • 530
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Project Euler:Problem 59 XOR decryption
举报原因:
原因补充:

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