ctfs
  • 👋Hello!
  • 🏴Practice
    • 🌐Cryptohack
      • Introduction
      • General
        • Encoding
        • XOR
        • Mathematics
        • Data Formats
      • Symmetric Ciphers
        • How AES Works
        • Symmetric Starter
        • Block Ciphers 1
        • Stream Ciphers
      • Mathematics
        • Modular Math
        • Lattices
      • RSA
        • Starter
        • Primes Part 1
        • Public Exponent
    • 🌐PortSwigger
      • Path Traversal
      • File Upload
      • SSRF Attacks
    • 🌐TryHackMe
      • Basic Skills
      • Linux
      • Penetration Testing
      • Networking
      • OSINT
  • 🚩Competitions
    • 2025
      • 🇮🇩GKSK#9 Osintathon
        • Mudik Lebaran (100 pts)
        • Foto Patung (100 pts)
        • Kolektor Komik (100 pts)
        • Tolong Aku (100 pts)
        • Kencan Pertama (100 pts)
        • Nama Si Pelaku (100 pts)
        • Cekidot (100 pts)
        • Ledakan! (100 pts)
        • 🎹🎶 (100 pts)
        • Batu Besar (100 pts)
        • Komentar (100 pts)
        • Ini dimana? (100 pts)
        • Koordinat Foto Misterius (100 pts)
        • Bianglalaaa (100 pts)
        • Aku Hacker (100 pts)
        • Anjazzz (100 pts)
        • Dikirim Kakakku (129 pts)
        • Ingfo Loker (154 pts)
        • MISSING 00 (100 pts)
        • MISSING 01 (154 pts)
        • Siapa Aku? (154 pts)
      • 🇮🇩IFEST 13
        • Ququerer (250 pts)
        • Silent Trace (370 pts)
        • Nugas (Solved After Event)
        • Free Flag (280 pts)
        • Brute (Solved After Event)
        • Web V1 (Solved After Event)
        • Bypass (Solved After Event)
        • Orbiter (Solved After Event)
      • 🌐OSINT Combine (Wildlife)
        • Getting Started (100 pts)
        • Proper Poppy (100 pts)
        • Legendary Beasts (200 pts)
        • Shadow Fleet (200 pts)
        • Proper Poppy II (200 pts)
        • Not So Smug Smuggler (200 pts)
        • Icy (200 pts)
        • Forest Pals (200 pts)
        • Safari Time II (200 pts)
        • Sneaky! (200 pts)
        • Hello Friend (300 pts)
        • Busy As A (300 pts)
        • Get Rotated! (300 pts)
        • High Seas (300 pts)
        • Nocturnal (300 pts)
        • Safari Time (400 pts)
        • Peak Weather (400 pts)
        • Singsong (400 pts)
        • Falling Fell (500 pts)
        • Kitty Cats (500 pts)
      • 🇮🇩RECURSION
        • let him cook
        • Basic Math
        • Favourite Number
        • Zarrar Cipher (100 pts)
        • paBlue Team (100 pts)
        • [🩸] I wish I was there on December 21, 2024 (100 pts)
        • Small House (200 pts)
        • [🩸] Mission Difference (456 pts)
    • 2024
      • 🌐Santa Claus CTF
        • Complete Picture
        • Day 1 - Big Bang
        • Day 2 - The Summer Job
        • Day 3 - The Visitors
        • Day 4 - Happy Birthday
        • Day 5 - Say My Name
        • Day 6 - Say "Cheese"
        • Day 7 - Revealing Pixels
        • Day 8 - Connecting The Dots
        • Day 9 - 404 Not Found
        • Day 10 - Breaking News
        • Day 11 - Ayrton Santa
        • Day 12 - Lost and Found
        • Day 13 - Planespotting
        • Day 14 - Santa Surveillance
        • Day 15 - Shaken, Not Stirred
        • Day 16 - Status Update
        • Day 17 - Waste ...of Time
        • Day 18 - Lost in Translation
        • Day 19 - Santa's Clones
        • Day 20 - Losing Tracks
        • Day 21 - Sing my Song
        • Day 22 - Eagle Eye
        • Day 23 - Distances Matters
        • Day 24 - Mastermind
      • 🌐Cyber Jawara International
        • Stone Game (100 pts)
        • prepare the tools (176 pts)
        • Persona (484 pts)
      • 🌐OSMOSIS Precon CTF
        • 1 The art of espionage
        • # 2 The Hack
        • # 3 The rabbit hole
        • # 4 The Association
        • # 6 Where is number 5
        • # 5 Who is it
        • Too many Layers
        • The prize
      • 🇮🇩Intechfest
        • Sanity Check (100 pts)
        • Alin (113 pts)
        • GerakSendiri (106 pts)
        • Details (100 pts)
      • 🇮🇩COMPFEST 16
        • Let's Help John! (100 pts)
        • money gone, wallet also gone (100 pts)
        • head’s up! (493 pts)
        • CaRd (304 pts)
        • Sanity Check (100 pts)
      • 🇮🇩Gemastik
        • Baby AES (451 pts)
        • Baby Structured (100 pts)
      • 🇮🇩Technofair 11
        • Kenangan
        • Xorban
        • Marsha
        • Siap Tempur!!
        • eftipi
        • kurang berarti
        • DUMPling
        • Malicious
      • 🌐DIVER OSINT
        • chiban
      • 🇮🇩GKSK#8 Osintathon
        • Sport Location
        • Meklaren lu warna apa boss ?
        • Postcode
        • Rumah Minang
        • Latihan
        • Anak Misterius
        • Travelling Anywhere
        • The Thief
        • Danger Watch
        • Misteri Ruang Angkasa
        • Fun Walk
        • I am Late
        • My Oshi
        • Wellcome to my Youtube Channel
        • Pesan Tersembunyi Wingdings
        • Salah Fokus
        • Apa itu GKSK?
        • Foto Bersejarah
        • Picture
        • Nostalgia Child
        • oldschool
        • Summer Olympic
      • 🇮🇩Techcomfest
        • pemanasan
        • crackable
        • Kuli-ah forensik
    • 2023
      • 🇮🇩Cyber Jawara
        • daruma
      • 🇮🇩NCW
        • Simple (220 pts)
        • wangsaf (320 pts)
        • Sillyville Saga (220 pts)
        • Freminhelp (Solved after event)
      • 🇮🇩Hology 6
      • 🇮🇩SlashRoot 7
        • Summary (441 pts)
        • eeee (480 pts)
        • Zebra Cross (409 pts)
        • Waka Waka eh eh (185 pts)
        • ANABUL (250 pts)
      • 🇮🇩COMPFEST 15
        • not simply corrupted (316 pts)
        • Artificial secret (356 pts)
      • 🇮🇩Gemastik
        • easy AES
        • k-1
        • Gen Z
      • 🇮🇩TechnoFair 10
        • RSA Bwang
        • Marsah
        • rapsodi
        • Pengen Merch JKT 😢
        • space mono
        • file pemberian fans
        • bantu aku mencari sebuah rahasia
    • 2022
      • 🇮🇩NCW
        • sabeb64 (331 pts)
        • cakemath (451 pts)
        • Downloader (244 pts)
        • 199 passcode (Solved after event)
      • 🇮🇩TEDCTF
      • 🇮🇩Gemastik
      • 🇮🇩OSCCTF
      • 🇮🇩ARA
  • 🪦Old Hello
