Message recovery signature scheme using complementary elliptic curves

Author

Yew, Teo Chun ; Haili, Hailiza Kamarul ; Sumari, Putra

Author_Institution

Sch. of Math. Sci., Universiti Sci. Malaysia, Penang, Malaysia

fYear

2003

fDate

16-18 July 2003

Firstpage

106

Lastpage

110

Abstract

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.

Keywords

computational complexity; cryptography; data handling; message authentication; Nyberg-Rueppel message recovery signature scheme; communication time; complementary curve; complementary elliptic curve; computational complexity; discrete logarithm problem; elliptic curve cryptography; elliptic curve cryptosystem; isomorphic curve; plain text embedding; processing time; Communication system security; Computer science; Elliptic curve cryptography; Elliptic curves; Equations; Galois fields; H infinity control; Public key; Public key cryptography; Solid modeling;

fLanguage

English

Publisher

ieee

Conference_Titel

Geometric Modeling and Graphics, 2003. Proceedings. 2003 International Conference on

Print_ISBN

0-7695-1985-7

Type

conf

DOI

10.1109/GMAG.2003.1219673

Filename

1219673