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