Message recovery signature scheme using complementary elliptic curves

Elliptic curve cryptography is known for its complexity due to its discrete logarithm problem, and this gives advantage to the system used since the formula developed using this concept is hard to solved; therefore, this criteria has given mathematicians a courage to explore this area of research. In previous paper (Yew et al., 2003), we have shown a new method for embedding plain-texts using a complementary elliptic curve. In this paper we extend our work to obtain a new modified method for the Nyberg-Rueppel message recovery signature scheme using the complementary curve. By applying this method, we eventually enlarge the block of message of elliptic curve cryptosystems and this resulted in faster communication and processing time and at the same time the security level remain tight.