Constant-time
Timing & side channels
Secret-dependent branches and memory access are measured against a constant-time gate; a secret should not be readable from how long an operation takes.
Demonstration · Red team
We do not ask you to trust that our implementations are sound; we attack them ourselves, on purpose, and gate the fix so the same weakness cannot return. ULTIMA is the purple-team loop behind Qrypto Federal: it finds, ZAP hardens, and a resilience gate locks the result.
The loop
A finding is only closed when a gate proves the fix and would catch the regression, not when someone says it is fixed.
What it looks for
Choosing a NIST algorithm is the easy part. The failures that matter live in the implementation: timing side channels, decryption oracles, missing consistency checks, and trust stories an artifact cannot actually support.
Constant-time
Secret-dependent branches and memory access are measured against a constant-time gate; a secret should not be readable from how long an operation takes.
Oracles
Implicit rejection is preserved: a bad ciphertext must not be told apart from a good one before the authentication tag, or the decision leaks.
Consistency
Keys are checked for pairwise consistency and withheld on failure; signatures are verified after signing before they are relied upon.
Trust stories
A label like “post-quantum” or “forward-secret” is only allowed where the artifact actually provides the property; the mismatch is the finding.
Run an attack
The live ULTIMA workbench runs inside the enclave against authorized, in-scope targets only. No attack is launched from this public page.
FLAG: not executable here, by design. ULTIMA operates on our own stack or an explicitly authorized target, inside the sovereign edge, with results graded and disclosure owner-gated. It is defensive and legitimate-use only. These controls are intentionally disabled in this public demonstration; nothing on this page attacks anything.
Hold us to it