tl;dr

1. Find roots in a polynomial ring over $ mod;p $
2. Use Hensel’s Lifting lemma to find roots over $ mod;p^k $

tl;dr Known plaintext attack on a multithreaded AES-CTR

tl;dr

1. Extract data from given images using binwalk
2. Tranform given diophantine equation into a cubic curve and retrieve EC parameters
3. Solve ECDLP given in extracted data using Pohlig Hellman Algorithm

This school CTF had a good set of challenges for beginners

pwn1

32-bit executable, dynamically linked, not stripped

When you run the executable in the terminal, the program simple asks for an input and checks whether it is the secret it is looking for or not.

debugging in GDB…

1
2
3
4
5
6

gdb-peda$ checksec
CANARY    : disabled
FORTIFY   : disabled
NX        : ENABLED
PIE       : disabled
RELRO     : Partial

Going through the assembly code, we can see that see a gets() function. This gives us a chance to corrupt any stack address higher than the stack address where the gets() is to read into. We can also see a call to ‘print_flag’ function. This call instruction is executed only after a cmp instruction which compares [ebp-0xc] with ‘0xf007ba11’.

1
2
3

0x0804861d <+107>:	cmp    DWORD PTR [ebp-0xc],0xf007ba11
0x08048624 <+114>:	jne    0x804862d <main+123>
0x08048626 <+116>:	call   0x804854b <print_flag>

Hey, I am SpyD3r(@TarunkantG) and in this blog, I will be discussing the critical bug I have found in Quora which can compromise all users on Quora due to Horizontal Privilege Escalation.

tl;dr

1. CTR Bit Flipping
2. Break GHASH to get authentication key H (unintended approach)
3. Bypass authentication

Writeup from Junior 35c3CTF’18

Junior 35c3CTF 2018: pretty-linear

Category: Crypto
Challenge Points: 158
Solves: 28

Description:

1
2
3
4
5

The NSA gave us these packets, they said it should be just enough to break this crypto.

surveillance.pcap server.py

Difficulty estimate: Medium-Hard