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.
Patent No.:
Date of Patent:
Jan. 10, 2006
Filed:
Dec. 19, 2001
Masahiro Kaminaga, Sakado, JP;
Takashi Endo, Musashimurayama, JP;
Takashi Watanabe, Kokubunji, JP;
Hitachi, Ltd., Tokyo, JP;
Abstract
The present invention makes it difficult for unauthorized parties to estimate processing and a secret key based upon the waveforms of power consumption of an IC card chip by changing a processing order in the IC card chip so that it is not estimated by the attackers. In an information processing apparatus comprising storing means having a program storing part for storing programs and a data storing part for storing data, an operation processing unit, means for inputting data to be operated on in the operation processing unit, and means for outputting operation processing results on the data by the operation processing unit, an arithmetic operation method is provided which comprises the steps of: for two integers Kand K, when finding a value F(K, A) of a function F satisfying F(K+K, A)=F(K, A)◯F(K, A) (◯ denotes an arithmetic operation in a communtative semigroup S. K designates an integer and A designates an element of S), decomposing the K to the sum of m integers K[]+K[]+ . . . K[m−1]; using T(), T(), . . . T(m−1) resulting from rearranging a string of the m integers 0, 1, . . . m−1 by permutation T (the result corresponds one for one to the integer string 0, 1, . . . m−1); and operating on terms F(K[T()], A) to F(K[T(m−1)], A) on the right side of()=(()],)◯(()],)◯ . . .((−1)],) . . .   (expression 1)in the order of F(K[T()], A), F(K[T()], A), . . . F(K[T(m−1)], A) to find F(K, A).