MULTIPLICATION METHOD FOR FINITE FIELDS, CALCULATOR, AND PROGRAM

摘要

This table management means retains, as a table, (2^m) first bit strings, which are the result of multiplying a first element, which is an element of a finite field and one multiplication target, and (2^m) elements of the finite field, wherein m bits for each n bits from the nth bit is set to 0 or 1 and other bits are set to 0. This iterative computation means performs doubling over the finite field on the results of a previous shift and table reference computation, and repeats shifts and table reference computations, which involve performing exclusive OR operations on each bit of the first bit string selected from the aforementioned table on the basis of the result of the doubling and a second element, which is an element of the finite field and the other multiplication target.