Low complexity of a class of normal bases over finite fields

被引：2
|
作者：
Liao, Qunying [2 ]
You, Lin [1 ]
机构：
[1] Hangzhou Dianzi Univ, Coll Commun Engn, Hangzhou 310018, Peoples R China
[2] Sichuan Normal Univ, Coll Math & Software Sci, Chengdu 610066, Peoples R China
来源：
FINITE FIELDS AND THEIR APPLICATIONS | 2011年 / 17卷 / 01期
基金：
浙江省自然科学基金; 美国国家科学基金会;
关键词：
Finite fields; Complexity; Trace mapping; Normal bases; Dual bases;
D O I：
10.1016/j.ffa.2010.09.005
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
It is well known that normal bases are useful for implementations of finite fields in various applications including coding theory, cryptography, signal processing, and so on. In particular, optimal normal bases are desirable. When no optimal normal basis exists, it is useful to have normal bases with low complexity. In this paper, we improve the upper bounds for the complexity of the trace normal bases over finite fields and prove that these upper bounds can be reached for some extension with small degree. In addition, we construct a class of normal bases with low complexity by this way. (C) 2010 Elsevier Inc. All rights reserved.
引用
收藏
页码：1 / 14
页数：14
相关论文
共 50 条
  • [31] On r-primitive k-normal elements over finite fields
    Rani, Mamta
    Sharma, Avnish K.
    Tiwari, Sharwan K.
    FINITE FIELDS AND THEIR APPLICATIONS, 2022, 82
  • [32] Construction of self-dual normal bases and their complexity
    Arnault, Francois
    Pickett, Erik Jarl
    Vinatier, Stephane
    FINITE FIELDS AND THEIR APPLICATIONS, 2012, 18 (02) : 458 - 472
  • [33] Polynomial evaluation over finite fields: new algorithms and complexity bounds
    Michele Elia
    Joachim Rosenthal
    Davide Schipani
    Applicable Algebra in Engineering, Communication and Computing, 2012, 23 : 129 - 141
  • [34] A class of Gaussian normal bases and their dual bases
    Sharma P.L.
    Devi K.
    Sharma, P.L. (plsharma1964@gmail.com), 1741, Taru Publications (20): : 1741 - 1755
  • [35] Further results on a class of permutation polynomials over finite fields
    Li, Nian
    Helleseth, Tor
    Tang, Xiaohu
    FINITE FIELDS AND THEIR APPLICATIONS, 2013, 22 : 16 - 23
  • [36] Polynomial evaluation over finite fields: new algorithms and complexity bounds
    Elia, Michele
    Rosenthal, Joachim
    Schipani, Davide
    APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2012, 23 (3-4) : 129 - 141
  • [37] On the Existence of Pairs of Primitive and Normal Elements Over Finite Fields
    Cícero Carvalho
    João Paulo Guardieiro
    Victor G. L. Neumann
    Guilherme Tizziotti
    Bulletin of the Brazilian Mathematical Society, New Series, 2022, 53 : 677 - 699
  • [38] On the existence of pairs of primitive normal elements over finite fields
    Mamta Rani
    Avnish K. Sharma
    Sharwan K. Tiwari
    Indivar Gupta
    São Paulo Journal of Mathematical Sciences, 2022, 16 : 1032 - 1049
  • [39] On the Existence of Pairs of Primitive and Normal Elements Over Finite Fields
    Carvalho, Cicero
    Guardieiro, Joao Paulo
    Neumann, Victor G. L.
    Tizziotti, Guilherme
    BULLETIN OF THE BRAZILIAN MATHEMATICAL SOCIETY, 2022, 53 (03): : 677 - 699
  • [40] EXISTENCE OF RATIONAL PRIMITIVE NORMAL PAIRS OVER FINITE FIELDS
    Sharma, Rajendra Kumar
    Takshak, Soniya
    Awasthi, Ambrish
    Sharma, Hariom
    INTERNATIONAL JOURNAL OF GROUP THEORY, 2024, 13 (01)
12345