Computational method and apparatus for finite field arithmetic
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
May 6, 1986
Grant Date -
N/A
app pub date -
Sep 14, 1982
filing date -
Nov 30, 1981
priority date (Note) -
Expired
status (Latency Note)
Importance
Abstract
Elements of the finite field GF(2.sup.m) are represented by a vector of m binary digits in such a way that multiplication can be performed by using the same logic function to compute each binary component of the product of two elements, squaring can be performed by logic circuitry that rotates the vector representing the element to be squared, and addition can be performed by logic circuitry that forms the modulo-two sum of the corresponding components of the two vectors representing the elements to be summed.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Advertisement
Advertisement
Advertisement
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully