ANKASecure© turns the next cryptographic change into a policy operation. Applications invoke stable capabilities against stable key identifiers; three policies govern the mechanism behind them: algorithm availability (list, family, category, security level, standards body, operations), algorithm rotation (no downgrade, no return from post-quantum to classical) and key lifecycle (superseded and retired material keeps decrypting and verifying while new encryption and signing are denied; a key revoked for an algorithm deprecation keeps its history readable, one revoked for compromise is sealed). Re-encryption and re-signing move protected data to a new mechanism without the applications that created it, and every operation is recorded with its algorithm and key. The Cryptographic Response Gap, from the change in a mechanism’s acceptability to the end of its remediation, is set by that architecture rather than by the algorithm.

Every cryptographic change costs you a project per application.

Nobody asks for crypto-agility by name. What they live with is this: when an algorithm has to change it is a code change, a regression cycle, a security validation and a release — multiplied by every application that uses it. So the change is deferred, and the estate keeps running on what it should already have left behind. ANKASecure© turns that change into a policy operation.

CISOHead of cryptographyEnterprise architect

The question is not whether cryptography will change. It is how much of your enterprise has to change when it does.

Is this you

Three ways this lands on your desk

An algorithm has to go

Deprecated, broken, or refused by a customer questionnaire. The incident has a clock, and your honest answer is a release calendar across every application that touches it.

Two jurisdictions, two approved lists

A subsidiary under BSI needs hybrid. A federal contract names CNSA 2.0. An operation in Japan runs on CRYPTREC. Today that means separate stacks, or exceptions nobody wants to sign.

You want to raise the level and cannot justify a release

No vulnerability, no incident — just a posture you would rather have. Without a forcing event the change never reaches a sprint, and the gap between what you run and what you would choose keeps widening.

Who signs this: A CISO or head of cryptography who will be asked how fast the organization can move, and an enterprise architect who knows what a change across two hundred applications actually costs. If the answer to “how long to leave this algorithm?” is measured in quarters, this is the conversation.

Why existing approaches fall short

Migration changes the algorithm. Agility changes what the next change costs.

An organization can complete a full post-quantum migration and still not be crypto-agile, because changing the algorithm does not change the architecture that made the change expensive. Key rotation, algorithm migration and crypto-agility are three different capabilities.

  • What changes

    Key rotation
    The key material
    Algorithm migration
    The algorithm
    Crypto-agility
    The governed mapping between a use and its mechanism
  • Example

    Key rotation
    RSA key A → RSA key B
    Algorithm migration
    RSA → ML-DSA
    Crypto-agility
    The policy for “sign invoices” moves from RSA to hybrid to ML-DSA
  • What the application must do

    Key rotation
    Usually nothing, if keys are managed externally
    Algorithm migration
    Change code, libraries, formats, tests and release
    Crypto-agility
    Nothing, if it consumes a stable cryptographic capability
  • How often it can happen

    Key rotation
    Routinely
    Algorithm migration
    Once per program
    Crypto-agility
    Whenever acceptability changes

The 200-application problem

An organization migrates 200 applications from RSA and elliptic curves to Algorithm X: each one analyzed, its code changed, a new library tested, certified and deployed. Three years, and it succeeds. The year after, Algorithm X stops being acceptable for one of its uses, and the same 200 applications have to be modified again. It completed a migration; it did not achieve agility. Migration answers which algorithm comes next; agility answers how expensive it will be to change that answer again.

Five warnings in four years. Not one required a quantum computer.

  • Rainbow

    Status before
    Finalist, NIST post-quantum Round 3 (signatures)
    What happened
    Classical key recovery on a laptop for one parameter set
    Time to reassessment
    February 2022, during Round 3
    Quantum computer needed
    No
  • SIKE

    Status before
    Advanced to NIST Round 4 (KEM), July 2022
    What happened
    Classical key recovery in about ten minutes on one core
    Time to reassessment
    Under a month after advancing
    Quantum computer needed
    No
  • HAWK

    Status before
    Advanced to Round 3 of NIST’s additional signatures, May 2026
    What happened
    An AI-assisted analysis halved its effective key size; withdrawn
    Time to reassessment
    About eleven weeks
    Quantum computer needed
    No
  • Classic McEliece

    Status before
    1978 design; ISO/IEC standard, June 2026; BSI-recommended since 2020
    What happened
    A wave of structural cryptanalysis; BSI advises against new use
    Time to reassessment
    About three months after ISO
    Quantum computer needed
    No
  • RSA signing oracle

    Status before
    Decades of deployment
    What happened
    A 2007 technique executed at scale against a real HSM
    Time to reassessment
    Nineteen years from theory to practice
    Quantum computer needed
    No

