| 摘要 |
The public key cryptographic method generates a random exponent k of length N bits. The Hamming weights C of the exponent are computed and compared to a pre-set value h to determine whether the random value k produces Hamming weights greater than the pre-set value. If it does not the exponent k is rejected and a new random exponent is generated and tested. A value k that generates satisfactory Hamming weights is retained, and used to compute the expression y = g<x>(modp), where g is an integer base and p the modulus, and x is unknown. This expression is then used the exchanges of information with the other entity in the communication.
|
