A Finite Field Multiplier Based on All-One Irreducible Polynomials
A finite field and polynomial technology, applied in the computer field, can solve the problems of low operation speed of finite field multiplication and influence of operation efficiency, and achieve the effect of improving operation speed.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0040]In order to make the objects, technical solutions, and advantages of the present invention, the embodiments of the present invention will be further described in detail below with reference to the accompanying drawings.
[0041] Embodiments of the present invention provide a limited multiplier multiplier based on all unsuccessful polynomials, see figure 1 , Including controller 1, input control module 2, output control module 3, finite domain arithmetic calculator 4, and arithmetic module 5;
[0042] The controller 1 is configured to control and schedule data transmission between the input control module 2, the output control module 3, and the limited domain operator 4;
[0043] The input control module 2 is used to detect a limited domain GF (2 n When there is a full-time non-comparative polynomial, the multiplication number A (X) and multiplication calculations B (x);
[0044] The limited domain operator 4 is configured to invoke the arithmetic module 5 to perform a limite...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