Classic McEliece was not broken. It stopped being acceptable for new use.

The estimated cost of the best published structural attacks on Classic McEliece, for the parameters BSI recommends, as BSI summarized it in September 2026: above 2³⁰⁰⁰ for decades, and 2⁹⁹ to 2¹⁰² in a 2026 preprint. The newest results have not completed peer review and none enables a practical attack, yet BSI advised against Classic McEliece in new developments. Three of the five cases were candidates that never became standards, and ML-KEM and ML-DSA are not affected by any of them. The point is that the assessment moves, on its own schedule.

Bar chart of estimated attack costs on Classic McEliece for BSI-recommended parameters, in bits: support splitting above 3000, syzygy distinguisher 683, higher-order vanishing 550, quasipolynomial distinguisher 120 to 124, heuristic key recovery 140 to 148 and improved key recovery 99 to 102, the last three not yet peer-reviewed, against BSI’s 120-bit target.

How it works

One stable capability, three policies and a governed exit

Applications express what they need; policy decides which mechanism serves it, and enforces that decision where the cryptography executes.

  1. Applications invoke a stable capability

    Encrypt, decrypt, sign and verify against a stable key identifier. A rotation advances to a new material version under the same identifier, and that version may use a different algorithm within the same purpose family, with no change to the application.

    • stable key identifier
    • encrypt · decrypt · sign · verify
  2. Algorithm availability policy

    Which algorithms may be used: by explicit list, family, category (classical, post-quantum or hybrid), security level, mandatory standards body or permitted operations. A hybrid-only profile implements a BSI-style requirement as policy rather than code, and a change propagates in under a second.

    • deployment and tenant
    • hybrid-only profiles
  3. Algorithm rotation policy

    Which transitions are allowed, for example forbidding a security downgrade or a return from post-quantum to classical algorithms. The server computes whether a move is admissible before you make it.

    • no downgrade
    • no post-quantum → classical
    • admissibility preview
  4. Key lifecycle policy

    Which operations each state permits. Superseded and retired material keeps decrypting and verifying while new encryption and signing are denied; a key revoked because its algorithm was deprecated keeps its history readable, while a key revoked for compromise is sealed on every operation.

    • ALGORITHM_DEPRECATED
    • SECURITY_COMPROMISE
  5. Re-encryption and re-signing

    Information protected under an old mechanism moves to a new one without the applications that created it, including streaming operations for large objects. The exit becomes a process, not a program.

    • re-encrypt
    • re-sign
    • streaming
  6. Evidence of cryptographic state

    Every operation is recorded with its algorithm and key in a signed audit trail. Showing that a mechanism has applied no new protection since a given date is a query, not an audit of individual applications.

    • signed audit trail

Agility done right

The critics are right. About the wrong kind of agility.

Adam Langley argued that extensibility adds code, bugs and dangerous interactions, and tends to fail when it is finally needed. RFC 7696 warns that negotiation creates downgrade attacks and that supporting too many algorithms is harmful. NIST acknowledges that agility adds complexity. They point to a specific kind of agility, not away from it.

Governed, not negotiated

The mechanism for a use is decided by policy and enforced centrally, not negotiated per session between parties that can be pushed toward the weakest option.

Curated, not exhaustive

A small set of approved mechanisms per use. Agility does not mean supporting everything.

One joint, well exercised

Change happens at a single governed point, used routinely, so that it works when it is needed.

Exit as a first-class operation

Deprecated mechanisms are removed from new use deliberately, not left lying around as fallbacks.

Hybrid constructions, which combine a post-quantum mechanism with a classical one so that both must be broken, are a hedge: BSI notes that its hybrid recommendation proved its worth when Classic McEliece weakened. Hybrid buys time; agility is what makes hybrid configurations practical to introduce, adjust and retire.

The cryptographic response gap

The algorithm sets your exposure on the day of the change. The architecture sets it on every day after.

The Cryptographic Response Gap runs from T0, when the assessment, the standard or the acceptable-use status of a mechanism changes for a given use, to T1, when the organization has finished remediating it: no new protection applied with it, and the information it protected handled according to policy. It specializes Schneier’s window of exposure and the migration-time variable of Mosca’s inequality.

Cryptographic risk is also a function of time.

Two organizations that use exactly the same algorithms face very different risk if one can stop new use of a mechanism across its estate through a governed policy change and the other has to open a multi-year program to do the same.

