BUUCTF——异性相吸 题解

题目描述：最近出现了一个奇葩观点，说性别都不一样，怎么能谈恋爱？为了证明这个观点错误，请大家证明异性是相吸的。 注意：得到的 flag 请包上 flag{} 提交。

答案： flag{ea1bc0988992276b7f95b54a7435e89e}

打开附件后，会得到两个文本文件

第一个：密文.txt

内容是：ἇ̀Ј唒ဃ塔屋䩘卖剄䐃堂ن䝔嘅均ቄ䩝ᬔ

 第一个：key.txt

内容是：asadsasdasdasdasdasdasdasdasdasdqwesqf

 

解题步骤：

        因为题目叫“异性”相吸，标题和题目描述都着重强调着“异性”一词，这个词中的“异”代表一种不同的，对立的东西。在计算机的世界里，我们最熟悉的一对相异的东西就是二进制的0和1了。所以我们先将密文和key都转换成二进制的01代码。

密文转换后:

0000011100011111000000000000001100001000000001000001001001010101000000110001000001010100010110000100101101011100010110000100101001010110010100110100010001010010000000110100010000000010010110000100011000000110010101000100011100000101010101100100011101010111010001000001001001011101010010100001010000011011

key转换后：

0110000101110011011000010110010001110011011000010111001101100100011000010111001101100100011000010111001101100100011000010111001101100100011000010111001101100100011000010111001101100100011000010111001101100100011000010111001101100100011000010111001101100100011100010111011101100101011100110111000101100110

因为两者的二进制位数相同，都是38*8=304位，所以看题目中的异性“相吸”，我们可以大胆猜测密文和秘钥相对应的每一位二进制之间相同为0，不同为1。也就是异或。

C++代码如下:

#include<bits/stdc++.h>
using namespace std;
int main ()
{
	string miwen="0000011100011111000000000000001100001000000001000001001001010101000000110001000001010100010110000100101101011100010110000100101001010110010100110100010001010010000000110100010000000010010110000100011000000110010101000100011100000101010101100100011101010111010001000001001001011101010010100001010000011011";
	string key="0110000101110011011000010110010001110011011000010111001101100100011000010111001101100100011000010111001101100100011000010111001101100100011000010111001101100100011000010111001101100100011000010111001101100100011000010111001101100100011000010111001101100100011100010111011101100101011100110111000101100110";
	for(int i=0;i<miwen.length();i++)
	{
		if ( miwen[i] == key[i] ) cout<<"0";
		else cout<<"1";
	}
	return 0;
 } 

异或结果为：

0110011001101100011000010110011101111011011001010110000100110001011000100110001100110000001110010011100000111000001110010011100100110010001100100011011100110110011000100011011101100110001110010011010101100010001101010011010001100001001101110011010000110011001101010110010100111000001110010110010101111101

转为字符串得到答案:

flag{ea1bc0988992276b7f95b54a7435e89e}