[SuNiNaTaS] challenge 19

1. 개요

이진수, rot13 문제

 

2. 분석

1) 이진수

이진수로 구성된듯한 문자열이 주어집니다. 파이썬 코드로 아스키문자열로 만들었습니다.

s = "0100111001010110010000110101010001000110010001000101\
0110001000000100101101000110001000000100101001001100\
0100010101011010010001010101001001001011010100100100\
1010001000000101001001000101010101010010000001001011\
0100011001010101010100100101000000100000010110100100\
1010001000000101001000100000010110000100011001000110\
0101010100100000010101010101001001010000001000000101\
0010010001010101010100100000010100100100110001001011\
0101100101000010010101100101000000100000010110100100\
1010001000000100011101000011010100100101101001010101\
0101010001001011010101110101101001001010010011010101\
0110010010010101000001011001010100100100100101010101"

result = ""
for i in range(0, len(s), 8):
    result += chr(int(s[i:i+8], 2))

print('result', result)
# NVCTFDV KF JLEZERKRJ REU KFURP ZJ R XFFU URP REU RLKYBVP ZJ GCRZUTKWZJMVIPYRIU

 

2) rot13

rot13으로 flag를 찾았습니다.