Timeline of the Cryptographic Response Gap: from T0, when an assessment, standard or acceptable-use status changes, to T1, when the enterprise completes remediation; the interval between them is the dependency on a mechanism that is no longer acceptable.
  • Detection

    Question it answers
    Has something changed that affects us?
    What makes it long
    No one tracks the assessments that apply to the organization’s mechanisms.
  • Exposure analysis

    Question it answers
    Where do we use this mechanism, for which operations and data?
    What makes it long
    No inventory, or one that cannot tell operations and contexts apart.
  • Decision

    Question it answers
    What replaces it, and on what timeline?
    What makes it long
    No owner of cryptographic policy; the decision is spread across teams.
  • Engineering

    Question it answers
    What must change to apply the decision?
    What makes it long
    Algorithm choice is embedded in application code, libraries and configurations.
  • Deployment

    Question it answers
    How do we roll the change out safely?
    What makes it long
    Each change needs its own testing, certification and release cycle.
  • Exit

    Question it answers
    What happens to the data and signatures under the old mechanism?
    What makes it long
    No controlled way to keep legacy processing while stopping new use.

Discovery and inventory programs shorten detection and exposure analysis, and they are necessary. In a typical enterprise the longest part of the gap is engineering, deployment and exit, and those are set by architecture. That is also where the gap really lives: transport cryptography negotiates its algorithms per session and changes at a few endpoints, while data at rest and in use is protected with long-lived keys and with choices made inside application code.

Post-quantum migration →Enterprise cryptographic control →

The algorithm is a setting. This is the setting.

Twenty-nine templates in the catalogue — NIST_APPROVED, EU_COMPLIANT for ENISA, GDPR, NIS2 and eIDAS 2.0, HIGH_SECURITY for levels 3 and 5 — applied deployment-wide and overridable per tenant. Changing the template changes what the next operation may use. Below it, the catalogue the templates choose from: every algorithm with its category, level, standards and status, Classic McEliece already marked legacy.

ANKASecure© · Platform policies
The ANKASecure© platform policy screen with the algorithm availability template picker open, showing the DEFAULT, CLASSICAL, POST_QUANTUM, NIST_APPROVED, HIGH_SECURITY and EU_COMPLIANT templates over a per-tenant assignment table.
Real deployment · non-production data.
ANKASecure© · Algorithm catalogue
The ANKASecure© algorithm catalogue explorer filtered to post-quantum algorithms at security level 5: twelve of 130 algorithms, each with its family, operation, standards bodies and status; ML-KEM-1024, ML-DSA-87 and the SLH-DSA-256 variants recommended, CMCE-6688128 (Classic McEliece) marked legacy, and BIKE, FireSaber, NTRU and SMAUG-T experimental.
Real deployment · the platform catalogue, filtered.

Fifteen minutes

What you will actually watch

Live, on a real deployment, with an algorithm of the kind you are stuck on. Nothing in this list is a mock-up or a roadmap item.

  1. An application encrypting under a classical algorithm, referencing its key by name.

  2. The admissibility verdict for that key: which candidates are allowed, which are refused, and the reason code for each.

  3. The policy changes centrally. No application is touched. No release is cut.

  4. The same application, unchanged and not restarted, now writing under the new mechanism.

  5. A candidate the policy refuses: the operation is denied with its reason, never silently downgraded.

  6. The audit trail: which policy decided which operation, signed — the evidence an auditor asks for.

Broken is not the threshold

Acceptability is a status, not a property

Enterprises do not live on the line between secure and broken. They live on acceptability, and acceptability can be withdrawn long before anything breaks. NIST SP 800-131A assigns each algorithm a status per operation: three-key Triple DES can no longer encrypt but can still decrypt, and SHA-1 cannot generate new signatures but can still verify old ones. A controlled exit needs those states, expressed per operation.

  • Acceptable

    What is permitted
    All operations, including applying new protection.
    Existing reference
    NIST SP 800-131A
  • Not for new deployments

    What is permitted
    Existing deployments continue under conditions, such as hybrid only; no new systems.
    Existing reference
    BSI on Classic McEliece, 2026
  • Deprecated

    What is permitted
    Use permitted with accepted risk; replacement planned.
    Existing reference
    NIST SP 800-131A; RFC 7696 requirement levels
  • Legacy use

    What is permitted
    Only processing information already protected: decrypt, verify.
    Existing reference
    NIST SP 800-131A
  • Migration only

    What is permitted
    Legacy processing only inside governed re-encryption or re-signing workflows, with an end date.
    Existing reference
    Proposed extension, ANKATech whitepaper
  • Disallowed

    What is permitted
    No use for applying protection; processing only where explicitly authorized.
    Existing reference
    NIST SP 800-131A

Obsolescence by policy

NIST IR 8547, final since October 2026, deprecates quantum-vulnerable public-key cryptography after 2030 and disallows it after 2035, whether or not a quantum computer has been demonstrated by then. BSI’s decision on Classic McEliece took months.

Enforced where cryptography executes

A mechanism in legacy use cannot encrypt or sign even if an application asks it to: the state is enforced at the operation, not by convention.

