An improved implementation of elliptic curves over gf(2n) when using projective point arithmetic

14Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Here we provide a comparison of several projective point transformations of an elliptic curve defined over GF(2n) and rank their performance. We provide strategies to achieve improved implementations of each. Our work shows that under certain conditions, these strategies can alter the ranking of these projective point arithmetic methods.

Cite

CITATION STYLE

APA

King, B. (2001). An improved implementation of elliptic curves over gf(2n) when using projective point arithmetic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2259, pp. 134–150). Springer Verlag. https://doi.org/10.1007/3-540-45537-x_11

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