We present a new normal basis multiplication scheme using a multiplexer-based algorithm. In this algorithm, the proposed multiplier processes in parallel and has a multiplexer-based structure that uses MUX and XOR gat...We present a new normal basis multiplication scheme using a multiplexer-based algorithm. In this algorithm, the proposed multiplier processes in parallel and has a multiplexer-based structure that uses MUX and XOR gates instead of AND and XOR gates. We show that our multiplier for type-1 and type-2 normal bases saves about 8% and 16%, respectively, in space complexity as compared to existing normal basis multipliers. Finally, the proposed architecture has regular and modular con-figurations and is well suited to VLSI implementations.展开更多
A formula on the complexity of the normal bases generated by prime Gauss period overfinite fields is presented in terms of cyclotomic numbers.Then,the authors determine explicitly thecomplexity of such normal bases an...A formula on the complexity of the normal bases generated by prime Gauss period overfinite fields is presented in terms of cyclotomic numbers.Then,the authors determine explicitly thecomplexity of such normal bases and their dual bases in several cases where the related cyclotomicnumbers have been calculated.Particularly,the authors find several series of such normal bases withlow complexity.展开更多
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).展开更多
Let F_q be a finite field of characteristic p. In this paper, by using the index sum method the authors obtain a sufficient condition for the existence of a primitive elementα∈ F_(q^n) such that α + α^(-1)is also ...Let F_q be a finite field of characteristic p. In this paper, by using the index sum method the authors obtain a sufficient condition for the existence of a primitive elementα∈ F_(q^n) such that α + α^(-1)is also primitive or α + α^(-1)is primitive and α is a normal element of F_(q^n) over F_q.展开更多
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.展开更多
正规基在有限域的许多应用领域中有广泛应用:编码理论、密码学、信号传送等.Z.X.Wan等(Finite Fields and Their Applications,2007,13(4):411-417.)给出了Fqn在Fq上的Ⅰ型最优正规基的对偶基的复杂度为:3n-3(q为偶数)或3n-2(q为奇数)....正规基在有限域的许多应用领域中有广泛应用:编码理论、密码学、信号传送等.Z.X.Wan等(Finite Fields and Their Applications,2007,13(4):411-417.)给出了Fqn在Fq上的Ⅰ型最优正规基的对偶基的复杂度为:3n-3(q为偶数)或3n-2(q为奇数).这是一类类似于k-型高斯正规基的低复杂度正规基.最近,廖群英等(四川大学学报:自然科学版,2010,47(6):1221-1224.)给出了2-型高斯正规基的对偶基及其复杂度.在此基础上,给出了一般的k-型高斯正规基N的对偶基以及当n≥k≥1时,N的复杂度的一个上界.进而证明了当k=3时,此上界可达到,并由此给出了所有(弱)自对偶的k-型高斯正规基.展开更多
文摘We present a new normal basis multiplication scheme using a multiplexer-based algorithm. In this algorithm, the proposed multiplier processes in parallel and has a multiplexer-based structure that uses MUX and XOR gates instead of AND and XOR gates. We show that our multiplier for type-1 and type-2 normal bases saves about 8% and 16%, respectively, in space complexity as compared to existing normal basis multipliers. Finally, the proposed architecture has regular and modular con-figurations and is well suited to VLSI implementations.
基金supported by the National Fundamental Science Research Program 973 of China under Grant No. 2004 CB3180000the State Key Lab. (Information Security) of China
文摘A formula on the complexity of the normal bases generated by prime Gauss period overfinite fields is presented in terms of cyclotomic numbers.Then,the authors determine explicitly thecomplexity of such normal bases and their dual bases in several cases where the related cyclotomicnumbers have been calculated.Particularly,the authors find several series of such normal bases withlow complexity.
基金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).
基金supported by the National Natural Science Foundation of China(No.11401408)the Natural Science Foundation of Sichuan Province(No.14ZA0034)+2 种基金the Sichuan Normal University Key Project Foundation(No.13ZDL06)supported by the National Natural Science Foundation of China(No.11001170)the Natural Science Foundation of Shanghai Municipal(No.13ZR1422500)
文摘Let F_q be a finite field of characteristic p. In this paper, by using the index sum method the authors obtain a sufficient condition for the existence of a primitive elementα∈ F_(q^n) such that α + α^(-1)is also primitive or α + α^(-1)is primitive and α is a normal element of F_(q^n) over F_q.
文摘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.
文摘正规基在有限域的许多应用领域中有广泛应用:编码理论、密码学、信号传送等.Z.X.Wan等(Finite Fields and Their Applications,2007,13(4):411-417.)给出了Fqn在Fq上的Ⅰ型最优正规基的对偶基的复杂度为:3n-3(q为偶数)或3n-2(q为奇数).这是一类类似于k-型高斯正规基的低复杂度正规基.最近,廖群英等(四川大学学报:自然科学版,2010,47(6):1221-1224.)给出了2-型高斯正规基的对偶基及其复杂度.在此基础上,给出了一般的k-型高斯正规基N的对偶基以及当n≥k≥1时,N的复杂度的一个上界.进而证明了当k=3时,此上界可达到,并由此给出了所有(弱)自对偶的k-型高斯正规基.
