Post Quantum Cryptography from Mutant Prime Knots

By resorting to basic features of topological knot theory we propose a (classical) cryptographic protocol based on the `difficulty’ of decomposing complex knots generated as connected sums of prime knots and their mutants. The scheme combines an asymmetric public key protocol with symmetric private ones and is intrinsecally secure against quantum eavesdropper attacks.

💡 Research Summary

The paper “Post Quantum Cryptography from Mutant Prime Knots” proposes a novel cryptographic framework that leverages the topological complexity of knots, specifically the difficulty of decomposing composite knots formed by connected sums of prime knots and their mutants. The authors begin with a concise review of knot theory, defining knots as embeddings of circles in three‑dimensional space, prime knots as indecomposable building blocks, and mutants as knots obtained by rotating a tangle within a diagram. Because mutants share all standard polynomial invariants (Jones, HOMFLY, Kauffman, etc.) with their parent knots, they are indistinguishable by any known invariant, a property the authors exploit to create a hard problem for cryptography.

The protocol encodes each prime knot using its Dowker‑Thistlethwaite (DT) code—a sequence of integers uniquely associated with a minimal diagram. A public key consists of a publicly known set of DT codes for selected prime knots and a prescribed order for their connected sum. The private key adds two layers of secrecy: (1) the exact sequence of connected‑sum operations (including which summands are mutated) and (2) the specific rotations applied to the chosen tangles. To encrypt a message, the receiver (Bob) constructs a composite knot K by performing the connected sum of the chosen prime knots, optionally applying mutations, and then converts K into its DT code. Bob then encrypts the plaintext with a conventional symmetric cipher (e.g., AES) and protects the symmetric key by hashing it together with the DT code of K. The sender (Alice), who knows only the public DT set, must search through possible decompositions of the public composite to locate the unique DT code that matches the hash, thereby recovering the symmetric key and decrypting the message.

Security is argued on two fronts. First, the “knot factorization” problem—determining the prime‑knot and mutant components of a given composite knot—is presumed to be computationally intractable for both classical and quantum computers. The authors note that computing knot invariants such as the Jones polynomial is #P‑hard, and while quantum algorithms can approximate certain invariants, they cannot resolve mutant ambiguity because mutants are designed to be invariant‑identical. Consequently, the protocol is claimed to be resistant to Shor‑type attacks that break RSA and ECC, positioning it as a post‑quantum scheme.

The paper also discusses practical considerations. DT codes grow linearly with the crossing number, so large keys (hundreds of crossings) lead to substantial communication overhead. Generating truly random mutations expands the key space dramatically but introduces challenges in randomness generation, key synchronization, and storage. Moreover, the lack of a proven lower bound on the complexity of knot decomposition leaves the security claim on heuristic ground.

In conclusion, the authors present an inventive intersection of low‑dimensional topology and cryptography, offering a protocol that departs from number‑theoretic hardness assumptions. While the conceptual foundation is sound—mutants provide indistinguishability under known invariants—the paper falls short of providing rigorous complexity proofs, concrete performance benchmarks, and a thorough analysis of potential quantum attacks beyond invariant computation. Future work should aim to (i) formalize the hardness of knot factorization, (ii) explore quantum‑resistant invariant families, and (iii) develop efficient encoding and key‑exchange mechanisms to make the scheme viable for real‑world deployment.