| 摘要 |
<P>PROBLEM TO BE SOLVED: To execute multiplication at high speed by using a small memory size when a processing unit (g) is large. Ž<P>SOLUTION: In a multiplication device 10, an input/output part 12 inputs respective input values A(x), B(x), F(x), a multiplication device control part 13 partitions an input value B(x)(=x<SP>(s-1)g</SP>B<SB>S-1</SB>(x)+x<SP>(s-2)g</SP>B<SB>S-2</SB>(x)+...+x<SP>ig</SP>B<SB>i</SB>(x)+...+x<SP>g</SP>B<SB>1</SB>(x)+B<SB>0</SB>(x)) for each processing unit (g), values of (s) pieces B<SB>s-1</SB>(x), ..., B<SB>0</SB>(x) are created, and a M table creating part 14 creates an M table composed the calculation result of M[i]=A(x)x<SP>ig</SP>mod F(x) of for each order (i) of values B<SB>i</SB>(x). A T table creating part 15 refers to the M table, and creates a T table composed the calculation result of T[i]=M[i]B<SB>i</SB>(x) mod F(x) of for each order (i). A multiplication executing part 16 calculates the sum total of the calculation result T[s-1], ..., T[0] of the T table, and outputs it as a multiplication result P(x)=A(x)B(x) mod F(x). Ž<P>COPYRIGHT: (C)2010,JPO&INPIT Ž
|
