Method, system, device for proving the authenticity of an entity and/or the integrity and/or the authenticity of a message using specific prime factors
US7266197B1 · kind B1 · utility
3Cited by
5References
12Claims
0Family size
Assignees
Inventors
Key dates
| Filing date | Jan 27, 2000 |
| Grant date | Sep 4, 2007 |
| Priority date | — |
| Expiry date | Jan 27, 2020 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L9/3218
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
The proof is provided by means of the following parameters: a public module n formed by the product of f prime factors pi, f>2; a public superscript v; m base numbers gi, m>1. The base numbers gi are such that the two equations: x2≡gi mod n and x2≡−gi mod n cannot de solved in x in the ring of integers modulo n, and such that the equation xv≡gi2 mod n can be solved in x in the ring of integers modulo n in the case where the public superscript v is in the form v=2k, wherein k is a security parameter.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.