Network Security_异或解密

很久没碰过c++了，代码风格确实不好，有时间修改一下吧。

code:

#include <iostream>
#include <fstream>
#include <cstdio>
#include <cstring>
#include <string>

using namespace std;

int main(){
	cout<<"-------------------Welcome to Nerwork Security!---------------------!"<<endl;
	//开始这里是手动输入的，后来觉得每次要手动输入太麻烦，还是改成了读取文件了。 
	printf("%s\n","Please input the number of cipertexts:");
	int n;
	cin>>n;
	
	cout<<endl;
	printf("%s\n","Please input the cipertexts:");
	
	char word[4];
	char ciphertext[10][400];
	int ciphertext_asc[10][400];
	
	char originaltext[10][400];
	int originaltext_asc[10][400];

	int key[400]={0};


//------------读取文件（密文）-----------------------------------	
//*****这里我每个密文都分成一个文件了，其实也可以放到一个txt里面一起读*****// 

    ifstream in0("0.txt");
    char c0;
    char a0[400];
    int n0=0;
 
    while(in0.get(c0))
        ciphertext[0][n0++] = c0;
    
    //查看是否读取成功 
	//cout<<"ciphertext[0]:"<<ciphertext[0]<<endl;
        
    ifstream in1("1.txt");
    char c1;
    char a1[400];
    int n1=0;
 
    while(in1.get(c1))
        ciphertext[1][n1++] = c1;
        
    ifstream in2("2.txt");
    char c2;
    char a2[400];
    int n2=0;
 
    while(in2.get(c2))
        ciphertext[2][n2++] = c2;
        
    ifstream in3("3.txt");
    char c3;
    char a3[400];
    int n3=0;
 
    while(in3.get(c3))
        ciphertext[3][n3++] = c3;
	
	
	ifstream in4("4.txt");
    char c4;
    char a4[400];
    int n4=0;
 
    while(in4.get(c4))
        ciphertext[4][n4++] = c4;
        
    ifstream in5("5.txt");
    char c5;
    char a5[400];
    int n5=0;
 
    while(in5.get(c5))
        ciphertext[5][n5++] = c5;
        
    ifstream in6("6.txt");
    char c6;
    char a6[400];
    int n6=0;
 
    while(in6.get(c6))
        ciphertext[6][n6++] = c6;
        
    ifstream in7("7.txt");
    char c7;
    char a7[400];
    int n7=0;
 
    while(in7.get(c7))
        ciphertext[7][n7++] = c7;
        
    ifstream in8("8.txt");
    char c8;
    char a8[400];
    int n8=0;
 
    while(in8.get(c8))
        ciphertext[8][n8++] = c8;
        
    ifstream in9("9.txt");
    char c9;
    char a9[400];
    int n9=0;
 
    while(in9.get(c9))
        ciphertext[9][n9++] = c9;
//---------------------------------------------------------	
	
	for(int i=0;i<n;i++)
	{
    //手动输入密文 
	//	scanf("%s",ciphertext[i]);
	//	printf("%d\n",strlen(ciphertext[i]));		
		int k=0;
		for(int j=0;j<strlen(ciphertext[i]);j+=2)
		{
			strncpy(word,ciphertext[i]+j,2);
			int num; 
			sscanf(word,"%x",&num);
			//printf("%d\n",num);	
			ciphertext_asc[i][k++] = num;
		}		
		//printf("%d\n",sizeof(ciphertext_asc[i]));		
	}
	
	//int n=0;
	for(int i=0;i<n;i++)
	{
		for(int k=0;k<400;k++)
		{
			int flag = 1;
			for(int j=0;j<4;j++)
			{
				if(i!=j)
				{
				   int asc = ciphertext_asc[i][k] ^ ciphertext_asc[j][k];
				  /* if(!(asc >= 64 && 
				       asc < 128))
					{
						cout<<"ciphertext_asc[i][k] ^ ciphertext_asc[j][k]:  "<<asc<<endl;
						flag = 0;
						break;
					}
					*/
					
				/*	if(asc < 64 || asc >=123)
					{
						flag = 0;
						break;
					}
					*/
					
					/*
					最后还是尝试用下面的获取key，理由：
					space和字母XOR后得到还是字母，与“，”XOR得到12，于“.”XOR得到14，相同得到0 
					*/ 
					if(!(asc == 12  || asc == 0 || asc == 14 || (asc >= 65 && asc <= 90) || (asc >= 97 && asc <= 122)))
					{
						flag = 0;
						break;
					}

					
				}
			}
			if(flag == 1) 
			{
				key[k] = ciphertext_asc[i][k] ^ 32;
			//	if(i==0) cout<<"K:"<<k<<endl;
				
			}
		}
	}
	
//  输出找到key的位置	
//	for(int i=0;i<400;i++)
//	{
//		if(key[i] != 0)
//		{
//			cout<<"K:"<<i<<endl;
//		}
//	}
	
	
	for(int i=0;i<n;i++)
	{
		for(int k=0;k<400;k++)
		{
			originaltext_asc[i][k] = key[k] ^ ciphertext_asc[i][k];
			//cout<<"originaltext_asc[i][k]"<<originaltext_asc[i][k]<<endl;
			cout<<(char)originaltext_asc[i][k];
		}
		cout<<endl;
	}
	
	
    //************下面是对key的优化**********************// 
    while(1)
    {
    	cout<<"Do you want to improve the key or input the ciphertext?"<<endl;
		cout<<"input 1 for improve, 2 for input the ciphertext and 0 to exit..."<<endl;
		int con;
		
		cin>>con;
		
		if(con == 2)
		{
			char text[100];
			cin>>text;
	    	int text_asc[100];
	    	char s[4];
		
		    int kk = 0;
			for(int j=0;j<strlen(text);j+=2)
			{
				strncpy(s,text+j,2);
				int num; 
				sscanf(s,"%x",&num);
				//printf("%d\n",num);	
				text_asc[kk++] = num;
			}
			
			for(int i=0;i<strlen(text)/2;i++)
			{
				int originalASC = text_asc[i] ^ key[i];
				cout<<(char)originalASC;
			}
			cout<<endl;
		}
		else if(con == 1)
		{
			cout<<"Please input the sequence,the original letter and the ciphertext letter..."<<endl;
			int seq;
			char a;
			char b[2];
			
			cin>>seq;
			cin>>a;
			cin>>b;
			
			int a_asc = (int)a;
			//sscanf(a,"%c",&a_asc);
			
			int b_asc;
			sscanf(b,"%x",&b_asc);
			
			key[seq] = a_asc ^ b_asc;
		}
		else if(con == 0) break;
		else{
			cout<<endl;
			cout<<"Please input the right command."<<endl;
			continue;
		}
    	
    }

	return 0;
	
} 
/*
对key优化的操作指令：（对应位置修改key（哎，这个数数的步骤弄得自己像个小学生一样） 
记得用1指令：
10 i 5c
7 s bf
18 r bc
25 u 0a
26 p 1b
27 . e7
34 t 47 
*/

