Algorithms of accelerated division on modulo 2

Two algorithms of accelerated division on modulo 2 are proposed. Let us consider polynomials: A(x)=/spl Sigma//sub i=0//sup n/a/sub n-i/x/sup n-i/, B(x)=/spl Sigma//sub i=0//sup m/a/sub m-i/x/sup m-i/, where a/sub i/, b/sub j/ ? {0,1}; n ? m. Generally only one bit of quotient is computed in one step. The first algorithm is based on based on simultaneous computation of high- and low-order bits of the quotient. Theorem 1. Consider polynomials A(x) and B(x) specified by the above equation. If s is the number of the high-order insignificant zeros of B(x) and /spl exist/j:0/spl les/j\n\n\t\t