Abstract

This article explains why AES-256 and SHA-384/512 serve as the concrete safe floor for post-quantum security, and how NIST uses them as reference points. It describes the five NIST security categories, each defined by the computational cost of a specific symmetric attack: Category 1 as hard as key-searching AES-128, Category 2 as hard as finding a SHA-256 collision, Category 3 as AES-192 key search, Category 4 as a SHA-384 collision, and Category 5 as AES-256 key search. It explains why symmetric primitives are chosen as the anchors — they are the best-understood, most conservatively analyzed constructions in cryptography, with decades of cryptanalysis finding no attacks better than generic ones, so their quantum cost (Grover for keys, the birthday bound for collisions) gives firm, defensible floors. It works through the concrete top-level margins: AES-256 gives about 128-bit quantum security against Grover, and SHA-384 gives about 192-bit collision resistance, which are the reference points for the highest categories. It closes on practical guidance and the AI stakes: match the security category to the data's protection lifetime, and anchor the most valuable, longest-lived model and data assets to the AES-256 / SHA-384 top floor. The theme: the post-quantum security scale is calibrated against symmetric primitives because they are the sturdiest yardstick available, and AES-256 with SHA-384 is the top of that scale.

When NIST specifies how strong a post-quantum scheme must be, it does not state a number of bits in the abstract; it says the scheme must be at least as hard to break as attacking AES or SHA at a given size. Symmetric primitives are the yardstick against which all post-quantum security is measured, and AES-256 with SHA-384 sits at the top of that scale as the concrete safe floor. This article explains the NIST security categories, why symmetric primitives were chosen as the anchors, and the concrete margins that make AES-256 and SHA-384/512 the reference point for the highest levels.

The NIST security categories

NIST's post-quantum standardization defines five security categories, each pinned to the cost of a concrete symmetric attack rather than an abstract bit count. Category 1 requires that breaking the scheme be at least as hard as recovering an AES-128 key by exhaustive search. Category 2 pins to finding a collision in SHA-256. Category 3 is AES-192 key search, Category 4 is a SHA-384 collision, and Category 5 is AES-256 key search. A candidate post-quantum scheme is classified by which of these symmetric attacks its best known attack is at least as expensive as.

This design is deliberate and clever. By defining security relative to specific, well-studied primitives, NIST sidesteps the difficulty of estimating abstract quantum bit-security for novel lattice or hash problems in isolation. Instead of arguing that a scheme has, say, exactly 128 bits of quantum security, one argues that attacking it costs at least as much as running Grover against AES-128 — a quantity that can be estimated with reasonable confidence because AES is so heavily studied. The categories turn a hard absolute question into an easier comparative one.

The odd-numbered categories anchor to key search (AES) and the even-numbered ones to collision finding (SHA), reflecting the two kinds of symmetric hardness the previous articles analyzed. The categories increase in strength from 1 to 5, and a scheme aiming at long-term security targets the higher categories. The table lays out the anchors, and the whole scale rests on treating symmetric primitives as the reference standard.

The odd NIST categories are pinned to AES key search at increasing key sizes, from AES-128 to AES-256. The AES anchors of the odd categories Category 1= AES-128 Category 3= AES-192 Category 5= AES-256 higher security →
The odd NIST categories are pinned to AES key search at increasing key sizes, from AES-128 to AES-256.
The five NIST post-quantum security categories and their symmetric anchors.
CategoryAnchorAttack type
1AES-128key search
2SHA-256 collisioncollision
3AES-192key search
4SHA-384 collisioncollision
5AES-256key search

Why anchor to symmetric primitives

Symmetric primitives are chosen as the anchors because they are the most conservatively understood constructions in all of cryptography. AES has been the subject of intense public cryptanalysis for over two decades, and SHA-2 and SHA-3 for comparable spans, and in that time no attack meaningfully better than generic brute force or the generic birthday bound has been found against the full-round primitives. That track record gives their security estimates a solidity that newer, less-studied problems cannot yet match.

