Electrical computers: arithmetic processing and calculating – Electrical digital calculating computer – Particular function performed
Reexamination Certificate
2005-11-22
2005-11-22
Chaki, Kakali (Department: 2124)
Electrical computers: arithmetic processing and calculating
Electrical digital calculating computer
Particular function performed
C708S492000
Reexamination Certificate
active
06968354
ABSTRACT:
The disclosed technology of the present invention relates to an information processing device such as an IC card, and specifically to the overflow processing which occurs in a modular multiplication operation during crypto-processing. Such overflow processing exhibits a particular pattern of consumption current. It is the subject of the present invention to decrease the relationship between the data processing and the pattern of the consumption current. In the processing procedures for performing a modular exponentiation operation according to the 2 bit addition chain method, the modular multiplication operation to be executed is selected at random, the selected modular multiplication operation is executed for each 2 bits, the correction of the result is performed, and the result of the calculation (i.e, a corrected value or uncorrected value) is outputted.
REFERENCES:
patent: 5764554 (1998-06-01), Monier
patent: 5961578 (1999-10-01), Nakada
patent: 6026421 (2000-02-01), Sabin et al.
patent: 6209016 (2001-03-01), Hobson et al.
patent: 6298135 (2001-10-01), Messerges et al.
patent: 6625631 (2003-09-01), Ruehle
patent: 6748410 (2004-06-01), Gressel et al.
patent: 0 801 345 (1997-04-01), None
patent: 1 006 492 (1999-11-01), None
patent: 1 134 653 (2001-03-01), None
Paul C. Kocher, Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS and Other Systems, Advances in Cryptology—Crypto 96, 16thAnnual International Cryptology Conference, Aug. 18-22, 1996, vol. Conf. 16, pp. 104-113.
Thomas S. Messerges, Ezzy A. Dabbish, Robert H. Sloan, “Power Analysis Attacks of Modular Exponentiation on Smartcards”, Cryptographic Hardware and Embedded Systems, International workshop Aug. 1999, pp 144-157.
Ross Anderson and Markus Kuhn, “Tamper Resistance—A Cautionary Note”, The Second USENIX Workship on Electronic Commerce Proceedings, Oakland, California, Nov. 18-21, 1996, pp. 1-11.
Marc Joye, Arjen K. Lenstra and Jean-Jacques Quisquater, “Chinese Remaindering Based Cryptosystems in the Presence of Faults”, to appear in Journal of Cryptology, pp. 1-5.
Peter Montgomery, “Modular Multiplication Without Trial Division”, Mathematics of Computation, vol. 44, No. 170, Apr. 1985, pp. 519-521.
Endo Takashi
Kaminaga Masahiro
Ohki Masaru
Watanabe Takashi
A. Marquez, Esq. Juan Carlos
Do Chat
Fisher Esq. Stanley P.
Hitachi , Ltd.
LandOfFree
Tamper-resistant modular multiplication method does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Tamper-resistant modular multiplication method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tamper-resistant modular multiplication method will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3460498