old-fashion1题解

简介: old-fashion1题解

old-fashion1题解


old-fashion并观察题目特征说明应该是一个古典密码

Os drnuzearyuwn, y jtkjzoztzoes douwlr oj y ilzwex eq lsdexosa kn pwodw tsozj eq ufyoszlbz yrl rlufydlx pozw douwlrzlbz, ydderxosa ze y rlatfyr jnjzli; mjy gfbmw vla xy wbfnsy symmyew (mjy vrwm qrvvrf), hlbew rd symmyew, mebhsymw rd symmyew, vbomgeyw rd mjy lxrzy, lfk wr dremj. Mjy eyqybzye kyqbhjyew mjy myom xa hyedrevbfn lf bfzyewy wgxwmbmgmbrf. Wr mjy dsln bw f1_2jyf-k3_jg1-vb-vl_l

直接用在线的网站进行爆破

https://quipqiup.com/

Xl fogkvryoeksg, e hjdhvxvjvxrl fxksao xh e zavsrb rc alfrbxly dg wsxfs jlxvh rc knexlvaiv eoa oaknefab wxvs fxksaovaiv, effrobxly vr e oayjneo hghvaz; the units may be single letters (the most common), pairs of letters, triplets of letters, mixtures of the above, and so forth. The receiver deciphers the text by performing an inverse substitution. So the flag is n1_2hen-d3_hu1-mi-ma_a

破解出的数据结尾为So the flag is n1_2hen-d3_hu1-mi-ma_a

flag{n1_2hen-d3_hu1-mi-ma_a}

相关文章
|
7月前
|
数据安全/隐私保护
[BJDCTF2020]BJD hamburger competition 题解
[BJDCTF2020]BJD hamburger competition 题解
23 0
|
8月前
BUUCTF old-fashion 1
BUUCTF old-fashion 1
35 0
|
9月前
|
机器学习/深度学习 存储 缓存
Lecture 3:动态规划
Lecture 3:动态规划
CodeForces 1195C Basketball Exercise (线性DP)
CodeForces 1195C Basketball Exercise (线性DP)
84 0
|
开发者
牛客第六场-Combination of Physics and Maths
题意:选出一个子矩阵,使得所求的压强最大,压强是指这个子矩阵中每个元素之和 / 这个子矩阵最下面一行的元素之和
42 0
牛客第六场-Combination of Physics and Maths
ECJTUACM16 Winter vacation training #1 题解&源码
//寒假训练赛,第一次拿第一,感觉很爽哦,AC3题! A-------------------------------------------------------------------------------------------- 题目链接:http://codeforces.
977 0
|
人工智能
ECJTUACM16 Winter vacation training #5 题解&源码
A------------------------------------------------------------------------------------------- 题目链接:http://codeforces.
1107 0