

Most remarkably, since it does not rely on computational problems as integer factorization or discrete logarithm whose difficulty is conjectured, non-invertible KEP becomes a promising candidate to protect communication in the quantum era.

This method is public key it allows secret key exchange and performs secret communication. Non-invertible KEP is supported by Euler’s theorem as RSA, it uses exponentiation to exchange a secret key as Diffie–Hellman, and it encrypts/decrypts through invertible multiplication as ElGamal.

As a result of a continuous refinement process, we present a new key exchange method to establish a secret key between two remote parties. We investigate a cryptosystem through what we call non-invertible cryptography.
