Press "Enter" to skip to content

[SCTF]Verticode – 90

題目:

Welcome to Verticode,the new method of translating text into verticalcodes.

Each verticode has twoparts:the color shift andthe code.

The code takes the inputted character and translates it into anASCII code, and then into binary, then puts that into an image inwhich each black pixel representsa 1 andeach white pixel represents a 0.

For example, A is 65 whichis 1000001 inbinary, B is 66 whichis 1000010,and C is 67 whichis 1000011,so the corresponding verticode would looklike this.

Except, it isn't that simple.

A color shift is also integrated, which means that the color beforeeach verticode shifts the ASCII code, by adding the number that thecolor corresponds to, before translating it into binary. In thatcase, the previous verticode could also looklike this.

The table for the color codes is:

0 = Red
1 = Purple
2 = Blue
3 = Green
4 = Yellow
5 = Orange

This means that a red color shift for theletter A,which is 65 + 0 = 65,would translate into 1000001 inbinary; however, a green color shift for theletter A,which is 65 + 3 = 68,would translate into 1000100 inbinary.

Given thisverticode,read the verticode into text and find the flag.

Note that the flag will not be in thetypical sctf{flag} format,but will be painfully obvious text. Once you find this text, youwill submit it in the sctf{text} format.So, if the text you find is adunnaisawesome,you will submit it as sctf{adunnaisawesome}.

解法:

跟據以上規則 , 我得出以下算法

{SCTF2016}[Cryptography]Verticode - 90
{SCTF2016}[Cryptography]Verticode - 90
{SCTF2016}[Cryptography]Verticode - 90

Comments