http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-109416894-B
Outgoing Links
| Predicate | Object |
|---|---|
| classificationCPCAdditional | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L2209-46 |
| classificationCPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G09C1-00 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F21-72 |
| classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G09C1-00 |
| filingDate | 2017-06-30-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| grantDate | 2021-12-31-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| publicationDate | 2021-12-31-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| publicationNumber | CN-109416894-B |
| titleOfInvention | Secret computing system, secret computing device, secret computing method, and recording medium |
| abstract | Efficiently read multiple elements from a hidden permutation. Input the permutation <a>=(<a[0]>,... ,<a[n‑1]>), the cryptic text <x> of an integer x of 0 or more and less than n, and m integers i0,...,im-1 of 0 or more and less than n. The concealment offset unit (12) hides the arrangement <a> of the concealed text only by concealing the shift <x>, and finds the arrangement a'=(a'[0],...,a that only shifts the arrangement a to the left by x '[n-1]) the permutation of cryptic texts <a'>=(<a'[0]>,...,<a'[n-1]>). The arrangement generating unit (13) generates an arrangement <b>=(<a'[i0]>,...,<a'[im-1]>) from the arrangement <a'> of the occult text. |
| priorityDate | 2016-07-06-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/CID161104 http://rdf.ncbi.nlm.nih.gov/pubchem/substance/SID453095146 |
Total number of triples: 14.