Finite field towers: Iterated presentation and complexity of arithmetic.

DOI10.1006/FFTA.2001.0337MaRDI QIDQ1609402zbMATH OpenOpenAlexFDO

Authors Valentine B. Afanassiev, Alexander A. Davydov

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 inversionfast multiplicationfinite field towers

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2154092
• scientific article; zbMATH DE number 1498779
• Complexity of Boolean schemes for arithmetic in some towers of finite fields
• On tame towers over finite fields
• scientific article; zbMATH DE number 1498780
• Recursive towers of function fields over finite fields
• Finite Fields and Applications
• scientific article; zbMATH DE number 2231485
• On number fields towers defined by iteration of polynomials
• Polynomial-time presentations of algebraic number fields

Cites work

• scientific article; zbMATH DE number 429512 (Why is no real title available?)
• scientific article; zbMATH DE number 3882549 (Why is no real title available?)
• scientific article; zbMATH DE number 3121635 (Why is no real title available?)
• scientific article; zbMATH DE number 3928865 (Why is no real title available?)
• scientific article; zbMATH DE number 1498779 (Why is no real title available?)
• scientific article; zbMATH DE number 1498780 (Why is no real title available?)
• Computational Complexity of Fourier Transforms Over Finite Fields
• Fast multiplication of large numbers
• Infinite Algebraic Extensions of Finite Fields
• The explicit construction of irreducible polynomials over finite fields

Cited in

(5)

• The complexity and depth of Boolean circuits for multiplication and inversion in some fields \(\mathrm{GF}(2^{n})\)
• Optimal tower fields
• A tower of Artin-Schreier extensions of finite fields and its applications
• scientific article; zbMATH DE number 2154092 (Why is no real title available?)
• Complexity of computation in finite fields

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1609402)