http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-11354428-B2
Outgoing Links
Predicate | Object |
---|---|
assignee | http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_0f6497a773f8dc5bc5d43432a518524d |
classificationCPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L9-0618 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F21-602 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F21-72 |
classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F21-60 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F21-72 |
filingDate | 2020-10-09-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
grantDate | 2022-06-07-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
inventor | http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_d150dc9c1e5b507df3b2523c35ae04fc http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_056b4684e4a0169352239c4fd4449c5d |
publicationDate | 2022-06-07-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
publicationNumber | US-11354428-B2 |
titleOfInvention | Data values encryption method |
abstract | A method encrypts, using an encryption circuit, a first data value having a number n of first binary words, each word having a number m of bits. The encrypting includes generating a second data value having a same number n of second binary words of m bits each and outputting a result of the encryption. The number n is an integer greater than or equal to 3, m and n do not have a common integer division, and n or m is even. A second binary word of the second data value having a rank i is equal to a sum of: a first binary word having a same rank i; and a product of: a complement of a first binary word having rank ((i+1)modulo n), shifted by a first number of bit positions; and a first binary word having rank ((i+2)modulo n), shifted by a second number of bit positions. |
priorityDate | 2019-10-14-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
type | http://data.epo.org/linked-data/def/patent/Publication |
Incoming Links
Total number of triples: 24.