I have to estimate if it is possible to compute a signature with the algorithm ECDSA for the curve ANSI::secp128r1 on a 80C51 Microcontroller in about two seconds.
So I studied a little bit the implementation of this algorithm in crypto++ Version 5.1 and start now with some questions about these theme. The class ECP contains the low level operation like point addition, point doubling and skalar multiplaction for elliptic curve over the field GF(p) with p a prime number. The methods Add and Double of the class ECP operate with Points in affine coordinates as far as i interpret the C++ code correct. The implementation of these algorithm corespond to the specification P1363 A.10.1. Would it be not more efficient to transform the points into projective coordinates? The method ScalarMultiply calls the Method SilmultaneousMultiply which converts the point to projektive coordinates as much as I understood. The rest of the algorithm is not clear to me. Is there a reference to an algorithm which explains what happens in SimultaneousMultiply? ---------------------------------------------------------------------------- Stefan Berglas Dipl. Physiker TELEKURS Card Solutions Security Managment Hardturmstrasse 201 CH-8021 Zuerich Direktwahl : +41 (0) 1 279 64 47 E-Mail: [EMAIL PROTECTED] <mailto:[EMAIL PROTECTED]> ----------------------------------------------------------------------------
<<application/ms-tnef>>
