| Elliptic Curve Cryptosystem (ECC) has the highest bit security among Public-Key Cryptosystems. This thesis mainly has a study of the fast implementation problems of the ECC—the scalar multiplication of the point. Firstly, some basic concepts about ECC are introduced;then the scalar multiplication under affine coordinate is discussed, we make a research and analysis of the side channel attack of scalar multiplication used in portable device, give out a new scalar multiplication algorithm which has the advantage of efficiency over other protected algorithm; and an improvement of the standard scalar multiplication algorithm proposed by IEEE1363 is made with the efficiency increasing by about 10%; at last, we deal with the using of complex multiplication in scalar multiplication algorithm, we generalize the methods and deduce a complete computing procedure, with proposing a new method which used several different fast endomorphism ,we give out an approach to boost the scalar multiplication with fast endomorphism.
|
PDF Full Text Request