Asymmetrical cryptographic communication method and portable object therefore
US6111952A · kind A · utility
Assignee
Inventor
Key dates
| Filing date | Sep 25, 1997 |
| Grant date | Aug 29, 2000 |
| Priority date | — |
| Expiry date | Sep 25, 2017 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L2209/12
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
The invention relates to an asymmetric cryptographic communication process which establishes a correspondence between a first value (x) represented by n elements (x.sub.1, . . . , x.sub.n) of a ring (A) and a second value (y) represented by m elements (y.sub.1, . . . , y.sub.m) of this ring, n and m being integers greater than or equal to 2. The said correspondence is defined by multi variable public polynomials (P.sub.i) of A.sup.n+m+k ->A, with a low total degree, such that there are equations of the type P.sub.i (x.sub.1, . . . , x.sub.n ; y.sub.1, . . . , y.sub.m ; z.sub.1, . . . , z.sub.k)=0, where(z.sub.1, . . . , z.sub.k) are possible intermediate variables and k is an integer. At least the majority of the polynomials (P.sub.i) do not have the form T.sub.i (y.sub.1, . . . , y.sub.m)=S.sub.i (x.sub.1, . . . , x.sub.n), where the S.sub.i s would be polynomials with a total degree of 2 and the T.sub.i s would be polynomials with a total degree of 1.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.