# US 2020/0351100 A1 · Cryptographic method for verifying data

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2020/0351100 A1
- Document ID: US20200351100A1
- Status: Published application
- Kind: A1
- Application number: 16/934,376
- Filed: 2020-07-21
- Published: 2020-11-05
- Earliest claimed: 2019-02-19
- Assignees: Bruno Sangle-Ferriere
- Inventors: Bruno SANGLE-FERRIERE
- Web page: https://patentgrep.com/patent/US20200351100A1

## CPC

- H04L 9/0656: {Pseudorandom key sequence combined element-for-element with data sequence, e.g. one-time-pad [OTP] or Vernam's cipher}
- H04L 9/3239: {involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD}
- G06F 21/602: {Providing cryptographic facilities or services}
- G06F 21/64: Protecting data integrity, e.g. using checksums, certificates or signatures
- H04L 9/0643: {Hash functions, e.g. MD5, SHA, HMAC or f9 MAC}
- H04L 9/3236: {using cryptographic hash functions}
- H04L 63/0428: {wherein the data content is protected, e.g. by encrypting or encapsulating the payload}
- H04L 63/0435: {wherein the sending and receiving network entities apply symmetric encryption, i.e. same key used for encryption and decryption (cryptographic mechanisms or cryptographic arrangements for symmetric key encryption H04L9/06)}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Cryptographic method for verifying data method, implemented by at least one apparatus, for comparing a first dataset and a second dataset, in particular with a view to determining whether these two datasets are identical, this method not requiring the presence of these two datasets in the apparatus, and comprising the following steps: a) mixing a number, called the mixer number, with the first dataset, using a mixing function in order to obtain mixed data, b) hashing the mixed data using a hash function, and c) comparing the hash thus obtained in step b) with a third dataset assumed to be the hash of the second dataset mixed with the same mixer number as that used in step a) and with the same mixing function.

## Claims

### Claim 1

A method for verifying with an apparatus the integrity of a message originating from a sender, the method comprising:
i. the apparatus receiving the message and an identifier of the message, said message forming a first dataset,
ii. generating a number, called mixer number,
iii. mixing the mixer number with the first dataset using a mixing function, in order to obtain mixed data,
iv. hashing the mixed data using a hash function,
v. optionally encrypting the mixer number,
vi. the apparatus sending the identifier of the message and the optionally encrypted mixer number to the sender of the message,
vii. the apparatus receiving an encrypted second dataset, originating from the sender,
viii. attempting to decrypt the second dataset during a timeout period,
ix. after a predetermined number of unsuccessful decryption attempts, placing the received message in a queue or ignoring it, otherwise if at least one decryption attempt is successful,
x. comparing the hash obtained in step ix with the second dataset decrypted in step viii and assumed to be the hash of the message mixed with the same mixer number as that used in step iii and with the same mixing function, the integrity of the message being ensured if the second dataset decrypted in step viii and the hash obtained in step iv are identical.

### Claim 2 (depends on 1)

The method according to claim 1, comprising, between steps vi and vii:
the sender receiving the identifier of the message and the optionally encrypted mixer number,
optionally decrypting the mixer number,
identifying, using the identifier of the message, the message sent to the apparatus,
mixing the message with the optionally decrypted mixer number using the mixing function,
hashing the data resulting from the preceding step using the hash function,
encrypting the hash resulting from the preceding step, and
sending to the apparatus the encrypted hash.

### Claim 3 (depends on 1)

The method according to claim 1, the decryption in step viii being carried out using a symmetric key, if the encryption in step v is carried out using a single-use key.

### Claim 4 (depends on 1)

The method according to claim 1, the decryption in step viii being carried out using a single-use key, if the encryption in step v was carried out using a symmetric key.

### Claim 5

The method for verifying with an apparatus the integrity of a message forming a first dataset originating from a sender, the method comprising:
i. the apparatus receiving the message, an encrypted second dataset and an encrypted number, called mixer number,
ii. attempting to decrypt the second dataset and the encrypted number during a timeout period,
iii. after a predetermined number of unsuccessful decryption attempts, placing the encrypted second dataset and the encrypted number in a queue or ignoring them, otherwise if at least one decryption attempt is successful,
iv. mixing the message with the mixer number, using a mixing function, in order to obtain mixed data,
v. hashing the mixed data using a hash function, and
vi. comparing the hash obtained in step iv with the second dataset decrypted in step ii and assumed to be the hash of the first dataset mixed with the same mixer number as that used in step iii and with the same mixing function, the integrity of the message being ensured if the hash obtained in step iv and the second dataset decrypted in step ii are identical.

### Claim 6 (depends on 5)

