QRKE: Resistance to Attacks using the Inverse of the Cosine Representation of Chebyshev Polynomials
This addresses the need for secure cryptography in the post-quantum era, offering a novel theoretical solution.
The paper tackles the problem of creating a quantum-resistant key exchange algorithm by using Permutable Chebyshev polynomials, proving it withstands quantum attacks and resists specific attacks based on the inverse cosine representation.
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.