| http://www.w3.org/ns/prov#value | - The method in accordance with claim 1 wherein the computing step includes the steps of splitting the term Z(x)=xm mod g(x) into two polynomials Za (x) and Zb (x) both with degree less than r such that Z(x)={Za (x)Xn +Zb (x)}mod g(x), where n is an integer less than r; and configuring a table 1 of a size 2exp(deg(Za (x))) for the squaring operation of the term Za (x) and a table 2 of a size 2exp(de
|
