Computing the number of finite field elements with prescribed absolute trace and co-trace
DOI10.1007/S12095-018-0336-ZzbMATH Open1412.11139arXiv1711.08306OpenAlexW2898359010WikidataQ129031507 ScholiaQ129031507MaRDI QIDQ2632843FDOQ2632843
Authors: Assen Bojilov, Lyubomir Borissov, Yuri Borissov
Publication date: 15 May 2019
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.08306
Recommendations
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Exponential sums (11T23) Other character sums and Gauss sums (11T24)
Cites Work
- Handbook of finite fields
- Title not available (Why is that?)
- Title not available (Why is that?)
- Kloosterman sums and finite field extensions
- The inverses of some circulant matrices
- The cyclotomy of Kloosterman sums
- An enumeration formula for certain irreducible polynomials with an application to the construction of irreducible polynomials over the binary field
Cited In (1)
This page was built for publication: Computing the number of finite field elements with prescribed absolute trace and co-trace
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2632843)