发明名称 |
METHOD FOR MULTIPLYING TWO FACTORS FROM GALOIS FIELD AND MULTIPLIER FOR PERFORMING THE SAME |
摘要 |
PROBLEM TO BE SOLVED: To provide a method and a multiplier capable of quickly and efficiently performing polynomial multiplication with minimal memory requirements. SOLUTION: Reduced steps include: d1) a sub-step for providing an intermediate result to be reduced; d2) a sub-step for providing at least one sub-block of a reduction polynomial; d3) a sub-step for multiplying the reduction polynomial with the most-significant m bits of the possibly accumulated intermediate result to be reduced to give a polynomial to be subtracted in which the value of the most-significant bit corresponds to the value of the most-significant bit of the intermediate result to be reduced; d4) a sub-step for subtracting the polynomial to be subtracted from the intermediate result to be reduced and providing the result of this subtraction as a new intermediate result to be reduced; and d5) a sub-step for repeating the execution of the steps d1) to d4) until the intermediate result to be reduced has a width equal to m. COPYRIGHT: (C)2003,JPO
|
申请公布号 |
JP2003263310(A) |
申请公布日期 |
2003.09.19 |
申请号 |
JP20020375919 |
申请日期 |
2002.12.26 |
申请人 |
KONINKL PHILIPS ELECTRONICS NV |
发明人 |
FEUSER MARKUS |
分类号 |
G06F7/72;G09C1/00;(IPC1-7):G06F7/72 |
主分类号 |
G06F7/72 |
代理机构 |
|
代理人 |
|
主权项 |
|
地址 |
|