On constructing circuits for transforming the polynomial and normal bases of finite fields from one to the other

DOI10.1515/dma.2007.031zbMath1238.12004OpenAlexW2069043947MaRDI QIDQ5439060

Igor S. Sergeev

Publication date: 8 February 2008

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma.2007.031

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Finite fields (field-theoretic aspects) (12E20) Complexity of computation (including implicit computational complexity) (03D15)

Related Items

On design of circuits of logarithmic depth for inversion in finite fields, Subquadratic-time algorithms for normal bases

Cites Work

• Fast rectangular matrix multiplication and applications
• Computing Frobenius maps and factoring polynomials
• Constructing normal bases in finite fields
• Fast Algorithms for Manipulating Formal Power Series
• Normal bases via general Gauss periods
• Subquadratic-time factoring of polynomials over finite fields
• On a quick multiplication in normal bases of finite fields