Efficient generation of elliptic curve cryptosystems

Abstract

Security is one of the most important aspects in the design of system for electronic commerce, while public key cryptography is a major technique for implementing security mechanisms in the electronic world. This paper discusses the security of discrete logarithm-based public key cryptosystems and the efficiency of generating elliptic curve cryptosystems. The paper suggests a secure scheme for curve generation such that, without compromising security, the number of curves available for use by cryptosystems is substantially increased from existing techniques. In addition, the process of finding a suitable prime will be faster as the chance of finding a suitable value is higher. These features help to enhance the security of the cryptosystem in that, from a practical point of view, one can change the curve more frequently. Results from experimental analysis demonstrated the efficiency of the new curve generation scheme.