Fast multiplication on elliptic curves over small fields of characteristic two (Q1281784)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fast multiplication on elliptic curves over small fields of characteristic two |
scientific article; zbMATH DE number 1268200
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast multiplication on elliptic curves over small fields of characteristic two |
scientific article; zbMATH DE number 1268200 |
Statements
Fast multiplication on elliptic curves over small fields of characteristic two (English)
0 references
21 September 2000
0 references
Algorithms are provided to enhance the speed of the multiplication on elliptic curves defined over small finite fields of characteristic two. This saves up to 50\% compared with the ordinary binary algorithm. A table of elliptic curves suitable for cryptography is provided at the end of the article.
0 references
elliptic curves
0 references
characteristic two
0 references
multiplication
0 references
Frobenius expansion
0 references
Frobenius endomorphism
0 references
0.9226926
0 references
0.9182333
0 references
0.9173929
0 references
0.9153951
0 references
0.91471994
0 references
