Abstract
We propose a practical digital signature scheme based on the elliptic curve modulo n, where n = p2q such that p and q are large secret primes. The signature generation speed of our scheme is more than 10 times faster than that of the RSA scheme. Moreover, a pre-processing technique can significantly increase the signature generation speed.
Cite
CITATION STYLE
Okamoto, T., Fujioka, A., & Fujisaki, E. (1993). An efficient digital signature scheme based on an elliptic curve over the ring Zn. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 740 LNCS, pp. 54–65). Springer Verlag. https://doi.org/10.1007/3-540-48071-4_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
