**Arithmetic of Supersingular Koblitz Curves in Characteristic Three**

*Roberto Avanzi and Clemens Heuberger and Helmut Prodinger*

**Abstract: **We consider digital expansions of scalars for supersingular
Koblitz curves in characteristic three. These are positional
representations of integers to the base of $\tau$,
where $\tau$ is a zero of the characteristic polynomial $T^2 \pm 3\,T + 3$ of
a Frobenius endomorphism.
They are then applied to the improvement of scalar multiplication on the
Koblitz curves.

A simple connection between $\tau$-adic expansions and balanced ternary representations is given.

Windowed non-adjacent representations are considered whereby the digits are elements of minimal norm. We give an explicit description of the elements of the digit set, allowing for a very simple and efficient precomputation strategy, whereby the rotational symmetry of the digit set is also used to reduce the memory requirements. With respect to the current state of the art for computing scalar multiplications on supersingular Koblitz curves we achieve the following improvements: \rm{(i)} speed-ups of up to 40\%, \rm{(ii)} a reduction of memory consumption by a factor of three, \rm{(iii)} our methods apply to all window sizes without requiring operation sequences for the precomputation stage to be determined offline first.

Additionally, we explicitly describe the action of some endomorphisms on the Koblitz curve as a scalar multiplication by an explicitly given integer.

**Category / Keywords: **implementation / elliptic curve cryptosystem; implementation; supersingular Koblitz curves; scalar multiplication

**Date: **received 11 Aug 2010

**Contact author: **clemens heuberger at tugraz at

**Available format(s): **PDF | BibTeX Citation

**Version: **20100813:143650 (All versions of this report)

**Discussion forum: **Show discussion | Start new discussion

[ Cryptology ePrint archive ]