# zbMATH — the first resource for mathematics

##### Examples
 Geometry Search for the term Geometry in any field. Queries are case-independent. Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact. "Topological group" Phrases (multi-words) should be set in "straight quotation marks". au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted. Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff. "Quasi* map*" py: 1989 The resulting documents have publication year 1989. so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14. "Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic. dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles. py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses). la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

##### Operators
 a & b logic and a | b logic or !ab logic not abc* right wildcard "ab c" phrase (ab c) parentheses
##### Fields
 any anywhere an internal document identifier au author, editor ai internal author identifier ti title la language so source ab review, abstract py publication year rv reviewer cc MSC code ut uncontrolled term dt document type (j: journal article; b: book; a: book article)
Fast implementation of elliptic curve arithmetic in GF$\left({p}^{n}\right)$. (English) Zbl 0955.94002
Imai, Hideki (ed.) et al., Public key cryptography. 3rd international workshop on Practice and theory in public key cryptosystems, PKC 2000, Melbourne, Victoria, Australia, January 18-20, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1751, 405-421 (2000).
The authors describe efficient methods for speeding up field arithmetic in GF$\left({p}^{n}\right)$, 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.
##### MSC:
 94A60 Cryptography
##### Keywords:
elliptic curves; finite fields; implementation; cryptosystems; ECC