Process of security of an electronic unit with cryptoprocessor

1. A process for securing an electronic device incorporating a hardware component capable of autonomous implementation of calculation process f using key K, comprising:

configuring at least one processor to perform the functions of:

calculating at least two new keys K′ i , i is a positive integer, such that at least one of said new keys is identical to said key K, and at least one of said new keys is different from said key K;

executing said calculation process f successively with each of said calculated keys K′ i using said hardware component thereby producing a result corresponding to each calculated key K′ i ; and

returning as an output of the process only the result corresponding to the calculated key K′ i that is identical to said key K.

2. The process according to claim 1 , wherein said calculation process is executed with said keys K′ i in a random order.

3. The process according to claim 1 or 2 , wherein key K is sub-divided into sub-keys K 1 , . . . , K n , and that the procedure involves calculating I=α m new keys K′ 1 , . . . , K′ I , where m represents the number of possible values for one of sub-keys K′ i j of K′ i , in such a way that for a given j (0<j<n+1), sub-keys K′ i j (0<i<I+1) take all the possible values, including the value of sub-key Kj of K and wherein α is a positive integer thereby ensuring that I is a multiple of m.

4. The process according to claim 3 , wherein sub-keys K′ i j (0<i<I+1) take all the possible values α times.

5. The process according to claim 1 or 2 , wherein key K is sub-divided into sub-keys K 1 , . . . , K n , and that there exists at least one i such that key K′ i is different from K for at least one sub-key K′ i j.

6. The process according to claim 5 , wherein key K is sub-divided into sub-keys K 1 , . . . , K n , and that the procedure involves calculating I=α m new keys K′ 1 , . . . , K′ I , where m represents the number of possible values for one of sub-keys K′ i j of K′ i , in such a way that for a given j (O<j<n+1), sub-keys K′ i j (0<i<I+1) take all the possible values, including the value of sub-key Kj of K and wherein α is a positive integer thereby ensuring that I is a multiple of m.

7. The process according to claim 6 wherein sub-keys K′ i j (0<i<I+1) take all the possible values α times.

8. An electronic device incorporating means to store a calculation process, means to execute said process by a processor and capable of autonomous implementation of a calculation process using key K, comprising:

a software module, in conjunction with a hardware component, is implemented to:

calculate at least two new keys K′ i , i is a positive integer, such that at least one of new said keys is identical to said key K, and one of said new keys is different from said key K,

transmit in succession to said hardware component, the new keys calculated to implement said calculation process with each of said new keys K′ i ,

produce a result corresponding to each calculated key K′ i ; and

return as an output of the process only the result corresponding to the calculated key K′ i that is identical to said key K.

9. An electronic device according to claim 8 , wherein said software module transmits in succession the new keys calculated in a random order.

10. A computer storage medium storing computer program instructions executed upon access by a processor on an electronic device to perform the functions of a calculation process f using key K comprising:

calculating at least two new keys K′ i , i is a positive integer, such that at least one of said new keys is identical to said key K, and at least one of said new keys is different from said key K;

executing said calculation process f successively with each of said calculated keys K′ i using a hardware component thereby producing a result corresponding to each calculated key K′ i ; and

returning as an output of the process only the result corresponding to the calculated key K′ i that is identical to said key K.

11. The computer storage medium of claim 10 , wherein said calculation process is executed with said keys K′ i in a random order.

12. The computer storage medium of claim 10 or 11 wherein key K is sub-divided into sub-keys K 1 , . . . , K n , and that there exists at least one i such that key K′ i is different from K for at least one sub-key K′ i j.

13. The computer storage medium of claim 10 or 12 wherein key K is sub-divided into sub-keys K 1 , . . . , K n , and that the procedure involves calculating I=α m new keys K′ 1 , . . . , K′ I , where m represents the number of possible values for one of sub-keys K′ i j of K′ i , in such a way that for a given j (0<j<n+1), sub-keys K′ i j (0<i<I+1) take all the possible values, including the value of sub-key Kj of K and wherein α is a positive integer thereby ensuring that I is a multiple of m.

14. The computer storage medium of claim 13 wherein sub-keys K′ i j (0<i<I+1) take all the possible values α times.