Abstract
AbstractConstructing an elliptic curve of prime order has a significant role in elliptic curve cryptography. In this paper, we propose an efficient technique to generate an elliptic curve of nearly prime order. Precisely, this algorithm produces an elliptic curve of cofactor 2. Presently, the most known working algorithms for generating elliptic curves of prime order are based on complex multiplication. The advantages of proposed algorithm are: it is relatively simple, easy to implement and produces an elliptic curve of a remarkably simple expression.KeywordsElliptic Curve Cryptography (ECC)Elliptic Curve Discrete Logarithm Problem (ECDLP)Trace of an elliptic curveMiller-Rabin primality test
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
