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. 14, 2017

Filed:

Jun. 09, 2015
Applicant:

Renesas Electronics Corporation, Kawasaki-shi, Kanagawa, JP;

Inventors:

Kazuhiko Fukushima, Tokyo, JP;

Seishiro Nagano, Kanagawa, JP;

Assignee:
Attorney:
Primary Examiner:
Int. Cl.
CPC ...
H04L 29/06 (2006.01); H04L 9/00 (2006.01); H04L 9/08 (2006.01); G06F 21/72 (2013.01); H04L 9/30 (2006.01);
U.S. Cl.
CPC ...
H04L 9/004 (2013.01); G06F 21/72 (2013.01); H04L 9/0841 (2013.01); H04L 9/302 (2013.01);
Abstract

There is a need to perform recalculation against a fault attack on any public key e within a time period required for one-time modulo exponentiation. A modulo exponentiation operation is expressed as Y=XmodN. The modulo exponentiation operation is performed to yield C=XmodN, C=XmodN, and T=X^modN, where d' denotes two's complement of d and n denotes the number of bits in d. The modulo exponentiation operation determines whether or not a remainder resulting from the product of a value of Cand a value of Cmodulo N matches a value of T. The modulo exponentiation operation assigns the value of Cto Y if a match is found. The modulo exponentiation operation reports an error if a match is not found. The modulo exponentiation operation applies an RSA decryption process to a modulo exponentiation operation using the Chinese remainder theorem.


Find Patent Forward Citations

Loading…