Fast multiplication on elliptic curves over small fields of characteristic two (Q1281784): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s001459900045 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1989258293 / rank | |||
Normal rank | |||
Latest revision as of 02:02, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast multiplication on elliptic curves over small fields of characteristic two |
scientific article |
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
