On arithmetical algorithms over finite fields

DOI10.1016/0097-3165(89)90020-4zbMath0696.12013OpenAlexW2167511540MaRDI QIDQ910432

David G. Cantor

Publication date: 1989

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(89)90020-4

zbMATH Keywords

fast Fourier transformfast algorithms for polynomial computationsequence of irreducible polynomials

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06) Finite fields (field-theoretic aspects) (12E20)

Related Items

A New Algorithm for Decoding Reed-Solomon Codes, On design of circuits of logarithmic depth for inversion in finite fields, Computing special powers in finite fields, Fast arithmetic with general Gauß periods, Complexity of computation in finite fields, Univariate polynomial factorization over finite fields, Syndrome decoding in the head: shorter signatures from zero-knowledge proofs, Fast arithmetics in Artin-Schreier towers over finite fields, A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes, Faster Multiplication in GF(2)[x], Fast transforms over finite fields of characteristic two, Computational problems in the theory of finite fields, On fast multiplication of polynomials over arbitrary algebras, Factoring polynomials over finite fields: A survey, Harmonic analysis on \(\text{GF}(p^{p^\infty})\). I., The black-box Niederreiter algorithm and its implementation over the binary field, Subquadratic Polynomial Multiplication over GF(2 m ) Using Trinomial Bases and Chinese Remaindering, Algorithms for exponentiation in finite fields, Unnamed Item, Isomorphisms between Artin-Schreier towers, Factoring high-degree polynomials over $\mathbf F_2$ with Niederreiter's algorithm on the IBM SP2, Polynomial factorization over ${\mathbb F}_2$

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of multiplication in finite fields
• Fast multiplication of polynomials over fields of characteristic 2
• FFT as Nested Multiplication, with a Twist
• A New Algorithm for Factoring Polynomials Over Finite Fields
• Evaluating Polynomials at Fixed Sets of Points
• On Computing the Discrete Fourier Transform
• A new structured design method for convolutions over finite fields, Part I