đ Encryption â Security
Just because somethingâs encrypted doesnât mean itâs secure. We saw that play out - painfully clearly - during Google CTF 2025.
đ Last month, our team took on a challenge called "crypto-numerology".
At first glance, it looked solid: a stream cipher modeled after ChaCha20. It had proper constants, key/nonce structure, and ciphertext that looked convincingly random.
But there was one critical detail.
đ It only used one round of mixing.
That one shortcut changed everything.
With a known key and a few plaintextâciphertext pairs, we could fully recover keystream blocks. From there, it only took a small brute-force over a 32-bit counter to reveal the flag.
No fancy math. No deep exploit chain.
Just a cipher that looked like encryption - but offered none of its guarantees.
đ What struck me most was how realistic this failure felt.
This wasnât just a broken CTF challenge.
It was a reflection of how real-world systems break:
- âOne round should be fine.â
- âNobody will reuse this nonce.â
- âItâs just for internal use.â
Security doesn't usually break in dramatic ways - it rots quietly, through shortcuts and assumptions that go unchallenged until itâs too late.
đ§ Takeaway:
- In cryptography, almost secure means completely broken.
- True security means refusing to compromise - even when itâs tempting.
đ If you're interested in the technical breakdown, we shared the full write-up here:
đ https://ctftime.org/writeup/40328