zbMATH — the first resource for mathematics

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.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
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)
Efficient elliptic curve exponentiation using mixed coordinates. (English) Zbl 0939.11039
Ohta, Kazuo (ed.) et al., Advances in cryptology - ASIACRYPT ’98. International conference on the Theory and application of cryptology and information security, Beijing, China, October 18-22, 1998. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1514, 51-65 (1998).

Elliptic curve cryptosystems are becoming increasingly used in practical applications since they offer improved performance and reduced bandwidth and memory. Central to this industrial interest is the fact that a number of ways exist to significantly improve the performance of such systems. This paper describes another such way.

The authors describe four coordinate systems for points on an elliptic curve, namely Affine, Projective, Jacobian and Chudnovsky. Then using these coordinate systems they describe ways to implement the essential cryptographic operation of point multiplication. This is done using a novel combination of the four coordinate systems, which they dub “mixed coordinates”.

The paper is well written and gives a number of examples and explicit formulae which will be useful to engineers working in this area who often find the mathematics in some papers quite duanting. Overall the authors report an improvement of twenty five percent in the performance of the final system. Although the paper describes the details in terms of curves over finite fields of large prime characteristic, it is clear that a similar mixed coordinate system works in fields of even characteristic as well.

11Y16Algorithms; complexity (number theory)
11G05Elliptic curves over global fields
14H50Plane and space curves