#### Filter Results:

#### Publication Year

2015

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

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… (More)

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… (More)

Permutable Chebyshev polynomials (T polynomials) defined over the field of real numbers are suitable for creating a Diffie-Hellman-like key exchange algorithm that is able to withstand attacks using quantum computers. The algorithm takes advantage of the commutative properties of Chebyshev polynomials of the first kind. We show how T polynomial values can… (More)

- ‹
- 1
- ›