中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

2 records (took 0.019 seconds)

    Checking Arithmetic operations using residue modulo generation by applying the modulo operations of the prime factors of the checking value.
    2.
    发明专利
    Checking Arithmetic operations using residue modulo generation by applying the modulo operations of the prime factors of the checking value. 未知

    公开(公告)号：GB2456624A

    公开(公告)日：2009-07-22

    申请号：GB0822772

    申请日：2008-12-15

    Applicant: IBM

    Inventor： GERWIG GUENTER ,  KROENER KLAUS MICHAEL ,  HAESS JUERGEN

    IPC: G06F11/00 ,  G06F7/72 ,  G06F11/10

    Abstract: 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.

Patent Agency Ranking