| 摘要 |
The computing device calculates an equivalence H<SUB>0</SUB>≡2<SUP>m*k+1 </SUP>(mod n) relating to a divisor n of 2<SUP>m*k+1 </SUP>(step A), computes an equivalence H≡2<SUP>E(p, m, k) </SUP>(mod n) of 2<SUP>E(p, m, k) </SUP>(mod n) from H<SUB>0 </SUB>by an REDC operation (step B), and performs a correction operation by H=REDC (H, G)<SUB>n </SUB>for g=2<SUP>k*G(p, m, k) </SUP>when 2<SUP>p</SUP>>mxk (step C).
|
