抄録
A fast method for arithmetic modulo a polynomial over GF(2) is proposed. In this method, any polynomial can be calculated modulo any polynomial over GF(2) at high speed, while no restrictions are imposed on the dividend or the divisor polynomial. The calculation time is shown to be proportional to the logarithm of the order of the dividend polynomial.
The fast method is compared with the conventional division algorithm in terms of the calculation time, so that it becomes clear that the fast method is much faster than the conventional one.
The application to a delayed version of msequence of high degree is demonstrated.