Demonstrable

The organization can prove that a mechanism has applied no new protection since a given date, and that its remaining use is confined to the workflows policy allows.

What it rests on

The capabilities underneath, with their state

  • Shipping

    Stable key identifiers

    The application references a kid; material versions move underneath it and historical data keeps decrypting under the version that wrote it.

  • Shipping

    Algorithm availability policy, two planes

    Deployment-wide or per tenant, enforced on every operation, fail-closed: an unreadable policy denies rather than permits.

  • Shipping

    Twenty-nine policy templates

    Jurisdictional and standards-aligned sets over a catalogue of 120+ algorithms, 33 of them post-quantum.

  • Shipping

    Server-computed rotation admissibility

    A verdict per candidate with a reason code, produced by the same rule that runs when the rotation executes.

  • Shipping

    Sub-second policy propagation

    A change reaches the enforcement point per tenant without a restart or a redeploy.

  • Shipping

    Signed audit trail

    Which policy decided which operation, tamper-evident, forwardable to your SIEM with the signature preserved.

All of the platform →

The framework

Where this sits in CAPA

The Cryptographic Control Plane reference architecture describes each pillar through the scenarios it must handle and one practical test. This solution is two of the three scenarios of the first pillar — responding to an algorithm vulnerability, and evolving the cryptographic strategy without an application release.

01

Primary pillar

Crypto-Agility

Scenario realised

Responding to an algorithm vulnerability

Practical test

“Can the cryptographic strategy change without requiring an application change or release?”

04

Supporting pillar

Cryptographic Governance & Compliance

Scenario realised

Enforcing a new enterprise security requirement

Practical test

“Can the organization prove, by querying the control plane, which policy applied to a given operation, and change that policy centrally?”

L2–L3L4–L5

Maturity move

From a cryptographic change that needs a release to one that is a policy operation — and from there to an organization that can state how long a transition takes, because it has already done one and has the evidence.

The six maturity levels →Reference architecture: cryptographiccontrolplane.org

What this does not do

  • It does not apply to applications that have not been onboarded. The reference architecture is explicit about this and so are we: onboarding is real work. What changes is the economics of every transition after it — the first application is a project, the next change is not.

  • It does not make a representation universally interoperable. An external system can read what you produce only when it supports that operation’s algorithms, identifiers and profiles; agility on your side is not adoption on theirs.

  • It does not decide for you what is acceptable. The policies enforce the states your standards bodies, regulators and auditors define; tracking those assessments and choosing the replacement remain decisions of the people who own your cryptographic risk.

Where to start

Six questions before a real change asks them

The worst time to think about crypto-agility is after the post-quantum migration. If you are going to open the code of your applications anyway, open it once: replace the embedded algorithm with a stable capability governed by policy, and the migration becomes the last cryptographic change those applications need.

  1. 1

    Response-gap assessment

    Identify the mechanisms and systems that would define your gap if a mechanism you rely on became unacceptable.

  2. 2

    Demonstration and reference architecture

    ANKASecure© changing an algorithm, retiring a mechanism and re-encrypting data end to end, on a case analogous to yours.

  3. 3

    Scoped pilot

    One critical use governed by policy, with keys anchored in your existing HSM or KMS.

Six questions for the CISO

  1. If the mechanism protecting your most critical data became unacceptable tomorrow, how many applications would you have to modify?
  2. Can you list every place a given algorithm is used, telling encrypt from decrypt and sign from verify?
  3. Can you stop new use of a mechanism without stopping the decryption and verification of what it already protects?
  4. Who decides which mechanism serves which use, and where is that decision enforced?
  5. Can you demonstrate to an auditor that a mechanism has not been used to apply new protection since a given date?
  6. Have you measured your response gap for each class of system, and do you know which systems define its upper bound?

Whitepaper

Crypto agility beyond the quantum clock

Five real cases from the last four years, acceptability as a status, the Cryptographic Response Gap, the 200-application problem, how to exit old cryptography, and six questions for the CISO. 27 pages, November 2026.

Read it online →

Download the PDF

Complete your details to download it

The download opens on this page as soon as the form is submitted. We ask for a corporate account so we can route follow-up to the right team.

Personal mailboxes (gmail, hotmail, outlook, yahoo, proton, icloud, aol) are not accepted.

Your personal profile URL, in the form linkedin.com/in/your-name. Company pages are not accepted.

We use your details to share related ANKATech content and to route follow-up. You can ask us to remove them at any time.

This site is protected by reCAPTCHA.

How long would it take you to leave one algorithm?

Bring the one you would most like to be rid of. Fifteen minutes on a live deployment: the admissibility verdict, the policy change, and the same application writing under the new mechanism without a release.

Book the demo