| 摘要 |
A process for the identification of a claimant by a verifier. The process is of the public key type, where the public exponent is equal to 3. The claimant draws at random a first exponent alpha , calculates r=g alpha mod n and transmits R=r3. The verifier draws at random a second exponent beta , calculates t=g beta mod n, calculates T=t3 mod n and h=H1(Z), where H1 is a hash function, and calculates Z=R3 mod n. The verifier transmits to the claimant the numbers T and h. The claimant calculates Y=T alpha mod n, verifies the result H1(Y), calculates H=H2(Y), where H2 is another hash function, calculates z=rS mod n, and transmits z and H. The claimant also has a secret number S equal to the modulo n cubic root of a number I deduced from its identity so that the number S verifies S3=I mod n. The verifier verifies that H received is equal to H2(Z) and that z3 is equal to RI mod n.
|
