Verification of elgamal algorithm cryptographic protocol using linear temporal logic

Now a day the dependency on internet and on its based-embedded system increases, there is need of correctness of communication and reliability over network A small fault in system cause heavy loss. It mainly causes non reliable channel communication. Adherence of Frame work or model is based on validation of Public key encryption (PKE) communication protocol used between user and provider. Linear Temporal Logic (LTL) is the tool used for finite state model checking. Using LTL for ElGamal public key Encryption Protocol (EG-PKE) is easy to examine & verify the concurrent state transition of system. With the assist of recognize LTL Rule we try to find verification on a formulated transition system.