/*
note:
1.最终的结果挺满意的，有一个test好像不太符合。
2.本次只针对给定的这10个密文，16进制格式给出，规则是异或。
3.对于密文的读取顺序不同，最后的结果有点差别，亲测。
 
*/

下面给出密文和test密文，代码是每个密文放到不同txt里面的。

315c4eeaa8b5f8aaf9174145bf43e1784b8fa00dc71d885a804e5ee9fa40b16349c146fb778cdf2d3aff021dfff5b403b510d0d0455468aeb98622b137dae857553ccd8883a7bc37520e06e515d22c954eba5025b8cc57ee59418ce7dc6bc41556bdb36bbca3e8774301fbcaa3b83b220809560987815f65286764703de0f3d524400a19b159610b11ef3e


234c02ecbbfbafa3ed18510abd11fa724fcda2018a1a8342cf064bbde548b12b07df44ba7191d9606ef4081ffde5ad46a5069d9f7f543bedb9c861bf29c7e205132eda9382b0bc2c5c4b45f919cf3a9f1cb74151f6d551f4480c82b2cb24cc5b028aa76eb7b4ab24171ab3cdadb8356f


32510ba9a7b2bba9b8005d43a304b5714cc0bb0c8a34884dd91304b8ad40b62b07df44ba6e9d8a2368e51d04e0e7b207b70b9b8261112bacb6c866a232dfe257527dc29398f5f3251a0d47e503c66e935de81230b59b7afb5f41afa8d661cb


