[[abstract]]The circuit complexity of a Massey-Omura normal basis multiplier for a finite field GF(2m) depends on the key function for multiplication. Key functions with minimum complexity, called minimal key functions, are desirable. This paper investigates the complexity of a key function and reports search results of minimal key functions. A table of minimal key functions for m up to 31 is included[[fileno]]2030104010007[[department]]電機工程學
In this article, two digit-serial architectures for normal basis multipliers over GF(2m) are present...
This study presents a survey of algorithms used in field arithmetic over GF (2m) using normal basis ...
This study presents a survey of algorithms used in field arithmetic over GF (2m) using normal basis ...
AbstractIf C(r) denotes the minimum complexity of a normal basis for F2r, we show that if m > 1, n >...
Abstract—For efficient hardware implementation of finite field arithmetic units, the use of a normal...
AbstractÐThe Massey-Omura multiplier of GF \u852m uses a normal basis and its bit parallel version ...
Finite field arithmetic logic is central in the implementation of some error-correcting coders and s...
AbstractIf C(r) denotes the minimum complexity of a normal basis for F2r, we show that if m > 1, n >...
This paper concerns an exhaustive search for normal bases with minimum complexity in finite fields F...
The subject for this thesis is to find a basis which minimizes the number of bit operations involved...
AbstractWe investigate low complexity normal bases in finite fields of the form F2n. First, we prove...
In this paper, we propose a new normal basis multiplication algorithm for GF(2n). This algorithm can...
AbstractA normal basis in GF(qm) is a basis of the form {β,βq,βq2,…,βqm−1}, i.e., a basis of conjuga...
AbstractIt is well known that normal bases are useful for implementations of finite fields in variou...
In this paper, we extend previously known results on the complexities of normal elements. Using algo...
In this article, two digit-serial architectures for normal basis multipliers over GF(2m) are present...
This study presents a survey of algorithms used in field arithmetic over GF (2m) using normal basis ...
This study presents a survey of algorithms used in field arithmetic over GF (2m) using normal basis ...
AbstractIf C(r) denotes the minimum complexity of a normal basis for F2r, we show that if m > 1, n >...
Abstract—For efficient hardware implementation of finite field arithmetic units, the use of a normal...
AbstractÐThe Massey-Omura multiplier of GF \u852m uses a normal basis and its bit parallel version ...
Finite field arithmetic logic is central in the implementation of some error-correcting coders and s...
AbstractIf C(r) denotes the minimum complexity of a normal basis for F2r, we show that if m > 1, n >...
This paper concerns an exhaustive search for normal bases with minimum complexity in finite fields F...
The subject for this thesis is to find a basis which minimizes the number of bit operations involved...
AbstractWe investigate low complexity normal bases in finite fields of the form F2n. First, we prove...
In this paper, we propose a new normal basis multiplication algorithm for GF(2n). This algorithm can...
AbstractA normal basis in GF(qm) is a basis of the form {β,βq,βq2,…,βqm−1}, i.e., a basis of conjuga...
AbstractIt is well known that normal bases are useful for implementations of finite fields in variou...
In this paper, we extend previously known results on the complexities of normal elements. Using algo...
In this article, two digit-serial architectures for normal basis multipliers over GF(2m) are present...
This study presents a survey of algorithms used in field arithmetic over GF (2m) using normal basis ...
This study presents a survey of algorithms used in field arithmetic over GF (2m) using normal basis ...