Method for proving the authenticity or integrity of a message by means of a public exponent equal to the power of two
US7386122B1 · kind B1 · utility
Assignees
Inventors
Key dates
| Filing date | Jan 27, 2000 |
| Grant date | Jun 10, 2008 |
| Priority date | — |
| Expiry date | Jan 27, 2020 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L9/3218
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
Proof is established by means of the following parameters: m pairs of private values Q1 and public values G1 m>1, a public module n made of the product of f first factors pj, f>2, a public exponent v, linked to each other by relations of the type: G1.Qiv=1 mod n or G1=Q1v mod n. Said exponent v is such that v=2k where k>1 is a security parameter. Public value G1 is the square g12 of a base number gi that is lower than f first factors pj, so that the two equations: x2=gi mod n and x2=−g1 mod n do not have a solution in x in the ring of the modulo n integers and such that the equation xv=g12 mod n has solutions in x in the ring of the modulus n integers.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.