On constructing circuits for transforming the polynomial and normal bases of finite fields from one to the other
From MaRDI portal
Publication:5439060
DOI10.1515/dma.2007.031zbMath1238.12004MaRDI QIDQ5439060
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
68Q25: Analysis of algorithms and problem complexity
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
12E20: Finite fields (field-theoretic aspects)
03D15: Complexity of computation (including implicit computational complexity)
Related Items
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