In recent years some cryptographic algorithms have gained popularity due to properties that make them suitable for use in constrained environment like mobile information appliances, where computing resources and power availability are limited. One of these cryptosystems is Elliptic curve which requires less computational power, memory and communication bandwidth compared to other cryptosystem. This makes the elliptic curve cryptography to gain wide acceptance as an alternative to conventional cryptosystems (DSA, RSA, AES, etc.). All existing protocols for elliptic curve cryptosystems that are used for either key exchange or for ciphering, assume that the curve E, the field Fq and a point P on the curve are all public. In this research we propose a modified protocol for elliptic curve key exchange based on elliptic curve over rings, assuming that only the curve E and Fq are public, keeping the base point P secret, which make attacking the cryptosystem harder by the eavesdropper. Also we provide imbedded authentication, so our protocol does not suffer from the man in the middle attack.
[1]
Bart Preneel,et al.
Elliptic Curve Public-Key Cryptosystems - An Introduction
,
1997,
State of the Art in Applied Cryptography.
[2]
M. Saeb,et al.
A new two-pass key agreement protocol
,
2003,
2003 46th Midwest Symposium on Circuits and Systems.
[3]
William Stallings,et al.
Cryptography and network security
,
1998
.
[4]
Peter Gemmell,et al.
Authenticated Key Exchange Provably Secure Against the Man-in-the-Middle Attack
,
2001,
Journal of Cryptology.
[5]
A. Murat Fiskiran,et al.
Workload characterization of elliptic curve cryptography and other network security algorithms for constrained environments
,
2002,
2002 IEEE International Workshop on Workload Characterization.
[6]
Tatsuaki Okamoto,et al.
New Public-Key Schemes Based on Elliptic Curves over the Ring Zn
,
1991,
CRYPTO.