| 摘要 |
A cryptography method using a key holder having a number m = 1 of private keys Q1, Q2,, Q m and respective public keys G1, G 2,, Gm, where each key pair (Q i, Gi) (where i = 1,, m) fits either the equation Gi = Qiv mod n, or the relation Gi xQiv = 1 mod n, where n is a public integer equal to the product of f private prime factors (where f > 1), denoted by p1,.., pf, of which at least two are different, and exponent v is a public integer equal to a power of 2. In particular, the invention teaches the mathematical structure that can be imparted to the public keys in order to make it impossible to calculate said private keys (within a reasonable amount of time) on the basis of the public parameters, unless the prime factors are known. The invention further relates to various devices for carrying out the method.
|
