| 摘要 |
A computerized public key process for encoding data makes it possible to achieve an even greater data privacy than known public key processes. The process achieves this by the fact that the public key is a number n that is the product of two large primary numbers p and q, and the private key includes these two primary numbers, and the data set m is encoded by breaking it down into the blocks m1, . . . , mk that are interpreted as numbers smaller than n, and the encoded data set includes the coefficients ak-1, . . . a0 of the polynomial P(x)=xk+ak-1xk-1+ . . . +a1x+a0: =(x-m1)x . . . x(x-mk) mod n. Decoding is accomplished by first determining the zero positions of the polynomials P(x) mod p in finite field GF(p) and P(x) mod q in finite field GF(q) with the help of the private key and then combining them with the help of the Chinese remainder theorem to yield solutions of the equation P(x)=0 mod n, where the blocks m1, . . . mk of data set m are contained in the quantity of solutions of the equation P(x)=0 mod n thus calculated. This invention can be used in all fields where the known public key methods are also used.
|
