We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
Fractal mathematical over extended finite fields F<sub>p</sub>[X](f(X)).
- Authors
Sandoval-Ruiz, Cecilia E.
- Abstract
In this paper, we have defined an algorithm for the construction of iterative operations, based on dimensional projections and correspondence between the properties of extended, fields, with respect to modular reduction. For a field with product operations R(x) (ft) D(x), over finite fields, GF[(pm)n-k]. With Gp[x]/(g(f(x}), when, ce the coefficient of the g(x) is replaced, after a modular reduction operation, with characteristic p. ... Thus, the reduced coefficients of the generating polynomial of G contain embedded the modular reduction and thus simplify operations that contain basic finite fields. The algorithm, describes the process of construction of the GF multiplier, it can start at any stage of LFSR; it, is shift, the sequence of operation, from this point on, thanks to the concurrent adaptation, to optimize the energy consumption of the GF iterative multiplier circuit, we can claim that this method is more efficient. From this, it was realized the mathematical formalization of the characteristics of the iterative operations on the extended finite fields has been developed, we are applying a algorithm several times over the coefficients in the smaller field and then in the extended field, concurrent form.
- Subjects
ALGORITHMS; ENERGY consumption; POLYNOMIALS; MATHEMATICAL symmetry
- Publication
Proyecciones - Journal of Mathematics, 2021, Vol 40, Issue 3, p731
- ISSN
0716-0917
- Publication type
Article
- DOI
10.22199/issn.0717-6279-4322