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:
Sep. 07, 2010

Filed:

Sep. 21, 2005
Applicants:

Kouichi Itoh, Kawasaki, JP;

Masahiko Takenaka, Kawasaki, JP;

Naoya Torii, Kawasaki, JP;

Inventors:

Kouichi Itoh, Kawasaki, JP;

Masahiko Takenaka, Kawasaki, JP;

Naoya Torii, Kawasaki, JP;

Assignee:

Fujitsu Limited, Kawasaki, JP;

Attorney:
Primary Examiner:
Assistant Examiner:
Int. Cl.
CPC ...
G06F 7/38 (2006.01); G06F 7/00 (2006.01);
U.S. Cl.
CPC ...
Abstract

A method for calculating a conversion parameter of the Montgomery modular multiplication to improve the efficiency of software installation, comprising a first step for calculating H=2×R (mod n) (where v is an integer, v≧1, and (m×k)/v is an integer), a second step for calculating H=2×R (mod n) from H=2×R (mod n) by repeating H=REDC(H, H)with respect to i=1, 2, . . . , p (where p represents an integer satisfying the condition 2≧(m×k)/v>2, REDC represents the Montgomery modular multiplication REDC(a, b)=a×b×R(mod n), and x^i represents exponential computation x); and a third step for calculating H=R(mod n) by calculating H=REDC(H, g)with respect to Hobtained in the second step when 2>(m×k)/v (where g=2, E(p, m, k)=2×m−(v×2)/k) and finally outputting Has R(mod n).


Find Patent Forward Citations

Loading…