The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Feb. 22, 2022

Filed:

Jun. 28, 2018
Applicant:

Thales Dis France SA, Meudon, FR;

Inventor:

David Vigilant, Meudon, FR;

Assignee:

THALES DIS FRANCE SA, Meudon, FR;

Attorneys:
Primary Examiner:
Int. Cl.
CPC ...
G06F 7/76 (2006.01); G06F 21/75 (2013.01); H04L 9/00 (2006.01); H04L 9/06 (2006.01);
U.S. Cl.
CPC ...
G06F 7/764 (2013.01); G06F 21/755 (2017.08); H04L 9/003 (2013.01); H04L 9/0631 (2013.01); G06F 2207/7233 (2013.01); H04L 2209/04 (2013.01); H04L 2209/16 (2013.01);
Abstract

The present invention relates to a method for securing against N-order side-channel attacks a cryptographic process using in a plurality of encryption rounds an initial Substitution box Scomprising the steps of: —generating (E) a first randomized substitution box Sby masking said initial substitution box Ssuch that S(x XOR m)=S(x) XOR m, with m, muniformly-distributed random values, for any input value x of the initial substitution box S, —generating (E) a first transrandomized Substitution box S(1,1) from the first randomized substitution box Sand from masks m, m'such that S(1, 1)[x]=S[x xor (mxor m)] xor (mxor m′) for any input value x of the first transrandomized Substitution box S(1,1), —generating (E) from the first transrandomized Substitution box S(1,1) a N−1th transrandomized Substitution box S(1, N−1) by performing iteratively N−2 times a step of generation of a ith transrandomized Substitution box S(1, i) from a i−1th transrandomized substitution box S(1, i−1) and from a plurality of masks m 1,i, m′, m, m′such that S(1, i)[x]=S(1, i−1)[x xor (mxor m)] xor (m′xor m′) for any input value x of the ith transrandomized substitution box S(1, i), with i an integer comprised in {2, . . . N−1}, —performing the cryptographic process using (E) the N−1th transrandomized Substitution box S(1, N−1) instead of the initial Substitution box Sin at least said first round of the cryptographic process.


Find Patent Forward Citations

Loading…