an efficient security algorithm in mobile computing for resource constrained mobile devices.
The focus of this paper is on the key exchange and key agreement stage of a mobile communication, between a handheld device such as a PDA and a server. The paper suggests the use of the Extended Optimal Extension Field (EOEF) as an alternative to the finite fields currently in use in the Elliptic Curve Diffie Hellman key exchange. EOEF offers advantages, due to the fact that it has an irreducible All One Polynomial, which is a very good choice for constrained environments.
mobile computing optimal extension fields elliptic curve cryptography