首页>
外国专利>
Checking Arithmetic operations using residue modulo generation by applying the modulo operations of the prime factors of the checking value.
Checking Arithmetic operations using residue modulo generation by applying the modulo operations of the prime factors of the checking value.
展开▼
机译：通过应用校验值素数的模运算，使用余数模生成来检查算术运算。
展开▼
页面导航
摘要
著录项
相似文献
摘要
Disclosed is a method and an apparatus using residue modulo checking for arithmetic operations. To get a high Modulo m and thus a high residue modulo checking coverage within a checking flow 31, at least two modulo operations 32, 33 are separately applied in parallel, a first Modulo q0 operation and at least one second Modulo qn operation, where q0, q1, q2,... qn-1, qn, are different primes with m=q0*q1*q2*. . .*qn-1*qn. The checking is done by comparing the residue modulo of the result of an arithmetic operation 36 with the results of the modulo operations on the inputs of the arithmetic operation 35. The modulo operations may be provided by a modulo decode for the modulos applied in the parallel flows or by providing a modulo shift table. The values of m may be 15 or 255 and the values of q may be 3 and 5 or 3, 5 and 17, respectfully.
展开▼