This matters because the quantum cost of attacking them is then well-defined. If the best attack on AES is generic key search, then the best quantum attack is Grover, whose cost is calculable; if the best attack on SHA collisions is the generic birthday method, then the quantum cost is governed by the birthday bound and the memory-limited BHT analysis. There are no lurking algebraic shortcuts to worry about, so the floor these primitives set is a firm one — a lower bound on attack cost that is unlikely to erode.

Anchoring novel post-quantum schemes to these sturdy references imports that confidence. A lattice scheme's own security estimate carries the uncertainty of a younger field where cryptanalysis is still advancing, but by requiring it to be at least as strong as AES-256 key search, NIST ensures that even if the lattice estimate is somewhat optimistic, the scheme still clears a floor defined by the best-understood primitive available. The symmetric world is the bedrock precisely because it is the part of cryptography we are most sure about.

Decades of cryptanalysis with no better-than-generic attacks give AES and SHA firm, calculable quantum-cost floors. Why symmetric primitives are the yardstick Symmetric anchorsconservative floors Best understooddecades of study No shortcutsgeneric attacks only Firm cost floorsGrover and birthday
Decades of cryptanalysis with no better-than-generic attacks give AES and SHA firm, calculable quantum-cost floors.

The concrete top-level margins

The two primitives at the top of the scale set concrete margins. AES-256, anchoring Category 5, gives about 128 bits of quantum security: Grover reduces its 256-bit key search to about 2^128 operations, a level considered safely out of reach, and the parallelization and depth caveats from the first article make the real cost even higher. SHA-384, anchoring Category 4, gives about 192 bits of collision resistance from the birthday bound on its 384-bit output, essentially unchanged by quantum since collision finding is not meaningfully accelerated. These are the sturdiest floors the categories offer.

The pairing is deliberate: Category 5 with AES-256 for confidentiality and the corresponding SHA-384 or larger for integrity together define the top-tier symmetric posture. A system built on AES-256 for encryption and SHA-384 for hashing has, by construction, symmetric security at the highest category, and any post-quantum public-key scheme it uses should be chosen at a matching category so the whole stack is balanced. There is no point pairing Category 5 symmetric security with a Category 1 key-establishment scheme; the weakest link governs.

It is worth restating how comfortable these margins are. 128-bit quantum security means an attack requiring on the order of 2^128 deep, sequential, unparallelizable quantum operations — utterly infeasible for any foreseeable machine — and 192-bit collision resistance is far beyond that. The top symmetric floor is not a nervous minimum but a generous margin, which is exactly why it can serve as the anchor for the highest security category: it is the level at which cryptographers are confident nothing, classical or quantum, gets through.

AES-256 gives about 128-bit quantum security for confidentiality; SHA-384 gives about 192-bit collision resistance for integrity. The top-tier symmetric floors AES-256Category 5 128-bit quantumGrover floor SHA-384Category 4 192-bit collisionbirthday floor
AES-256 gives about 128-bit quantum security for confidentiality; SHA-384 gives about 192-bit collision resistance for integrity.

Practical guidance, and the AI stakes

The practical rule is to match the security category to the data's protection lifetime. Data whose confidentiality must last decades — the harvest-now-decrypt-later targets — should be protected at the top category: AES-256 encryption, SHA-384 or larger hashing, and post-quantum public-key schemes chosen at Category 5. Data with a short shelf life can tolerate lower categories, though the cost of simply using the top-tier symmetric primitives is so small that defaulting to AES-256 and SHA-384 for anything nontrivial is usually the sensible choice. The symmetric floor is cheap insurance.

The balance across the stack is the subtlety to watch. A migration that upgrades the public-key layer to a high post-quantum category but leaves symmetric encryption at AES-128, or hashing at a 256-bit output where collision resistance is the binding property, has a weakest link below the intended level. Sizing every layer — key exchange, signatures, symmetric encryption, and hashing — to the same category is what actually delivers the target security, and the symmetric anchors are the reference that makes the categories commensurable across those very different primitives.

