PhoenixSig Technical Whitepaper

A comprehensive technical overview of the first digital signature system engineered for Post-Compromise Security — combining post-quantum cryptography, deterministic state evolution, and hardware-anchored entropy injection.

Abstract

Current digital signature schemes — including NIST post-quantum standards ML-DSA and SLH-DSA — operate under the assumption that private keys remain uncompromised throughout their lifetime. When this assumption fails, the consequences are catastrophic: all signatures become suspect, and recovery requires out-of-band certificate revocation that can take hours or days.

PhoenixSig introduces a fundamentally different approach. Rather than treating compromise as a terminal event, PhoenixSig treats it as an operational certainty that the system must survive. The system achieves this through three interlocking mechanisms: a post-quantum signing engine (ML-DSA / SLH-DSA), a deterministic state evolution core based on Dynamic Learning With Rounding (DyLWE), and a hardware-anchored entropy injection system called Phoenix Injection.

Together, these components deliver Post-Compromise Security (PCS) — the guarantee that even after full state compromise, the system autonomously recovers and locks out the attacker without human intervention.


1. Problem Statement

1.1 The Static Key Assumption

Every deployed digital signature system today relies on a single, long-lived private key. This creates a single point of failure that, once breached, invalidates the entire trust model. The private key is typically stored for months or years, creating an extended attack window.

Standard mitigations — Hardware Security Modules (HSMs), secure enclaves, key rotation policies — reduce the probability of compromise but do not address what happens when compromise inevitably occurs.

1.2 The Revocation Problem

When a key is known to be compromised, the only recourse is certificate revocation. This process is fundamentally broken for high-stakes environments:

  • Latency: CRL propagation takes 24–72 hours in practice
  • Incomplete coverage: Not all verifiers check revocation lists
  • Retroactive ambiguity: Signatures issued during the compromise window are permanently suspect
  • No automation: Requires manual detection and human intervention

1.3 The Quantum Amplifier

Harvest-now-decrypt-later (HNDL) attacks compound the problem. An adversary who captures encrypted communications today can decrypt them when quantum computers become available. For signatures, this means current key compromises become exponentially more dangerous.

Key Insight

The fundamental problem is not that keys might be compromised — it's that current systems have no recovery path when they are. PhoenixSig is designed for environments where compromise is an operational certainty.


2. Design Philosophy

PhoenixSig reframes digital signatures from a static cryptographic primitive to a dynamic, evolving process:

A signature is not an algorithm. It is a temporal process — each signature is a transient slice of an evolving state, expendable by design, but the system as a whole is engineered to always recover.

Principle 1: No Long-Lived Private Keys

Every signing key is ephemeral, bound to a specific epoch, and destroyed after use. There is no "master key" whose compromise destroys the system.

Principle 2: Forward-Only State Evolution

The system state advances irreversibly with each operation. An attacker who captures a state snapshot cannot roll back to a previous state or replay past operations.

Principle 3: Hardware-Anchored Recovery

Post-Compromise Security requires entropy that the attacker cannot access or predict. This entropy is anchored in Trusted Execution Environment (TEE) hardware — a non-exportable secret that only the legitimate device can use for recovery.


3. System Architecture

PhoenixSig consists of three tightly-coupled layers. Each layer serves a distinct purpose, but they are inseparable — removing any one layer destroys the PCS guarantee.

┌──────────────────────────────────────────────────┐ LAYER 3: PHOENIX INJECTION VaultKey (TEE) → Entropy injection → PCS ├──────────────────────────────────────────────────┤ LAYER 2: DyLWE STATE CORE Deterministic evolution → Forward security σ → evolve(σ, ctx) → σ' (irreversible) ├──────────────────────────────────────────────────┤ LAYER 1: PQC SIGNING ENGINE ML-DSA-65 / SLH-DSA → Sign & Verify └──────────────────────────────────────────────────┘

3.1 Layer 1 — PQC Signing Engine

The bottom layer is a pluggable post-quantum signature algorithm. PhoenixSig currently supports ML-DSA-65 (formerly CRYSTALS-Dilithium) as the primary signer and SLH-DSA (formerly SPHINCS+) as a conservative fallback.

PhoenixSig does not modify these algorithms. They are used as standardized, NIST-approved primitives. Phoenix manages everything above the cryptographic operation.

3.2 Layer 2 — DyLWE State Core

The middle layer manages deterministic, forward-only state evolution. It derives epoch-specific signing keys from the current state without external randomness. Detailed in Section 4.

3.3 Layer 3 — Phoenix Injection

The top layer provides hardware-anchored entropy that makes PCS possible. A VaultKey stored in a TEE injects fresh entropy into every derivation. Detailed in Section 5.


