Abstract
In this paper, the complexity of a squaring operation using polynomial basis (PB) in a class of finite fields F2m is evaluated. The main results are as follows: 1. When the field is generated with an irreducible trinomial (Formula presented), where both m and k are odd, a PB squaring operation requires (Formula presented) bit operations. 2. When the field is generated with an irreducible trinomial (Formula presented), where m + k is odd and (Formula presented), a PB squaring operation requires (Formula presented) bit operations. 3. When the field is generated with an irreducible trinomial (Formula presented), a PB squaring operation requires (Formula presented) bit operations.
Cite
CITATION STYLE
Wu, H. (2001). On complexity of polynomial basis squaring in F2m. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2012, pp. 118–129). Springer Verlag. https://doi.org/10.1007/3-540-44983-3_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
