Fast multiplication of polynomials over fields of characteristic 2
From MaRDI portal
Publication:1240012
DOI10.1007/BF00289470zbMath0362.65011OpenAlexW1907666253MaRDI QIDQ1240012
Publication date: 1977
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00289470
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)
Related Items
Relative class number of imaginary Abelian fields of prime conductor below 10000, Computing Frobenius maps and factoring polynomials, A lower bound for polynomial multiplication, Faster polynomial multiplication via multipoint Kronecker substitution, Factoring polynomials and primitive elements for special primes, An isomorphism test for modules over a non-commutative PID. Applications to similarity of Ore polynomials., Computing special powers in finite fields, Polynomial evaluation and interpolation on special sets of points, Polynomial Multiplication over Finite Fields in Time \( O(n \log n \), Fast arithmetic with general Gauß periods, Complexity of computation in finite fields, Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications, On Matrices With Displacement Structure: Generalized Operators and Faster Algorithms, Normal bases from 1-dimensional algebraic groups, Fast systematic encoding of multiplicity codes, A note on Gao's algorithm for polynomial factorization, On arithmetical algorithms over finite fields, On the deterministic complexity of factoring polynomials over finite fields, A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes, Faster Multiplication in GF(2)[x], Differential Privacy on Finite Computers, Efficient decomposition of separable algebras., Fast computation of special resultants, Saber on ESP32, Efficient decomposition of associative algebras over finite fields, On fast multiplication of polynomials over arbitrary algebras, Faster Polynomial Multiplication via Discrete Fourier Transforms, Fast amortized multi-point evaluation, Computing the bound of an Ore polynomial. Applications to factorization, Factoring polynomials over finite fields: A survey, Elliptic periods and primality proving, A Gröbner free alternative for polynomial system solving, Analysis of Rabin's irreducibility test for polynomials over finite fields, Improved method for finding optimal formulas for bilinear maps in a finite field, Faster polynomial multiplication over finite fields using cyclotomic coefficient rings, Efficient Leakage Resilient Circuit Compilers, Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals, A note on the multiple-recursive matrix method for generating pseudorandom vectors, Fast Hermite interpolation and evaluation over finite fields of characteristic two, The complexity and depth of Boolean circuits for multiplication and inversion in some fields \(\mathrm{GF}(2^{n})\), Elliptic periods for finite fields, Functional decomposition of polynomials: the tame case, Functional decomposition of polynomials: the wild case, Irregular primes to 163 million, Fast arithmetic for triangular sets: from theory to practice, Subquadratic Polynomial Multiplication over GF(2 m ) Using Trinomial Bases and Chinese Remaindering, A cache-friendly truncated FFT, Algorithms for exponentiation in finite fields, Unnamed Item, Unnamed Item, Amortized multi-point evaluation of multivariate polynomials, Arithmetic complexity of certain linear transformations, Polynomial factorization over ${\mathbb F}_2$, On the complexity of skew arithmetic, Finding roots in with the successive resultants algorithm, The arithmetic computational complexity of linear transforms
Cites Work
