C. B. Roellgen

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn 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)
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)
Existing encryption schemes for VoIP audio/video telephone conversations are only secure under the assumption that the employed lightweight encryption algorithms are secure, that the telephony server is not manipulated and that no Man-in-the-Middle Attack is mounted on any endpoint. A new encryption method that entirely overcomes the shortcomings of(More)
  • 1