[AFCTF2018]你听过一次一密么？

最新推荐文章于 2023-08-31 17:38:35 发布

「已注销」

最新推荐文章于 2023-08-31 17:38:35 发布

阅读量2.6k

点赞数

分类专栏： Crypto wp buuctf 文章标签： buu

本文链接：https://blog.csdn.net/m0_52727862/article/details/119043250

版权

本文介绍了在AFCTF2018中涉及的一次一密（One-Time-Pad）和Many-Time-Pad的概念。作者通过查找相关资源，尝试使用Many-Time-Pad攻击脚本来解密旗标，但由于环境问题未能成功。最终，作者通过阅读其他高手的解决方案，理解了修复语句的方法，成功找到了旗标。

摘要由CSDN通过智能技术生成

[AFCTF2018]你听过一次一密么？

附件：

$[外链图片转存失败,源站可能有防盗链机制,建议将图片保存下来直接上传(img-AJaXHiET-1627040926867)(C:\Users\86183\Desktop\ZERO\2ero\WP\BUUCTF\Crypto[AFCTF2018]你听过一次一密么？\image-20210721210033753.png)]$

Problem.txt

25030206463d3d393131555f7f1d061d4052111a19544e2e5d
0f020606150f203f307f5c0a7f24070747130e16545000035d
1203075429152a7020365c167f390f1013170b1006481e1314
0f4610170e1e2235787f7853372c0f065752111b15454e0e09
081543000e1e6f3f3a3348533a270d064a02111a1b5f4e0a18
0909075412132e247436425332281a1c561f04071d520f0b11
4116111b101e2170203011113a69001b475206011552050219
041006064612297020375453342c17545a01451811411a470e
021311114a5b0335207f7c167f22001b44520c15544801125d
06140611460c26243c7f5c167f3d015446010053005907145d
0f05110d160f263f3a7f4210372c03111313090415481d49

题目描述“一次一密（One-Time-Pad）”特意去了解了一下。又去找了一下大佬的WP，发现还有Many-Time-Pad (MTP).

再搜索 Many-Time-Pad，居然找到了many-time-pad-attack 脚本，python2的脚本，然而并没有运行起来QAQ

#!/usr/bin/python
## OTP - Recovering the private key from a set of messages that were encrypted w/ the same private key (Many time pad attack) - crypto100-many_time_secret @ alexctf 2017
# Original code by jwomers: https://github.com/Jwomers/many-time-pad-attack/blob/master/attack.py)

import string
import collections
import sets, sys

# 11 unknown ciphertexts (in hex format), all encrpyted with the same key

c1='25030206463d3d393131555f7f1d061d4052111a19544e2e5d'
c2='0f020606150f203f307f5c0a7f24070747130e16545000035d'
c3='1203075429152a7020365c167f390f1013170b1006481e1314'
c4='0f4610170e1e2235787f7853372c0f065752111b15454e0e09'
c5='081543000e1e6f3f3a3348533a270d064a02111a1b5f4e0a18'
c6='0909075412132e247436425332281a1c561f04071d520f0b11'
c7='4116111b101e2170203011113a69001b475206011552050219'
c8='041006064612297020375453342c17545a01451811411a470e'
c9='021311114a5b0335207f7c167f22001b44520c15544801125d'
c10='06140611460c26243c7f5c167f3d015446010053005907145d'
c11='0f05110d160f263f3a7f4210372c03111313090415481d49'
ciphers = [c1, c2, c3, c4, c5, c6, c7, c8, c9, c10, c11]
# The target ciphertext we want to crack
#target_cipher = "0529242a631234122d2b36697f13272c207f2021283a6b0c7908"

# XORs two string
def strxor(a, b):     # xor two strings (trims the longer input)
    return "".join([chr(ord(x) ^ ord(y)) for (x, y) in