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 条
  • [41] On the existence of pairs of primitive normal elements over finite fields
    Rani, Mamta
    Sharma, Avnish K.
    Tiwari, Sharwan K.
    Gupta, Indivar
    SAO PAULO JOURNAL OF MATHEMATICAL SCIENCES, 2022, 16 (02): : 1032 - 1049
  • [42] Linear complexity of a class of pseudorandom sequences over a general finite field
    Qi Ye
    Pinhui Ke
    Jian Shen
    Soft Computing, 2018, 22 : 4335 - 4346
  • [43] Inverses of r-primitive k-normal elements over finite fields
    Rani, Mamta
    Sharma, Avnish K.
    Tiwari, Sharwan K.
    Panigrahi, Anupama
    RAMANUJAN JOURNAL, 2024, 63 (03) : 723 - 747
  • [44] Linear complexity of a class of pseudorandom sequences over a general finite field
    Ye, Qi
    Ke, Pinhui
    Shen, Jian
    SOFT COMPUTING, 2018, 22 (13) : 4335 - 4346
  • [45] On the Complexity of Powering in Finite Fields
    Kopparty, Swastik
    STOC 11: PROCEEDINGS OF THE 43RD ACM SYMPOSIUM ON THEORY OF COMPUTING, 2011, : 489 - 498
  • [46] EXPLICIT FORMULAS FOR SELF-COMPLEMENTARY NORMAL BASES IN CERTAIN FINITE-FIELDS
    LEMPEL, A
    SEROUSSI, G
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (04) : 1220 - 1222
  • [47] Complexity bounds for the rational Newton-Puiseux algorithm over finite fields
    Poteaux, Adrien
    Rybowicz, Marc
    APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2011, 22 (03) : 187 - 217
  • [48] Complexity bounds for the rational Newton-Puiseux algorithm over finite fields
    Adrien Poteaux
    Marc Rybowicz
    Applicable Algebra in Engineering, Communication and Computing, 2011, 22 : 187 - 217
  • [49] The average density of K-normal elements over finite fields
    Reis, Lucas
    DESIGNS CODES AND CRYPTOGRAPHY, 2023, 91 (10) : 3285 - 3292
  • [50] Existence of some special primitive normal elements over finite fields
    Anju
    Sharma, R. K.
    FINITE FIELDS AND THEIR APPLICATIONS, 2017, 46 : 280 - 303
12345