| 摘要 |
PROBLEM TO BE SOLVED: To provide a method of masking processing used for generating a number sequence. SOLUTION: The method includes the generation of the first number sequence contained in a Galois field GF[M]. The method also includes the execution of the first modification to the first number in the first number sequence. The first modification includes the summation of the first number, with the result of the remainder computation, using P executed for the second number of the first number sequence preceding the first number as modulus. M is relatively prime, with respect to the P. The method, further, includes the execution of the second modification to the first random number. The second modification comprises a remainder computation that uses using the P as the modulus. The second modification is executed after the first modification. The method includes the repetition of the first and second modifications, regarding a plurality of numbers including the first number sequence, in order to generate the second number sequence. COPYRIGHT: (C)2009,JPO&INPIT
|
