Skip to content

QR-NSP: Quantum-Resistant Deniable Communications from First Principles

Jean-Paul Niko · RTSG BuildNet · 2026


Abstract

We present QR-NSP (Quantum-Resistant Network Security Protocol) as a communication security framework derived from RTSG filter theory. Encryption is an opaque filter layer in the five-filter model. Deniability is condensate ambiguity — a message with multiple valid GL ground states, preventing an adversary from determining the true content. The protocol combines ML-KEM (Module Lattice Key Encapsulation) for post-quantum key exchange, QUIC steganography for hiding signal inside noise, timing channels for covert communication, and the NÍKĒ/Sneakernet system as a physical-layer fallback. All components map to the GL action, connecting cryptographic security to the same mathematical structure governing intelligence, gravity, and consciousness.


1. Communication Security as Filter Problem

\[S[W] = \int \left( |\partial W|^2 + \alpha|W|^2 + \frac{\beta}{2}|W|^4 \right) d\mu\]

In RTSG, every communication passes through a filter stack. Encryption adds an opaque filter layer \(F_{\text{enc}}\) that makes the message unintelligible to anyone lacking the decryption key (inverse filter \(F_{\text{enc}}^{-1}\)).

Security Concept GL / Filter Interpretation
Encryption Opaque filter layer
Decryption Inverse filter application
Key exchange Shared filter synchronization
Deniability Multiple valid ground states
Steganography Signal hidden inside noise floor
Traffic analysis Filter-stack fingerprinting
Forward secrecy Ephemeral condensate (keys decay)

2. Post-Quantum Security via ML-KEM

QR-NSP uses Module Lattice Key Encapsulation Mechanism (ML-KEM), based on the hardness of the Learning With Errors (LWE) problem on module lattices. In GL terms: the lattice is a discrete energy landscape with exponentially many local minima. Finding the correct minimum (decrypting) requires the secret key; brute-force search requires traversing the full landscape — infeasible even for quantum computers.

3. Deniability as Condensate Ambiguity

A deniable encryption scheme produces ciphertexts that can be decrypted to different plaintexts depending on which key is provided. In GL terms: the encrypted message has multiple valid ground states. An adversary cannot determine which ground state is "true" because the GL potential has degenerate minima by construction.

4. QUIC Steganography

The QUIC protocol's encrypted transport provides cover traffic into which steganographic content can be injected. The stego signal is hidden below the noise floor of normal QUIC traffic — indistinguishable from legitimate communication without the extraction key.

5. The NÍKĒ/Sneakernet System

When digital channels are compromised, NÍKĒ provides physical-layer deniable communication: encrypted data embedded in innocuous physical media, transported by human courier. This is the ultimate filter — the signal physically bypasses the adversary's monitoring infrastructure.

6. The Eight-Module Architecture

QR-NSP consists of eight modules: XDP Interceptor, PQC Crypto, QUIC Stego, Timing Channel, Deniable Encryption, TCP Fallback, Traffic Morphing, and Orchestrator. Full specifications and source code are published on the wiki.

7. What This Framework Does NOT Claim

  • It does not guarantee absolute security. All security is relative to adversary capability.
  • Implementation bugs can undermine theoretical security. Code audit is essential.
  • The connection to GL is structural, not a claim that physics "proves" the security.

References


Jean-Paul Niko · jeanpaulniko@proton.me · smarthub.my