Computing the number of finite field elements with prescribed absolute trace and co-trace

From MaRDI portal
Publication:2632843

DOI10.1007/S12095-018-0336-ZzbMATH Open1412.11139arXiv1711.08306OpenAlexW2898359010WikidataQ129031507 ScholiaQ129031507MaRDI QIDQ2632843FDOQ2632843


Authors: Assen Bojilov, Lyubomir Borissov, Yuri Borissov Edit this on Wikidata


Publication date: 15 May 2019

Published in: Cryptography and Communications (Search for Journal in Brave)

Abstract: In this paper, we address the problem for enumerating the number of finite field elements with prescribed trace and co-trace in case of arbitrary characteristic p. We show that this problem can be reduced to solving a system of p1 linear equations with matrix of coefficients a slight modification of circulant matrix formed by the Kloosterman sums over the field MFp. The presented approach is illustrated in the cases of characteristic p=2,3 and 5.


Full work available at URL: https://arxiv.org/abs/1711.08306




Recommendations




Cites Work


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)