4. DyLWE State Core

4.1 Why Deterministic Evolution?

A naive approach to ephemeral keys would call the OS random number generator for each epoch. This fails in several ways: the output cannot be audited or reproduced, it's vulnerable to RNG manipulation, and provides no formal structure for security proofs.

DyLWE provides a deterministic state machine whose evolution is mathematically structured, auditable, and provably forward-secure.

4.2 Mathematical Foundation

R_q = Z_q[X] / (X^N + 1) Module lattice structure with NIST-aligned parameters

The core uses Learning With Rounding (LWR) rather than Learning With Errors (LWE), eliminating noise sampling and making evolution fully deterministic.

4.3 State Representation

DeviceState {
  state_seed      // Internal evolution seed
  epoch           // Monotonic epoch identifier
  counter         // Per-epoch operation counter
  quarantine_flag // Security state indicator
}

4.4 Evolution Function

sigma' = StateEvolve(VaultKey, sigma, ctx)

ctx = ContextDerive(epoch, counter, message, policy)

Critical property: the old sigma is immediately erased. There is no path from sigma' back to sigma.


5. Phoenix Injection

Critical Invariant

Every hash, KDF, PRF, and state evolution in PhoenixSig must depend on the current VaultKey. If any derivation bypasses VaultKey, PCS is broken.

5.1 VaultKey Architecture

Each device contains a VaultKey stored inside a Trusted Execution Environment. The VaultKey is non-exportable (cannot leave the TEE), attestable (TEE can prove integrity), and mutable (can be refreshed with new entropy).

5.2 Phoenix Refresh

VaultKey ← Refresh(VaultKey, new_entropy)

After refresh: all future derivations change completely, pre-refresh state snapshots become useless, and the system has risen from the ashes.

5.3 Why DyLWE Alone Is Insufficient

DyLWE provides forward security — past states cannot be recovered. But if an attacker captures the full state at time t₀, they can compute all future states deterministically. Only VaultKey refresh breaks this chain.

── Timeline ────────────────────────────────────── t₀ t₁ (compromise) t₂ (refresh) t₃ │ │ │ │ │ Normal ops │ Attacker has │ VaultKey │ Attacker │ │ full state │ rotated │ locked out ────────────────────────────────────────────────── ▲ can forge t₁→t₂ ▲ cannot forge t₂+

6. Post-Compromise Security Analysis

6.1 Formal Definition

Given an adversary with a complete state snapshot at t₁, after Phoenix refresh at t₂ > t₁, the adversary cannot: forge any signature for epoch e > e(t₂), predict any signing key for future epochs, or distinguish future signing keys from random.

6.2 Security Assumptions

  • TEE correctly isolates VaultKey from the application processor
  • HKDF behaves as a random oracle
  • Attacker does not maintain persistent TEE access after refresh
  • Module-LWR is computationally hard (standard lattice assumption)

6.3 Explicit Non-Goals

PCS does not cover persistent physical device capture with ongoing TEE access. PhoenixSig is designed for scenarios where compromise is temporary or detectable — the overwhelming majority of real-world breach scenarios.


7. Epoch-Based Signing & Verification

7.1 Key Derivation

seed_epoch = DeriveEpochSeed(VaultKey, sigma, ctx)
(sk_epoch, pk_epoch) = PQC.KeyGen(seed_epoch)

7.2 Merkle Tree Commitment

All epoch public keys are committed to a Merkle tree. The root hash RootPK serves as the device's long-term identity. Each signature includes the PQC signature, the epoch public key, and a Merkle authentication path.

7.3 Verification

A verifier needs only RootPK (published once) to verify any signature from the device, regardless of which epoch produced it.


8. Comparison

PropertyTraditional PKIStandalone PQCPhoenixSig
Quantum Resistant
Forward Security
Post-Compromise Security
No Long-Lived Keys
Automatic Recovery
Hardware-Anchored EntropyOptionalOptionalRequired

9. Development Roadmap

Phase 1 — Complete

Core Framework & PCS Validation

Foundational architecture with state evolution, epoch-based signing, entropy injection, and security property verification.

Phase 2 — In Progress

Production Cryptographic Integration

Full NIST PQC backend integration with production-grade implementations and invariant verification.

Phase 3 — Upcoming

Hardware Security & Attestation

Trusted Execution Environment integration, remote attestation, and deployment hardening.

Phase 4 — Planned

Commercial Release

Multi-platform SDK, partner integrations, and compliance certification processes.


Ready to explore PhoenixSig?

Schedule a technical deep-dive with our team.

Request a Demo →