Inventors list

Assignees list

Classification tree browser

Top 100 Inventors

Top 100 Assignees


Fumaroli

Guillaume Fumaroli, Meudon FR

Patent application numberDescriptionPublished
20100077225Protection Against Side Channel Attacks with an Integrity Check - The invention relates to a method for protecting a sensitive operation by checking the integrity of at least a subset of the data manipulated by the sensitive operation. Data to be checked are divided into blocks, an intermediate integrity check value being computed for each block, the intermediate integrity check values being computed in random order. The invention also relates to a cryptographic device wherein at least one sensitive operation of the cryptographic device is protected by a method according to the invention.03-25-2010
20100103830Integrity of Low Bandwidth Communications - The invention relates to a method for checking the integrity of a set of data packets received by a receiving communication device from a sending communication device, the data packets of the set being received in unpredictable order. The invention also relates to a communication device implementing a method according to the invention, in particular to a smart card.04-29-2010

Guillaume Fumaroli, Meudon Cedex FR

Patent application numberDescriptionPublished
20090092245Protection Against Side Channel Attacks - The invention relates to a cryptographic mechanism and to a cryptographic device incorporating such cryptographic mechanism. The cryptographic mechanism offers a better resistance to side channel attacks than that of known cryptographic mechanisms by incorporating a new type of masking mechanism.04-09-2009

Guillaume Fumaroli, Paris FR

Patent application numberDescriptionPublished
20110129084METHOD OF EXECUTING AN ALGORITHM FOR PROTECTING AN ELECTRONIC DEVICE BY AFFINE MASKING AND ASSOCIATED DEVICE - A method of executing an algorithm includes protecting an electronic device by affine masking. The electronic device executes operations on secret variables x, the secret variables x being binary vectors of a given size N other than zero. The method further includes replacing the secret variables x using an affine masking operation, by the following affine function: m(x)=R.x+r, where R is a random invertible binary matrix with N rows and N columns and r is a random binary vector of size N.06-02-2011