Skip to main content
Journal ArticleOPEN ACCESS

A point compression method for elliptic curves denned over GF(2 n)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 2947 333-345
DOI: 10.1007/978-3-540-24632-9_24
12Citations
Citations of this article
31Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Here we describe new tools to be used in fields of the form Gf(2 n), that help describe properties of elliptic curves defined over GF(2n). Further, utilizing these tools we describe a new elliptic curve point compression method, which provides the most efficient use of bandwidth whenever the elliptic curve is defined by y2 + xy = x 3 + a2x2 + a6 and the trace of a2 is zero. © International Association for Cryptologic Research 2004.

Cite

CITATION STYLE

APA

King, B. (2004). A point compression method for elliptic curves denned over GF(2 n). Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2947, 333–345. https://doi.org/10.1007/978-3-540-24632-9_24

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