| 摘要 |
A cryptosystem for the RSA cryptography which calculates C=Me mod n and, for this calculation, performs an operation C=M1xM2 mod n. An operation <IMAGE> where M'2,j = M2,j - omega delta j lambda x 2 lambda + omega delta (j-1) lambda , <IMAGE> <IMAGE> Rl+1 = 0, and omega = 0 or 1, is performed in the order j=l, l-1, . . . 1 to obtain last R1 as the result of the calculation M1xM2 mod n. The calculation <IMAGE> is performed in a quotient calculating unit, and the calculation M1xM2,j'+2 lambda Rj+1-Qjxn is performed in a main adding unit. Where, variable Rj may be divided into two parts Rj,0 and Rj,1. In this way, the multiplication and the division are simultaneously conducted, thereby to raise the calculation speed. |
