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:
Dec. 02, 2008
Filed:
Mar. 11, 2003
Hans Eberle, Mountain View, CA (US);
Nils Gura, San Carlos, CA (US);
Russell A. Brown, Palo Alto, CA (US);
Sheueling Chang-shantz, Cupertino, CA (US);
Vipul Gupta, Los Altos, CA (US);
Hans Eberle, Mountain View, CA (US);
Nils Gura, San Carlos, CA (US);
Russell A. Brown, Palo Alto, CA (US);
Sheueling Chang-Shantz, Cupertino, CA (US);
Vipul Gupta, Los Altos, CA (US);
Sun Microsystems, Inc., Santa Clara, CA (US);
Abstract
Modular multiplication of two elements X(t) and Y(t), over GF(2), where m is a field degree, may utilize field degree to determine, at least in part, the number of iterations. An extra shift operation may be employed when the number of iterations is reduced. Modular multiplication of two elements X(t) and Y(t), over GF(2), may include a shared reduction circuit utilized during multiplication and reduction. In addition, a modular multiplication of binary polynomials X(t) and Y(t), over GF(2), may utilize the Karatsuba algorithm, e.g., by recursively splitting up a multiplication into smaller operands determined according to the Karatsuba algorithm.