QRKE: Quantum-Resistant Public Key Exchange
G. Brands, C.B. Roellgen, K.U. Vogel

TL;DR
This paper introduces QRKE, a quantum-resistant key exchange method based on polymorphic functions, aiming to develop fundamentally immune cryptographic protocols against quantum computer threats.
Contribution
It proposes a novel polymorphic key exchange algorithm over real numbers with multiple strategies, enhancing resistance to quantum attacks.
Findings
The algorithm operates with at least four different strategies.
Quantum decoherence could prematurely end quantum computations using this method.
The survey indicates current quantum computers are less capable of breaking existing algorithms.
Abstract
A Post-Quantum Key Exchange is needed since the availability of quantum computers that allegedly allow breaking classical algorithms like Diffie-Hellman, El Gamal, RSA and others within a practical amount of time is broadly assumed in literature. Although our survey suggests that practical quantum computers appear to be by far less advanced as actually required to break state-of-the-art key negotiation algorithms, it is of high scientific interest to develop fundamentally immune key negotiation methods. A novel polymorphic algorithm based on permutable functions and defined over the field of real numbers is proposed. The proposed key exchange can operate with at least four different strategies. The cryptosystem itself is highly variable and, due to the fact that rounding operations are inevitable and mandatory on a traditional computer system, decoherence of the quantum computer system…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum-Dot Cellular Automata
