| 摘要 |
A public-key method for encrypting data. The method according to the present invention proceeds from the known public-key method, and is intended to provide a higher level of security. The method according to the present invention achieves this in that the public key is a number n that is the product of two large prime numbers P and q, and the secret key consists of these two prime numbers; and in that the data set m is encrypted in that it is broken down into blocks m1, ..., mk, which are interpreted as numbers smaller than n, and the encrypted data set consists of the coefficients ak-1, ...,a0 of the polynomial P(x)=xk+ak-1xk-1+...+a1x+a0:=(x-m1) and decrypting is effected in that, first, the zero positions of the polynomials P(x) mod p in GF(p) and P(x) mod q in GF(q) are determined with the help of the secret key and these are then combined with the help of the Chinese residual set, to form solutions of the equation P(x) = 0 mod n, the blocks m1, ...,mk of the data set m being contained in the quantity of the solutions to P(x) =0 mod n that have been so calculated. Use of the present invention is possible in all areas in which the known public-key method is used.
|
