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:
Apr. 12, 2011
Filed:
Dec. 14, 2006
Vinodh Gopal, Westboro, MA (US);
Erdinc Ozturk, Worcester, MA (US);
Kaan Yuksel, Worcester, MA (US);
Gunnar Gaubatz, Worcester, MA (US);
Wajdi Feghali, Boston, MA (US);
Gilbert M. Wolrich, Framingham, MA (US);
Vinodh Gopal, Westboro, MA (US);
Erdinc Ozturk, Worcester, MA (US);
Kaan Yuksel, Worcester, MA (US);
Gunnar Gaubatz, Worcester, MA (US);
Wajdi Feghali, Boston, MA (US);
Gilbert M. Wolrich, Framingham, MA (US);
Intel Corporation, Santa Clara, CA (US);
Abstract
The present disclosure provides a method for performing modular exponentiation. The method may include generating a first remainder (xp) based on an encrypted message (X) modulo a first prime number (p) and generating a second remainder (xq) based on the encrypted message (X) modulo a second prime number (q). The method may further include generating a third remainder (v1) based on the first remainder (xp) raised to a first private key number (d1) modulo the first prime number (p) and simultaneously generating a fourth remainder (v2) based on the second remainder (xq) raised to a second private key number (d2) modulo the second prime number (q). The method may also include subtracting the fourth remainder (v2) from the third remainder (v1) to yield a result (v1−v2) and multiplying the result (v1−v2) by a constant (c) to produce a second result. The method may additionally include generating a sixth remainder (h) by taking the second result modulo the first prime number (p) and multiplying the sixth remainder (h) by the second prime number (q) to produce a third result. The method may further include adding the third result and the fourth remainder (v2) to yield a final result (Y) and generating, at least in part, a public key based on the final result (Y). Of course, many alternatives, variations and modifications are possible without departing from this embodiment.