2000 character limit reached
Post Quantum Cryptography from Mutant Prime Knots
Published 11 Oct 2010 in math-ph, cs.CR, math.MP, and quant-ph | (1010.2055v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