The method according to claim 5, comprising, before step i:
the sender generating the mixer number,
mixing the mixer number with the message, using the mixing function,
hashing the data resulting from the preceding step using the hash function,
encrypting the hash resulting from the preceding step and forming the second dataset,
encrypting the mixer number, and
sending to the apparatus the message, the encrypted second dataset and the encrypted mixer number.

### Claim 7

The method, implemented by a first apparatus and a second apparatus, for comparing a first dataset present in the first apparatus and a second dataset present in the second apparatus, the method comprising:
i. the first apparatus mixing a number, called mixer number, with the first dataset, using a mixing function, in order to obtain mixed data,
ii. the first apparatus hashing the mixed data using a hash function,
iii. the first apparatus encrypting the mixer number,
iv. the apparatus sending, to the second apparatus, the encrypted mixer number,
v. the apparatus receiving an encrypted hash of the second dataset,
vi. attempting to decrypt the encrypted hash during a timeout period,
vii. after a predetermined number of unsuccessful decryption attempts, placing the encrypted hash in a queue or ignoring it, otherwise if at least one decryption attempt is successful,
viii. comparing the hash obtained in step ii with the hash decrypted in step vi.

### Claim 8 (depends on 7)

The method according to claim 7, comprising, between steps iv and v:
the second apparatus receiving the encrypted mixer number,
decrypting the mixer number,
creating a modified copy of the second dataset using the mixer number and the mixing function,
hashing the modified copy of the second dataset using the hash function,
encrypting the hash resulting from the preceding step, and
the second apparatus sending to the apparatus the encrypted hash of the second dataset.

### Claim 9 (depends on 1)

The method according to claim 1, the mixing function being an XOR logic function.

### Claim 10 (depends on 1)

The method according to claim 1, the mixing function consisting in adding the mixer number to the end of the first dataset.

### Claim 11 (depends on 1)

The method according to claim 1, the mixing function being an encrypting function using the mixer number as encryption key to encrypt the first dataset.

### Claim 12 (depends on 1)

The method according to claim 1, the mixer number being generated randomly.

### Claim 13 (depends on 1)

The method according to claim 1, the hash function being chosen among SHA1, SHA2, SHA256, MD5 and the Jenkins function.

### Claim 14 (depends on 1)

A computer-program product containing instructions readable by the processor of an apparatus, for implementing the method according to claim 1.

### Claim 15 (depends on 1)

The method according to claim 1, the mixing function being an XOR logic function.

### Claim 16 (depends on 1)

The method according to claim 1, the mixing function consisting in adding the mixer number to the end of the first dataset.

### Claim 17 (depends on 1)

The method according to claim 1, the mixing function being an encrypting function using the mixer number as encryption key to encrypt the first dataset.

### Claim 18 (depends on 1)

The method according to claim 1, the mixer number being generated randomly.

### Claim 19 (depends on 1)

The method according to claim 1, the hash function being chosen among SHA1, SHA2, SHA256, MD5 and the Jenkins function.

### Claim 20 (depends on 1)

A computer-program product containing instructions readable by the processor of an apparatus, for implementing the method according to claim 1.

### Claim 21 (depends on 5)

The method according to claim 5, the mixing function being an XOR logic function.

### Claim 22 (depends on 5)

The method according to claim 5, the mixing function consisting in adding the mixer number to the end of the first dataset.

### Claim 23 (depends on 5)

The method according to claim 5, the mixing function being an encrypting function using the mixer number as encryption key to encrypt the first dataset.

### Claim 24 (depends on 5)

The method according to claim 5, the mixer number being generated randomly.

### Claim 25 (depends on 5)

The method according to claim 5, the hash function being chosen among SHA1, SHA2, SHA256, MD5 and the Jenkins function.

### Claim 26 (depends on 5)

A computer-program product containing instructions readable by the processor of an apparatus, for implementing the method according to claim 5.

### Claim 27 (depends on 7)

The method according to claim 7, the mixing function being an XOR logic function.

### Claim 28 (depends on 7)

The method according to claim 7, the mixing function consisting in adding the mixer number to the end of the first dataset.

### Claim 29 (depends on 7)

The method according to claim 7, the mixing function being an encrypting function using the mixer number as encryption key to encrypt the first dataset.

### Claim 30 (depends on 7)

The method according to claim 7, the mixer number being generated randomly.

### Claim 31 (depends on 7)

The method according to claim 7, the hash function being chosen among SHA1, SHA2, SHA256, MD5 and the Jenkins function.

### Claim 32 (depends on 7)

A computer-program product containing instructions readable by the processor of an apparatus, for implementing the method according to claim 7.
