Public key identification process using two hash functions
US6125445A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | May 13, 1998 |
| Grant date | Sep 26, 2000 |
| Priority date | — |
| Expiry date | May 13, 2018 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L9/3218
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
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.sup..alpha. mod n and transmits R=r.sup.3. The verifier draws at random a second exponent .beta., calculates t=g.sup..beta. mod n, calculates T=t.sup.3 mod n and h=H.sub.1 (Z), where H.sub.1 is a hash function, and calculates Z=R.sup.3 mod n. The verifier transmits to the claimant the numbers T and h. The claimant calculates Y=T.sup..alpha. mod n, verifies the result H.sub.1 (Y), calculates H=H.sub.2 (Y), where H.sub.2 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 S.sup.3 =I mod n. The verifier verifies that H received is equal to H.sub.2 (Z) and that z.sup.3 is equal to RI mod n.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.