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:
Mar. 06, 2001
Filed:
Jun. 30, 1998
Lih-Jyh Weng, Shrewsbury, MA (US);
Diana Langer, Northboro, MA (US);
Quantum Corp., Milpitas, CA (US);
Abstract
A system for producing a quotient B/A, where A and B are elements of GF(2,), 2M+1 is prime and 2 is a primitive element of GF(2M+1), first determines A,and then multiplies B by A,. The system uses a (2M+1)-bit representation for A and produces, directly from A, an element C=A,, where C also is an element of GF(2,) which is a subfield of GF(2,). The system produces M+1 bits to represent C by performing bit manipulations that are equivalent to permuting the (2M+1)-bits to produce A,and multiplying the permuted bits by A. The bit manipulations are: c,=&Sgr;a,a,; c,=&Sgr;a,a,. . . c,=&Sgr;a,a,where the a,'s and c,'s are the coefficients of A and C, respectively. The system retrieves C,from a (2,−1)-element lookup table and multiplies C,=A,by A,to produce A,. This multiplication is performed as the exclusive-OR'ing of M+1 sums of cyclically shifted copies of A,, which is a permutation of the 2,+1 bits of A. The multiplication of B by A,is also performed as the exclusive-OR'ing of cyclically shifted copies of a (2M+1)-bit representation of B.