On the number of trace-one elements in polynomial bases for \({\mathbb F}_{2^n}\)

DOI10.1007/s10623-004-4039-4zbMath1142.11377OpenAlexW2071138259MaRDI QIDQ2491249

Omran Ahmadi, Alfred J. Menezes

Publication date: 29 May 2006

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-004-4039-4

zbMATH Keywords

finite fieldstrace functionpolynomial bases

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Polynomials over finite fields (11T06)

Related Items (10)

A note on the reducibility of binary affine polynomials ⋮ Complexity of computation in finite fields ⋮ The parity of the number of irreducible factors for some pentanomials ⋮ Addendum to Sidel'nikov sequences over nonprime fields ⋮ On the linear complexity of Sidel'nikov sequences over nonprime fields ⋮ On the polynomial basis of \(\mathrm{GF}(2^n)\) having a small number of trace-one elements ⋮ Another Look at Square Roots (and Other Less Common Operations) in Fields of Even Characteristic ⋮ The trace spectra of polynomial bases for \(\mathbb F_{2^n}\) ⋮ An efficient deterministic test for Kloosterman sum zeros ⋮ A Swan-like theorem

Cites Work

• Unnamed Item
• Unnamed Item
• A Swan-like theorem
• Probabilistic Algorithms in Finite Fields
• Cryptographic properties of the Welch-Gong transformation sequence generators

This page was built for publication: On the number of trace-one elements in polynomial bases for \({\mathbb F}_{2^n}\)