QRKE: Resistance to Attacks using the Inverse of the Cosine Representation of Chebyshev Polynomials

TL;DR

This paper introduces QRKE, a cryptographic scheme leveraging Chebyshev polynomials and their cosine inverse representation, demonstrating resistance to quantum attacks and inverse cosine-based attacks.

Contribution

It presents a novel cryptosystem based on permutable Chebyshev polynomials and proves its security against specific attack vectors.

Findings

Cryptosystem withstands quantum attacks.

Inverse cosine attacks on the scheme fail.

Uses Chebyshev polynomials for secure key exchange.

Abstract

We've been able to show recently that Permutable Chebyshev polynomials (T polynomials) defined over the field of real numbers can be used to create a Diffie-Hellman-like key exchange algorithm and certificates. The cryptosystem was theoretically proven to withstand attacks using quantum computers. We additionally prove that attacks based on the inverse of the cosine representation of T polynomials fail.