Non-invertible key exchange protocol

Abstract

AbstractWe investigate a cryptosystem through what we call non-invertible cryptography. As a result of a continuous refinement process, we present a new key exchange method to establish a secret key between two remote parties. 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. This method is public key; it allows secret key exchange and performs secret communication. 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. By contrast, the algorithm is supported on indistinguishability of public key and ciphertext so it achieves perfect secrecy. The protocol demonstrates minimum required time for encryption/decryption processes when is compared with the main public key algorithms as Diffie–Hellman, ElGamal or RSA.