cryptography and network security by forouzan and mukhopadhyay pdf

In addition, users can verify the authenticity of web servers, and reciprocally, the service can approve or reject a transaction from an electronic payment card. By means of public/private keys, users and data can be authenticated during web transactions. Since its origin at the end of the 1970s, public key cryptography has become the main mechanism to support digital signatures and electronic internet services. 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. By contrast, the algorithm is supported on indistinguishability of public key and ciphertext so it achieves perfect secrecy.

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.

Cryptography and network security by forouzan and mukhopadhyay pdf