| 摘要 |
PROBLEM TO BE SOLVED: To solve the following problem that speeding up of encryption processing of elliptic curve cryptosystem is retarded by the fact that multiplication and division take more than half of the processing time and the degree increases in multiplication, therefore, in an OEF system which is said to be the fastest, two-stage arithmetic operation is performed wherein polynomial product is taken and the remainder is taken in a modulus polynomial. SOLUTION: In the arithmetic processing of elliptic curve cryptosystem using an extension field GF(p<SP>m</SP>), the processing speed greatly varies depending on the way of selecting an irreducible polynomial f(x) and a base. In this invention, an irreducible polynomial f(x)=(x<SP>2m+1</SP>-1)/(x-1)=x<SP>2m</SP>+x<SP>2m-1</SP>+ ... +x+1 is used for elliptic curve encryption processing, and a base äω+ω<SP>-1</SP>,ω<SP>2</SP>+ω<SP>-2</SP>, ...,ω<SP>m</SP>+ω<SP>-m</SP>} is constituted by the zero pointωwhich makes f(ω)=0. Thus, since an arbitrary element is given as an self-contradictory element, the computational complexity can be reduced by defining multiplication by using the CVMA method and the operation speed can be enhanced. The block diagram shows the configuration of a multiplier in this invention. COPYRIGHT: (C)2006,JPO&NCIPI
|
