Finite field towers: Iterated presentation and complexity of arithmetic.

DOI10.1006/ffta.2001.0337zbMath1037.11088OpenAlexW2347133766MaRDI QIDQ1609402

Alexander A. Davydov, Valentine B. Afanassiev

Publication date: 15 August 2002

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/ffta.2001.0337

zbMATH Keywords

computational complexityfast multiplicationfast inversionfinite field towers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30)

Related Items (2)

Complexity of computation in finite fields ⋮ The complexity and depth of Boolean circuits for multiplication and inversion in some fields \(\mathrm{GF}(2^{n})\)

Cites Work

• The explicit construction of irreducible polynomials over finite fields
• Fast multiplication of large numbers
• Infinite Algebraic Extensions of Finite Fields
• Computational Complexity of Fourier Transforms Over Finite Fields
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finite field towers: Iterated presentation and complexity of arithmetic.