| 摘要 |
The method includes the signature system A being mounted on a public key (n,g) including an integer module n verifying n=pq, where p and q are first numbers chosen such that the discrete logarithmic problem in the assembly Zn is insoluble in practice, and an integer base g chosen in a group Znasterisk in a manner to present an order s which verifies gs =1 module n, this system signature A having a value of the order such that the secret key is associated to this public key , this public key being disposed with a verifying system B. The number s is chosen in a manner not to be divisible by 2j+1, for an integer j such that 0 is less than or equal to j is less than or equal to M, M being a parameter which is a positive integer or zero. |
