Skip to main content
Conference ProceedingsOPEN ACCESS

Fast algorithms for elliptic curve cryptosystems over binary finite field

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1999) 1716 1-11
DOI: 10.1007/978-3-540-48000-6_8
3Citations
Citations of this article
37Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In the underlying finite field arithmetic of an elliptic curve cryptosystem, field multiplication is the next computational costly operation other than field inversion. We present two novel algorithms for efficient implementation of field multiplication and modular reduction used frequently in an elliptic curve cryptosystem defined over GF(2n). We provide a complexity study of the two algorithms and present an implementation performance of the algorithms over GF(2167).

Author supplied keywords

Cite

CITATION STYLE

APA

Han, Y., Zhang, J., Tan, P. C., & Leong, P. C. (1999). Fast algorithms for elliptic curve cryptosystems over binary finite field. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1716, pp. 1–11). Springer Verlag. https://doi.org/10.1007/978-3-540-48000-6_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free