Skip to main content
  1. Posts/

Cryptography - The Basics

·6 mins

Introduction #


  • I spent the better part of the start of my year doing a lot of problem-solving with Python (secretly preparing for interviews :D ). Most of that entailed revisiting data structures and algorithms.

  • Because I am not landing any Google or Microsoft roles anytime soon :) , that knowledge will not go to waste. So let’s learn some cryptography with Python!

  • I thought this would be a fun experience to document how I solve various cryptography challenges starting from basic beginner-level problems from Cryptohack or Cryptopals to advanced-level problems. This first blog will be focused on laying the groundwork and getting our hands dirty with some practical basic problems that will be used to build upon future challenges

  • Let us look at various important methods and concepts that will serve as our building blocks

ord() and chr() #

  • Ascii is a character encoding format that can be used to represent characters/letters. Each letter is assigned a number from 0-127

  • The ord() function in python can be used to convert ascii characters to their corresponding integers while chr() does the opposite.

>>> ord('A')
>>> ord('a')
>>> ord('B')
>>> chr(65)
>>> chr(97)

Challenge #

  • Using the below integer array, convert the numbers to their corresponding ASCII characters to obtain a flag.

[99, 114, 121, 112, 116, 111, 123, 65, 83, 67, 73, 73, 95, 112, 114, 49, 110, 116, 52, 98, 108, 51, 125]

Solution #

  • The solution is pretty straight-forward
  1. We define a function that takes in an array. Create a result array to store the output of our conversion
  2. Iterate through the int_array which is our input, use chr on each array item to get the corresponding ASCII value
  3. Append to our result and return the output
def convert(int_arr):
    res = []
    for i in int_arr:
    return res

if __name__=='__main__':
    print(convert([99, 114, 121, 112, 116, 111, 123, 65, 83, 67, 73, 73, 95, 112, 114, 49, 110, 116, 52, 98, 108, 51, 125]))

    # ['c', 'r', 'y', 'p', 't', 'o', '{', 'A', 'S', 'C', 'I', 'I', '_', 'p', 'r', '1', 'n', 't', '4', 'b', 'l', '3', '}']

Hex #

  • We’ve mentioned ASCII in our previous example. During encryption, it is common to end up with gibberish ASCII output. That is where hexadecimal comes in. It is a 16-bit number system which means it can represent ASCII in 16 digits/values.
  • To use hex effectively, let us see the different ways we can manipulate it.

bytes.fromhex() and .hex() #

  • These methods perform an easy conversion between hex and ascii

Note that .hex() only works with bytes and not strings

>>> bytes.fromhex('63727970746f7b596f755f77696c6c5f62655f776f726b696e675f776974685f6865785f737472696e67735f615f6c6f747d')
>>> output = b'crypto{You_will_be_working_with_hex_strings_a_lot}'
>>> output.hex()

Base64 #

  • Base64 is another common character encoding format used to represent ASCII in form of 64 characters where each character is equal to 6 bits

b64encode and b64decode() #

  • To use these methods in python you first import base64.
  • In the below example, we convert a hex string to ASCII bytes, then convert the bytes to bas64
>>> import base64
>>> bytes_converted = bytes.fromhex('72bca9b68fc16ac7beeb8f849dca1d8a783e8acf9679bf9269f7bf')
>>> base64.b64encode(bytes_converted)

Numbers and Bytes #

  • It is important to know how to handle numbers since some cryptosystems like RSA deal with mathematical computations so it is good to know how to convert characters to numbers

PyCryptodome #

  • This library comes packed with methods that will be useful for us.
  • You can install it with pip as shown


bytes_to_long and long_to_bytes #

  • These are methods that can be used to quickly convert between integers and bytes as shown:
>>> from Crypto.Util.number import *
>>> message = b'HELLO'
>>> bytes_to_long(message)
>>> long_to_bytes(310400273487)


  • One not both is how I quickly remember XOR operations. It is commonly denoted as or the caret operator ^
Input 1Input 2Output
  • When dealing with longer characters, we XOR bit by bit.
  • pwntools is a nice library that has an XOR method we can use to work with any data types.


>>> from pwn import *
>>> xor(b'abc',13)
>>> xor(13,13)
>>> xor(123,13)

