The Solution is shared considering CAN I SHARE MY SOLUTIONS?

Problem

XOR is a bitwise operator which returns 0 if the bits are the same, and 1 otherwise. In textbooks the XOR operator is denoted by ⊕, but in most challenges and programming languages you will see the caret ^ used instead.

ABOutput
000
011
101
110

For longer binary numbers we XOR bit by bit: 0110 ^ 1010 = 1100. We can XOR integers by first converting the integer from decimal to binary. We can XOR strings by first converting each character to the integer representing the Unicode character.

Given the string "label", XOR each character with the integer 13. Convert these integers back to a string and submit the flag as crypto{new_string}.

Solution

Python:

1
2
3
4
5
6

given = "label"

print("crypto{", end="")
for x in given:
  print(chr(ord(x)^13), end="")
print("}")

FLAG := crypto{aloha}