32510ba9aab2a8a4fd06414fb517b5605cc0aa0dc91a8908c2064ba8ad5ea06a029056f47a8ad3306ef5021eafe1ac01a81197847a5c68a1b78769a37bc8f4575432c198ccb4ef63590256e305cd3a9544ee4160ead45aef520489e7da7d835402bca670bda8eb775200b8dabbba246b130f040d8ec6447e2c767f3d30ed81ea2e4c1404e1315a1010e7229be6636aaa


3f561ba9adb4b6ebec54424ba317b564418fac0dd35f8c08d31a1fe9e24fe56808c213f17c81d9607cee021dafe1e001b21ade877a5e68bea88d61b93ac5ee0d562e8e9582f5ef375f0a4ae20ed86e935de81230b59b73fb4302cd95d770c65b40aaa065f2a5e33a5a0bb5dcaba43722130f042f8ec85b7c2070

32510bfbacfbb9befd54415da243e1695ecabd58c519cd4bd2061bbde24eb76a19d84aba34d8de287be84d07e7e9a30ee714979c7e1123a8bd9822a33ecaf512472e8e8f8db3f9635c1949e640c621854eba0d79eccf52ff111284b4cc61d11902aebc66f2b2e436434eacc0aba938220b084800c2ca4e693522643573b2c4ce35050b0cf774201f0fe52ac9f26d71b6cf61a711cc229f77ace7aa88a2f19983122b11be87a59c355d25f8e4


32510bfbacfbb9befd54415da243e1695ecabd58c519cd4bd90f1fa6ea5ba47b01c909ba7696cf606ef40c04afe1ac0aa8148dd066592ded9f8774b529c7ea125d298e8883f5e9305f4b44f915cb2bd05af51373fd9b4af511039fa2d96f83414aaaf261bda2e97b170fb5cce2a53e675c154c0d9681596934777e2275b381ce2e40582afe67650b13e72287ff2270abcf73bb028932836fbdecfecee0a3b894473c1bbeb6b4913a536ce4f9b13f1efff71ea313c8661dd9a4ce


315c4eeaa8b5f8bffd11155ea506b56041c6a00c8a08854dd21a4bbde54ce56801d943ba708b8a3574f40c00fff9e00fa1439fd0654327a3bfc860b92f89ee04132ecb9298f5fd2d5e4b45e40ecc3b9d59e9417df7c95bba410e9aa2ca24c5474da2f276baa3ac325918b2daada43d6712150441c2e04f6565517f317da9d3


271946f9bbb2aeadec111841a81abc300ecaa01bd8069d5cc91005e9fe4aad6e04d513e96d99de2569bc5e50eeeca709b50a8a987f4264edb6896fb537d0a716132ddc938fb0f836480e06ed0fcd6e9759f40462f9cf57f4564186a2c1778f1543efa270bda5e933421cbe88a4a52222190f471e9bd15f652b653b7071aec59a2705081ffe72651d08f822c9ed6d76e48b63ab15d0208573a7eef027


466d06ece998b7a2fb1d464fed2ced7641ddaa3cc31c9941cf110abbf409ed39598005b3399ccfafb61d0315fca0a314be138a9f32503bedac8067f03adbf3575c3b8edc9ba7f537530541ab0f9f3cd04ff50d66f1d559ba520e89a2cb2a83


2d5c0bf9e9b4b6ecff1b5c44aa43fb7558cabc58cd169b4d800a1be7

2f5f4ef0a6aef8adfb17505ab943ec7f5bddee14c312845cc10b02a6e35ae92b10df46ba7e978a227fe5021eeba0b40ea20e

255603efa6a9acecf107155ea506b57540caa3018a108b08c11c03a0e85fa0660cde47b4

354d1ce0bfbef8b8f754584ba606b57558cabc018a1b8c51801504b0eb5ca92b08de57ba749dcb2e73f20a16faecee

32510ba9beb4aaa0fc545c59ed01fc770ecea01c8a13844ec55f02baad5aad641bc41dba5591dc253ae80515afeca900a2438a9877113faca1c87bbf2e89f0165d2980

22564ee6a7bef8b8f01d5b4ded02e1304f8fba11c71ac108c1110fe9e946e57c0cdc5fb4

275a1ae0a6b5f8bfe8115441ed0ffa654aca1bc58de178c46800804bbe95aeb

2d5701fea5bebcabfd54584ba606e63046daa31ac61ac108c91805a6ff48ab680c905efb729dd9606aee0205ebae

the result: