A Small and Fast Software Implementation of Elliptic Curve Cryptosystems over GF ( p ) on a 16-Bit Microcomputer
Toshio Hasegawa, Junko Nakajima, Mitsuru Matsui · 1999
this paper we propose a new typeof prime characteristic of a base field suitablefi small implementation. For arithmetic algorithms of an elliptic curve, in order to realize 4 Kbyte code/data size, which we regard as a reasonably small sizefz most applications on M16C, we mainly adopted standard methods described in [6]. We also show an improved versionof basic arithmeticfti