XOR Properties #

  • Suppose a chain of encryptions were done on a plaintext and we have a resulting ciphertext, how do we go about reversing the ciphertext?
  • This is where the XOR properties come into play. There are 4 main properties to look into
  1. XOR is Commutative
  • the order does not matter
a ^ b = b ^ a
  1. XOR is Associative
  • When performing an XOR operation on three or more values, the order in which we group those values does not affect the result of the operation.
a ^ (b ^ c) = (b ^ a) ^ c = c ^ (a ^ b)
  1. Identity
  • An element XOR’d with 0 remains unchanged
a ^ 0 = a
  1. Self-inverse
  • An element XOR’d with itself evaluates to 0
a ^ a = 0

Challenge: Undoing chain of encyrptions #

  • Given the following chain of encryptions, find the FLAG value
KEY1 = a6c8b6733c9b22de7bc0253266a3867df55acde8635e19c73313
KEY2 ^ KEY1 = 37dcb292030faa90d07eec17e3b1c6d8daf94c35d4c9191a5e1e
KEY2 ^ KEY3 = c1545756687e7573db23aa1c3452a098b71a7fbf0fddddde5fc1
FLAG ^ KEY1 ^ KEY3 ^ KEY2 = 04ee9855208a2cd59091d04767ae47963170d1660df7f56f5faf

Solution #

  • Since we have the value of KEY1, we can calculate the rest as follows

Note that for all operations, we need to convert the hexadecimal to bytes before working with the data.

  1. Find the value of KEY2
  2. Find the value of KEY3
  3. Find the value of FLAG
>>> KEY1=bytes.fromhex('a6c8b6733c9b22de7bc0253266a3867df55acde8635e19c73313')
>>> KEY2=xor(KEY1,bytes.fromhex('37dcb292030faa90d07eec17e3b1c6d8daf94c35d4c9191a5e1e'))
>>> KEY3=xor(KEY2,bytes.fromhex('c1545756687e7573db23aa1c3452a098b71a7fbf0fddddde5fc1'))
>>> FLAG=xor(KEY1,KEY2,KEY3,bytes.fromhex('04ee9855208a2cd59091d04767ae47963170d1660df7f56f5faf'))
>>> FLAG

Challenge: Favourite Byte #

  • We have learnt some fundamentals in working with XOR. Let’s apply that to solve some more challenges

As mentioned for the millionth time, convert to bytes when given data

I’ve hidden some data using XOR with a single byte, but that byte is a secret. Don’t forget to decode from hex first:


Solution #

  1. We first convert our hex to bytes
  2. We mentioned that ASCII goes from 0-127 characters, we can iterate over that range converting each integer to ASCII bytes
  3. For each element converted to ASCII bytes, we XOR it with our target input
from pwn import *

def main(input_hex):
    input_bytes = bytes.fromhex(input_hex) #1
    for i in range(0,128): #2
        result = xor(input_bytes,chr(i).encode('utf-8')) #3
        if b'crypto' in result:

if __name__ == '__main__':
    main('73626960647f6b206821204f21254f7d694f7624662065622127234f726927756d') # b'crypto{0x10_15_my_f4v0ur173_by7e}'
  • I added a check to filter for the bytes ‘crypto’ which is part of the flag format that we expect in the output

Challenge: You either know, XOR you don’t #

  • This is an interesting challenge that relies on the partial knowledge of our output to get the key

Solution #

  1. We know part of the flag crypto{. We can begin by XORing that with the ciphertext and see if we get anything meaningful that can help us get the key
>>> from pwn import *
>>> flag = bytes.fromhex('0e0b213f26041e480b26217f27342e175d0e070a3c5b103e2526217f27342e175d0e077e263451150104')
>>> output = xor(flag,b'crypto')
>>> output
>>> output = xor(flag,b'crypto{')
>>> output
  • From the above you can see that we XOR’d using b’crypto’ then proceeded to add the bracket to b’crypto{’ and got an output that had some information that allows us to get the key
  1. We can take an educated guess and try using b’myXORkey’ which is part of the output of the secret and obtain the flag
>>> output = xor(flag,b'myXORkey')
>>> output
  • We get the flag


  • We have covered some basic building blocks that will serve to be very useful in understanding other cryptography concepts. See you in the next blog!