Digital signature algorithm
US5231668A · kind A · utility
Assignee
Inventor
Key dates
| Filing date | Jul 26, 1991 |
| Grant date | Jul 27, 1993 |
| Priority date | — |
| Expiry date | Jul 26, 2011 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L9/3013
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
A method is provided for generating and verifying a digital signature of a message m. This method requires a pair of corresponding public and secret keys (y and x) for each signer, as well as a pair of public and secret values (r and k) generated for each message by the signer. The public value r is calculated according to the rule r=(g.sup.k mod p) mod q. A value s is then selected according to the rule s=k.sup.-1 (H(m)+xr) mod q where H is a known conventional hashing function. The message m, along with the signature (r,s) is then transmitted. When the transmitted signal is received a verification process is provided. The received values of r and s are tested to determine whether they are congruent to 0 mod g. Additionally, r is tested to determine whether it is equal to v mod q, where v is computed from r, s, m and y. For legitimately executed signatures, v=g.sup.k mod p.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.