Powered by GitBook
On this page
  1. Competitions
  2. 2024
  3. Gemastik

Baby AES (451 pts)

I recently learned about AES encryption, and now I'm offering an AES encryption service to anyone. Please provide a message that you would like encrypted.

Author: Chovid99

nc ctf.gemastik.id 10004

Pada soal ini, kita diberikan source code serta sebuah service oracle.

#!/usr/local/bin/python

from Crypto.Cipher import AES
from Crypto.Util.Padding import pad
import os

def encrypt(key, pt):
	cipher = AES.new(key, AES.MODE_CBC)
	ct = cipher.decrypt(pad(pt, 16))
	return cipher.iv + ct

print(f'Welcome to the AES CBC Machine')
print(f'Give me some input, and I will encrypt it for you')

with open('flag.txt', 'rb') as f:
    flag = f.read().strip()
assert len(flag) == 67

key = os.urandom(16)
out = encrypt(key, flag)
print(f'This is the example of the encryption result: {out.hex()}')
while True:
    msg = bytes.fromhex(input('Give me your message: '))
    print(f'Encryption result: {encrypt(key, msg).hex()}')

Ada beberapa hal yang bisa dicatat sejauh ini:

  • Mode AES yang digunakan adalah CBC.

  • Pada fungsi “encrypt(key, pt)”, method yang digunakan adalah decrypt(), bukan encrypt().

  • Panjang flag persis 67, artinya ada 4 block + block kelima yang berisi 2 karakter tertentu, karakter ‘}’, dan sisanya padding.

  • Pada oracle, key yang sama dengan key untuk meng-encrypt flag digunakan berulang kali.

