http://rdf.ncbi.nlm.nih.gov/pubchem/patent/FR-2788650-A1
Outgoing Links
Predicate | Object |
---|---|
assignee | http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_c2ad08a4aa907765c63eb6f434abea45 |
classificationCPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L9-3247 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L9-302 |
classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H04L9-30 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G09C1-00 |
filingDate | 1999-01-14-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
inventor | http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_d8c679ed8d87abb89f5e75bbf2df9524 |
publicationDate | 2000-07-21-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
publicationNumber | FR-2788650-A1 |
titleOfInvention | PUBLIC AND PRIVATE KEY CRYPTOGRAPHIC PROCESS |
abstract | A cryptographic method comprises a method for generating public (K) and private (K ') keys comprising - the selection of two distinct prime numbers p and q, of similar size and the calculation of the number n equal to the product p. q; - the calculation of the least common multiple of the numbers (p-1) and (q-1) lambda (n) = PPCM (p-1, q-1) - the determination of a number g, 0 <= g <n2 which satisfies the following two conditions: a) g is invertible modulo n2 etb) ord (g, n2) = 0 mod n The public key is formed by the parameters n and g and its private key is formed by the parameters p, q and lambda (n) or by the parameters p and q. A method of encryption of a number m representative of a message, 0 <= m <n, consists in calculating the cryptogram c = gm mod n2. |
isCitedBy | http://rdf.ncbi.nlm.nih.gov/pubchem/patent/WO-03007540-A1 |
priorityDate | 1999-01-14-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
type | http://data.epo.org/linked-data/def/patent/Publication |
Incoming Links
Predicate | Subject |
---|---|
isDiscussedBy | http://rdf.ncbi.nlm.nih.gov/pubchem/compound/CID1292 http://rdf.ncbi.nlm.nih.gov/pubchem/substance/SID419549439 |
Total number of triples: 16.