Experimental Analysis of Finite Field Over Prime Field and Binary Field

Abstract

As new-fangled attacks come up, protocols desires to be verified all over again and also require cultivating some new arise protocols that can resist the different kind of attacks.  A secure system is dependent on the use of cryptographic techniques. Potential use of finite field for the implementation of elliptic curve cryptography which is supporting to implement and design the different key establishment protocol such as key agreement,key exchange protocol that are vulnerable  to various kind of  attacks (active and passive attack).Finite field accomplishment  improves the confidentiality and efficacy of communication network  .Finite field arithmetic  is used to provide efficient and secure elements for cryptography for key establishment and key exchange . The major emphasis  of this paper is on appropriate implementation finite field operation over prime field(Fp) and binary field(F2m).