Abstract
In this paper we consider a special type of dual basis for finite fields, GF(2m), where the variants of m are presented in section 2. We introduce our field representing method for efficient field arithmetic(such as field multiplication and field inversion). It reveals a very effective role for both software and hardware(VLSI) implementations, but the aspect of hardware design of its structure is out of this manuscript and so, here, we deal only the case of its software implementation(the efficiency of hardware implementation is appeared in another article submitted to IEEE Transactions on Computers). A brief description of several advantageous characteristics of our method is that (1) the field multiplication in GF(2m) can be constructed only by m + 1 vector rotations and the same amount of vector XOR operations, (2) there is required no additional work load such as basis changing(from standard to dual basis or from dual basis to standard basis as the conventional dual based arithmetic does), (3) the field squaring is only bit-by-bit permutation and it has a good regularity for its implementation, and (4) the field inversion process is available to both cases of its implementation using Fermat’s Theorem and using almost inverse algorithm[], especially the case of using the almost inverse algorithm has an additional advantage in finding (computing) its complete inverse element(i.e., there is required no pre-computed table of the values, x -k ; k = 1, 2,...).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.