| 摘要 |
In an example quoted, the communication is a set of numbers m and this is split up into blocks, with numbers smaller than n, the product of the two prime numbers p + q. A polygon is formed, P(x) = xk + ak-1xk-1+...a, x + ao, with the coefficients, aR-11...Ao, depending on a random number. From this polygon, other polygons P(x) mod p + P(x) mod q are derived, and the solutions, z of the equation ÄP(x) mod mÜ = 0 along with the random number, are combined for the signature. |
