#cryptography

Argon2id is deliberately slow. That's not a limitation — it's the entire design goal. For key...

The problem with "trust me, I picked randomly" Every online prize draw has the same weak...

If you've ever been curious about how encryption works at a basic level, the Caesar Cipher is a great...

The flag is XOR-encrypted with a short repeating key. Since we know every picoCTF flag starts with...

Unlike Caesar, each letter is replaced by a different letter according to an arbitrary mapping (not a...

Hardware Security Modules sit at the very bottom of your key management stack — and yet most...

The Caesar cipher has exactly 26 possible shifts (modulo the 26 letters of the alphabet). A Python...

This article introduces ntlmrain, a project designed to optimize NetNTLMv1 rainbow table lookups. By...

Verbose is a small proof-carrying language whose compiler is written in itself. Its TLS 1.3 design doc claimed 'no cryptography in the host' — and its own section 7 proved that false: six computations still lived in Python. They are now six Verbose rules with zero compiler changes, including a constant-time tag comparison where sixteen XORs fold into each other and never branch. Why a plain if would leak the secret, and the oracle that settles it: a real handshake against openssl.

The security industry recently saw the release of optimized NetNTLMv1 rainbow tables, which...

ZK proofs sound like magic. This guide explains the core idea, the real use cases, and what a developer actually needs to understand in 2026.

A researcher factored a real 1999 Certificate Authority's 512-bit RSA keys on a $300 desktop CPU in 32 hours — then forged a working cert with it. Here's what that means for every legacy trust root still sitting in your fleet.