For AI the guidance lands on the most valuable, longest-lived assets. Model weights represent enormous training investment and may need protection for many years; long-lived training-data archives may hold sensitive data with decade-scale sensitivity; and the integrity of both, along with the supply chain that produces them, depends on hashing. These are precisely the assets to anchor at the top floor — AES-256 for confidentiality, SHA-384 for integrity, Category 5 post-quantum key establishment — because their protection lifetime is exactly the horizon over which quantum computers may arrive. The reassuring conclusion of the symmetric analysis is that this top floor is cheap, well-understood, and already available: securing AI's crown jewels against the quantum era, on the symmetric side, is a matter of choosing the largest standard parameters, and those parameters — AES-256 and SHA-384 — are the safe floor the whole post-quantum scale is measured against.

The top floor is cheap and available. NIST's security categories are pinned to AES and SHA attack costs, with Category 5 (AES-256, about 128-bit quantum) and SHA-384 (about 192-bit collision) as the top floor. Anchor the most valuable, longest-lived model weights and training archives here — the largest standard symmetric parameters — and size every layer of the stack to the same category.

Key takeaways

  • NIST defines five post-quantum security categories by the cost of a concrete symmetric attack, not an abstract bit count.
  • Odd categories anchor to AES key search (1: AES-128, 3: AES-192, 5: AES-256); even categories anchor to SHA collisions (2: SHA-256, 4: SHA-384).
  • Symmetric primitives are chosen as anchors because decades of cryptanalysis found no better-than-generic attacks, giving firm, calculable quantum-cost floors.
  • AES-256 gives about 128-bit quantum security (Grover); SHA-384 gives about 192-bit collision resistance (birthday) — the top-tier margins.
  • Match the security category to the data's protection lifetime, and size every layer of the stack to the same category so there is no weakest link.
  • Anchor AI's most valuable, longest-lived assets — model weights, training archives, and their integrity hashes — to the AES-256 / SHA-384 top floor.

Practitioner Toolkit

Copy-paste, strictly defensive artifacts you can use today. Nothing here attacks a real system.

Sizing to the safe floorchecklist

Questions for choosing a security category.

  • What is the protection lifetime of the data, and does it reach past quantum arrival?
  • Is confidentiality anchored to AES-256 for long-lived data (Category 5)?
  • Is integrity anchored to SHA-384 or larger where collision resistance binds (Category 4+)?
  • Is the post-quantum public-key scheme chosen at a matching category?
  • Is every layer of the stack sized to the same category, with no weakest link?
🚀The safe-floor mental modelquickstart

Three facts to hold onto.

  • NIST categories are pinned to AES and SHA attack costs.
  • Top floor: AES-256 (about 128-bit quantum), SHA-384 (about 192-bit collision).
  • Match the category to the data's lifetime and balance the whole stack.
🔒Security-category stancepolicy

A stub recording the floor policy.

security_category:
  anchors:
    cat1: aes_128
    cat3: aes_192
    cat5: aes_256
    cat2: sha_256_collision
    cat4: sha_384_collision
  long_lived_default:
    confidentiality: aes_256
    integrity: sha_384
    public_key: category_5
  rule: balance_all_layers_to_same_category
Illustrative documentation template, not a product config.

Glossary

NIST security category
One of five post-quantum strength levels, each defined by the cost of a specific AES key search or SHA collision attack.
Symmetric anchor
The well-studied primitive (AES or SHA) whose attack cost defines a security category, chosen for its conservative track record.
Category 5
The highest NIST category, as hard to break as recovering an AES-256 key — about 128-bit quantum security.
Category 4
A NIST category as hard as finding a SHA-384 collision — about 192-bit collision resistance.
Safe floor
AES-256 for confidentiality and SHA-384/512 for integrity, the top-tier symmetric parameters that anchor the highest categories.
Balanced stack
Sizing key exchange, signatures, symmetric encryption, and hashing all to the same security category to avoid a weakest link.

References

  1. NIST, Submission Requirements and Evaluation Criteria for the PQC Standardization Process (security categories)
  2. NIST FIPS 197, Advanced Encryption Standard (AES)
  3. NIST FIPS 180-4, Secure Hash Standard (SHA-2)
  4. Grassl, Langenberg, Roetteler, Steinwandt, Applying Grover's Algorithm to AES: Quantum Resource Estimates (PQCrypto 2016)
  5. NIST SP 800-57 Part 1 Rev. 5, Recommendation for Key Management