| 摘要 |
PROBLEM TO BE SOLVED: To inspect whether the orders of all of inspected values as elements of a multiplication group are divisors of specified orders at a high speed. SOLUTION: A variable (p) defining a group, an array g<SB>i</SB>(i=1, 2, ..., n) of a plurality of values to be inspected, a reference order (q), and a safe variable (s) are inputted (S101) and loops of steps S102 to S109 is executed. In each loop, a random number (r) is generated (S102), an inspection product Q as the product of inspected values, selected at random from the array g<SB>i</SB>of inspected values according to the random number, in the group is calculated (S103), and it is judged whether the order of the inspection product Q is a divisor of the order (q) (S104). When the order of the inspection product Q is not a divisor of the order (q), inspection failure is outputted and the process is ended. When the order of the inspection product Q is a divisor of the order (1) and the loop is repeated as many times as the safe variable (s), inspection success is outputted and the process is ended. COPYRIGHT: (C)2004,JPO
|
