Fast implementation of elliptic curve arithmetic in GF\((p^n)\) (Q4950061)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1440071
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast implementation of elliptic curve arithmetic in GF\((p^n)\) |
scientific article; zbMATH DE number 1440071 |
Statements
28 August 2000
0 references
elliptic curves
0 references
finite fields
0 references
implementation
0 references
cryptosystems
0 references
ECC
0 references
0.8333088159561157
0 references
Fast implementation of elliptic curve arithmetic in GF\((p^n)\) (English)
0 references
The authors describe efficient methods for speeding up field arithmetic in GF\((p^n)\), where \(p\) is an odd prime of length 32 or 64 bits. They provide several tables of results on distinct architectures (Pentium II, and Alpha 21164 microprocessors). Although the current versions of the standards on public-key cryptography (IEEE-P1363, ANSI X9.62, etc) do not recommend such fields as underlying fields, the results stated in this article are of interest from an academic point of view, and are suitable for practical implementations of elliptic curve cryptography. For the entire collection see [Zbl 0931.00050].
0 references