Karena menggunakan fungsi decrypt untuk meng-encrypt, maka alurnya menjadi seperti berikut.

Jika kita bisa mengetahui nilai dk5, kita akan mendapatkan nilai pt4. Jika kita tahu nilai pt4, kita bisa menghitung dk4 dan mendapatkan pt3, begitu seterusnya.

Kita bisa mendapatkan dk5 dengan memanfaatkan oracle yang diberikan. Kita akan mencoba semua kemungkinan kombinasi 2 karakter dari flag aslinya lalu memasukkannya ke oracle. Katakanlah hasilnya et5, nah kita bisa mendapatkan dk5 dengan melakukan xor antara et5 dengan iv yang digunakan oracle pada saat itu. Cara kita memastikan bahwa kombinasinya benar adalah dengan mencoba decode hasil pt4-nya dan memastikan bahwa string pt4 tersebut terdiri dari 100% karakter printable.

Berikut adalah kode untuk mendapatkan dua karakter flag tersebut.

from pwn import *
import string
from Crypto.Util.number import *

def hex_xor(hex_a, hex_b):
	a = bytes.fromhex(hex_a)
	b = bytes.fromhex(hex_b)
	result = ""
	for a,b in zip(a,b):
		result += format(a^b, "02x")
	return result

r = remote('ctf.gemastik.id', 10004)

# dapatkan encrypted flag
r.recvuntil(b'result: ')
ct = r.readline().decode()
iv = ct[:32]
ct1 = ct[32:64]
ct2 = ct[64:96]
ct3 = ct[96:128]
ct4 = ct[128:160]
ct5 = ct[160:-1]	# -1 untuk menghilangkan \n

# dapatkan pt5
chars = string.printable 	# list char yang dicoba
for a in chars:
	break_status = False
	for b in chars:
		try_string = (a + b + '}').encode()
		r.recvuntil(b'message: ')
		r.sendline(try_string.hex())
		r.recvuntil(b'result: ')
		result = r.recvline()
		iv = result[:32].decode()
		et5 = result[-33:-1].decode()
		print(iv)
		dk5 = hex_xor(iv, et5)

		# xor dk5 dengan ct5
		pt4 = hex_xor(dk5, ct5)
		print(try_string)
		print(pt4)
		try:	
			if bytes.fromhex(pt4).decode().isprintable():
				print("YESSS!!")
				print(try_string)
				print(bytes.fromhex(pt4).decode())
				break_status = True   # untuk nge-skip double for loop
				break
			else:
				assert 1 == 0 # jika pt4 tidak printable, maka ke ’except’
		except:
			continue
	if break_status:
		break

Karena pt5 dan pt4 sudah didapatkan, berikutnya tinggal melanjutkan alur penyelesaian yang sudah saya sebutkan sebelumnya. Berikut adalah kode solver full-nya.

from pwn import *
import string
from Crypto.Util.number import *

def hex_xor(hex_a, hex_b):
	a = bytes.fromhex(hex_a)
	b = bytes.fromhex(hex_b)
	result = ""
	for a,b in zip(a,b):
		result += format(a^b, "02x")
	return result

r = remote('ctf.gemastik.id', 10004)

# dapatkan encrypted flag
r.recvuntil(b'result: ')
ct = r.readline().decode()
iv = ct[:32]
ct1 = ct[32:64]
ct2 = ct[64:96]
ct3 = ct[96:128]
ct4 = ct[128:160]
ct5 = ct[160:-1]	# -1 untuk menghilangkan \n


# pt5 telah didapatkan sebelumnya
pt = 'Zz}'
ct = [ct5, ct4, ct3, ct2, ct1]

flag = pt

# dapatkan pt4, pt3, pt2, pt1
for i in range(4):
	r.recvuntil(b'message: ')
	r.sendline(pt.encode().hex().encode())
	r.recvuntil(b'result: ')
	result = r.recvline()
	iv = result[:32].decode()
	et = result[32:-1].decode() # xor dengan iv
	dk = hex_xor(iv, et)
	pt = bytes.fromhex(hex_xor(dk, ct[i])).decode()
	flag = pt + flag

print(flag)

Flag: gemastik{i_am_so_sorry_coz_it_should_be_encrypt_not_decrypt_bZzZ Zz}

PreviousGemastikNextBaby Structured (100 pts)

Last updated 4 months ago

🚩
🇮🇩