IP Library Granted Patent US 8,744,074
Granted Patent B2
US 8,744,074 · App. 12/658,990 · Granted Jun 3, 2014

Method and device for countering fault attacks

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 8,744,074
App. No.
12/658,990
Granted
Jun 3, 2014
Kind
B2
Abstract

The public exponent e of an RSA key is embedded in a RSA key object that lacks this exponent. During exponentiation, the public exponent e may be extracted and used to verify that the result of the exponentiation is correct. The result is output only if this is the case. The invention counters fault-attacks. Also provided are an apparatus and a computer program product.

Claims (23)

1. A method for calculating an exponentiation, the method being resistant against fault-attacks and comprising the steps, in a device, of:

obtaining a RSA private key object, the RSA private key object being associated with a matching public exponent;

obtaining a result of an exponentiation using the RSA private key object;

obtaining the matching public exponent; and

verifying, using the matching public exponent, that the result of the exponentiation is correct;

wherein, in standard mode: the RSA private key object comprises the RSA modulus N, the matching public exponent e being obtained by extraction from the RSA modulus N in which it is embedded; and

wherein, in CRT mode: the RSA private key object comprises the factors of the RSA modulus N, the matching public exponent e being obtained by extraction from one of the factors of the RSA modulus N or from a product of the factors of the RSA modulus N.

2. The method of claim 1 , wherein the matching public exponent e is comprised in the leading bits of the binary representation of RSA modulus N.

3. The method of claim 2 , wherein, in CRT mode, the RSA modulus N is obtained by multiplication of its factors.

4. A device for calculating an exponentiation, the device being resistant against fault-attacks and comprising a processor configured to:

obtain a RSA private key object, the RSA private key object being associated with a matching public exponent;

obtain a result of an exponentiation using the RSA private key object;

verify, using the matching public exponent, that the result of the exponentiation is correct; and

obtain the matching public exponent e:

in standard mode, from a RSA modulus N comprised in the RSA private key object; and

in CRT mode, from the at least one of factors of the RSA modulus N, the factors of the RSA modulus N being comprised in the RSA private key object.

5. A non-transitory computer readable medium having stored thereon instructions that, when executed by a processor, performs the steps of:

obtaining a RSA private key object, the RSA private key object being associated with a matching public exponent;

obtaining a result of an exponentiation using the RSA private key object;

obtaining the matching public exponent; and

verifying, using the matching public exponent, that the result of the exponentiation is correct;

wherein, in standard mode: the RSA private key object comprises the RSA modulus N, the matching public exponent e being obtained by extraction from the RSA modulus N in which it is embedded; and

wherein, in CRT mode: the RSA private key object comprises the factors of the RSA modulus N, the matching public exponent e being obtained by extraction from one of the factors of the RSA modulus N or from a product of the factors of the RSA modulus N.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 20, 2020
From: THOMSON LICENSING S.A.S.
To: MAGNOLIA LICENSING LLC
Reel/Frame 053570/0237 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 18, 2010
From: JOYE, MARC
To: THOMSON LICENSING
Reel/Frame 024026/0717 →