Error detection for encryption or decryption keys

An electronic device comprising a processor and a memory, and configured to implement a method for error detection of an encryption or decryption key, wherein a first data element corresponding to the encryption or decryption key is not stored and made accessible in the memory and is divided in N second data elements independent from the first data element, each second data element being stored in the memory, and first data element being equal to the sum, modulo the dimension of a space comprising the first data element, of the N second data elements,

• wherein an image of the first data element by a linear congruential generation function is stored in the memory, and
• wherein the method comprises determining, by at least the processor, whether the image of the first data element by the linear congruential generation function is equal to the sum, modulo the module of the linear congruential generation function, of a product of an integer varying from 0 to N−1 and an image of the dimension by the linear congruential generation function, and of the images of the second data elements by the linear congruential generation function.

A non-transitory computer-readable medium storing content that cause one or more processors to implement a method for error detection of a data element, wherein a first data element is not stored and made accessible in the computer-readable medium and is divided in N second data elements independent from the first data element, each second data element being stored in the computer-readable medium, and first data element being equal to the sum, modulo the dimension of a space comprising the first data element, of the N second data elements,

• wherein an image of the first data element by a linear congruential generation function is stored in the computer-readable medium, and
• wherein the method comprises determining, by the one or more processors, whether the image of the first data element by the linear congruential generation function is equal to the sum, modulo the module of the linear congruential generation function, of a product of an integer varying from 0 to N−1 and an image of the dimension by the linear congruential generation function, and of the images of the second data elements by the linear congruential generation function.