For software implementations, word-level normal basis multiplication algorithms utilize the full data-path of the processor, and hence are more efficient than the bit-level multiplication algorithm presented in the IE...For software implementations, word-level normal basis multiplication algorithms utilize the full data-path of the processor, and hence are more efficient than the bit-level multiplication algorithm presented in the IEEE standard P1363-2000. In this paper, two word-level normal basis multiplication algorithms are proposed for GF（2^n）. The first algorithm is suitable for high complexity normal bases, while the second algorithm is fast for type-I optimal normal bases and low complexity normal bases. Theoretical analyses and experimental results both indicate that the presented algorithms are efficient in GF（2^233）, GF（2^283）, GF（2^409）, and GF（2^571）, which are four of the five binary fields recommended by the National Institute of Standards and Technology （NIST） for the elliptic curve digital signature algorithm （ECDSA） applications.展开更多
The notion of normal elements for finite fields extension was generalized as k-normal elements by Huczynska et al.(2013).Several methods to construct k-normal elements were presented by Alizadah et al.(2016)and Huczyn...The notion of normal elements for finite fields extension was generalized as k-normal elements by Huczynska et al.(2013).Several methods to construct k-normal elements were presented by Alizadah et al.(2016)and Huczynska et al.(2013),and the criteria on k-normal elements were given by Alizadah et al.(2016)and Antonio et al.(2018).In the paper by Huczynska,S.,Mullen,G.,Panario,D.and Thomson,D.(2013),the number of k-normal elements for a fixed finite field extension was calculated and estimated.In this paper the authors present a new criterion on k-normal elements by using idempotents and show some examples.Such criterion was given for usual normal elements before by Zhang et al.(2015).展开更多
For a prime p and a positive integer k,let q=p^(k) and F_(q)^(n) be the extension field of F_(q).We derive a sufficient condition for the existence of a primitive element α in F_(q)^(n) such that α^(3)-α+1 is also ...For a prime p and a positive integer k,let q=p^(k) and F_(q)^(n) be the extension field of F_(q).We derive a sufficient condition for the existence of a primitive element α in F_(q)^(n) such that α^(3)-α+1 is also a primitive element of F_(q)^(n) ,a sufficient condition for the existence of a primitive normal element a in F_(q)^(n) over F_(q) such that α(3)-α+1 is a primitive element of F_(q)^(n) ,and a suficient condition for the existence of a primitive normal element a in F_(q)^(n) over F_(q) such that а^(3)-а+1 is also a primitive normal element of F_(q)^(n) over F_(q).展开更多
By means of F[x]-lattice basis reduction algorithm, a new algorithm is presented for synthesizing minimum length linear feedback shift registers (or minimal polynomials) for the given mul-tiple sequences over a field ...By means of F[x]-lattice basis reduction algorithm, a new algorithm is presented for synthesizing minimum length linear feedback shift registers (or minimal polynomials) for the given mul-tiple sequences over a field F. Its computational complexity is O(N2) operations in F where N is the length of each sequence. A necessary and sufficient condition for the uniqueness of minimal polynomi-als is given. The set and exact number of all minimal polynomials are also described when F is a finite field.展开更多
文摘For software implementations, word-level normal basis multiplication algorithms utilize the full data-path of the processor, and hence are more efficient than the bit-level multiplication algorithm presented in the IEEE standard P1363-2000. In this paper, two word-level normal basis multiplication algorithms are proposed for GF（2^n）. The first algorithm is suitable for high complexity normal bases, while the second algorithm is fast for type-I optimal normal bases and low complexity normal bases. Theoretical analyses and experimental results both indicate that the presented algorithms are efficient in GF（2^233）, GF（2^283）, GF（2^409）, and GF（2^571）, which are four of the five binary fields recommended by the National Institute of Standards and Technology （NIST） for the elliptic curve digital signature algorithm （ECDSA） applications.
基金supported by the National Natural Science Foundation of China(No.11571107)the Natural Science Basic Research Plan of Shaanxi Province of China(No.2019JQ-333).
文摘The notion of normal elements for finite fields extension was generalized as k-normal elements by Huczynska et al.(2013).Several methods to construct k-normal elements were presented by Alizadah et al.(2016)and Huczynska et al.(2013),and the criteria on k-normal elements were given by Alizadah et al.(2016)and Antonio et al.(2018).In the paper by Huczynska,S.,Mullen,G.,Panario,D.and Thomson,D.(2013),the number of k-normal elements for a fixed finite field extension was calculated and estimated.In this paper the authors present a new criterion on k-normal elements by using idempotents and show some examples.Such criterion was given for usual normal elements before by Zhang et al.(2015).
基金This work was funded by the Council of Scientific and Industrial Research,New Delhi,Government of India’s research grant no.09/796(0099)/2019-EMR-I.
文摘For a prime p and a positive integer k,let q=p^(k) and F_(q)^(n) be the extension field of F_(q).We derive a sufficient condition for the existence of a primitive element α in F_(q)^(n) such that α^(3)-α+1 is also a primitive element of F_(q)^(n) ,a sufficient condition for the existence of a primitive normal element a in F_(q)^(n) over F_(q) such that α(3)-α+1 is a primitive element of F_(q)^(n) ,and a suficient condition for the existence of a primitive normal element a in F_(q)^(n) over F_(q) such that а^(3)-а+1 is also a primitive normal element of F_(q)^(n) over F_(q).
基金This work was supported by the National Natural Science Foundation of China (Grant Nos. 19931010, G1999035804).
文摘By means of F[x]-lattice basis reduction algorithm, a new algorithm is presented for synthesizing minimum length linear feedback shift registers (or minimal polynomials) for the given mul-tiple sequences over a field F. Its computational complexity is O(N2) operations in F where N is the length of each sequence. A necessary and sufficient condition for the uniqueness of minimal polynomi-als is given. The set and exact number of all minimal polynomials are also described when F is a finite field.
