Research seriesL3algorithms
The post-quantum conversation over-focuses on public-key. The symmetric and hash world also shifts under quantum attack, but far less dramatically, and the exact size of the shift is a clean, quantifiable result. This series works through Grover against block ciphers, quantum search against hash functions, the AES-256 and SHA-384 safe floor, key commitment, and the symmetric primitives quietly holding up the PQC standards themselves. Grounded in Grover, Brassard-Hoyer-Tapp, and the NIST FIPS standards.
Quantum computers do not break symmetric encryption the way they break public-key. Grover's algorithm only halves the effective key length, and parallelization caveats soften even that.
Quantum search halves a hash's pre-image resistance, like a key. But collision resistance behaves differently: the naive quantum speedup barely applies, because of memory costs.
NIST defines post-quantum security by reference to the cost of attacking AES and SHA. Understanding those anchors — and why AES-256 and SHA-384 are the top floor — clarifies the whole scheme.
AEAD gives confidentiality and integrity at once, but standard schemes are not key-committing: one ciphertext can decrypt to valid plaintexts under two keys. In multi-key and agent settings that gap bites.
The symmetric and hash world is not a sideshow to the post-quantum story — it is the bedrock. Even the new lattice standards, and the most conservative signatures, rest on it.