| 摘要 |
<P>PROBLEM TO BE SOLVED: To reduce the operation cost of modular exponentiation operation where a secret key is expressed by random numbers, quotients, and remainders in an Euclid's division algorithm. <P>SOLUTION: RSA encryption processing is performed by using modular exponentiation operation where a secret key is expressed by random numbers, quotients, and remainders in an Euclid's division algorithm. In particular, the secret key is divided by random numbers r having a bit length being (1/(a positive integer)) of a bit length of a modulus n of modular exponential operation to be used in the RAS encryption processing to decompose the secret key to quotients and remainders, and the decomposed quotients are furthermore divided by the random numbers to decompose the quotients to quotients and remainders, and thereby the secret key is handled as a second-order or higher-order expression of the random numbers r. Thus the operation using random numbers r having a short bit length is possible. <P>COPYRIGHT: (C)2013,JPO&INPIT |
