On the polynomial basis of \(\mathrm{GF}(2^n)\) having a small number of trace-one elements

DOI10.1155/2016/9149041zbMath1400.11158OpenAlexW2560411996WikidataQ59141024 ScholiaQ59141024MaRDI QIDQ1793753

Jiantao Wang, Zheng Huang, Dong Zheng

Publication date: 12 October 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2016/9149041

Mathematics Subject Classification ID

Cryptography (94A60) Polynomials over finite fields (11T06)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factorization of polynomials over finite fields
• Swan's theorem for binary tetranomials
• On the number of trace-one elements in polynomial bases for \({\mathbb F}_{2^n}\)
• Open Problems for Polynomials over Finite Fields and Applications

This page was built for publication: On the polynomial basis of \(\mathrm{GF}(2^n)\) having a small number of trace-one elements