Pages that link to "Item:Q1240012"
From MaRDI portal
The following pages link to Fast multiplication of polynomials over fields of characteristic 2 (Q1240012):
Displaying 50 items.
- On the complexity of skew arithmetic (Q260085) (← links)
- Complexity of computation in finite fields (Q378003) (← links)
- A note on the paper ``Multiplication of polynomials modulo \(x^n\)'' by Murat Cenk and Ferruh Özbudak (Q418751) (← links)
- Fast arithmetic with general Gauß periods (Q598216) (← links)
- A note on Gao's algorithm for polynomial factorization (Q633632) (← links)
- Functional decomposition of polynomials: the tame case (Q753496) (← links)
- Functional decomposition of polynomials: the wild case (Q755793) (← links)
- Faster polynomial multiplication via multipoint Kronecker substitution (Q840717) (← links)
- On arithmetical algorithms over finite fields (Q910432) (← links)
- On the deterministic complexity of factoring polynomials over finite fields (Q911294) (← links)
- Fast arithmetic for triangular sets: from theory to practice (Q1025397) (← links)
- A cache-friendly truncated FFT (Q1029334) (← links)
- Fast algorithms for the characteristic polynomial (Q1058849) (← links)
- A lower bound for polynomial multiplication (Q1086218) (← links)
- Factoring polynomials and primitive elements for special primes (Q1095971) (← links)
- On fast multiplication of polynomials over arbitrary algebras (Q1186518) (← links)
- Fast multiplication on elliptic curves over small fields of characteristic two (Q1281784) (← links)
- Simple multivariate polynomial multiplication (Q1346473) (← links)
- Efficient decomposition of separable algebras. (Q1432890) (← links)
- Algorithms for exponentiation in finite fields (Q1581128) (← links)
- Computing the bound of an Ore polynomial. Applications to factorization (Q1757021) (← links)
- Elliptic periods and primality proving (Q1762314) (← links)
- A note on the multiple-recursive matrix method for generating pseudorandom vectors (Q1786872) (← links)
- Efficient decomposition of associative algebras over finite fields (Q1976671) (← links)
- Amortized multi-point evaluation of multivariate polynomials (Q2099269) (← links)
- Normal bases from 1-dimensional algebraic groups (Q2188980) (← links)
- Saber on ESP32 (Q2229290) (← links)
- Fast amortized multi-point evaluation (Q2238846) (← links)
- Improved method for finding optimal formulas for bilinear maps in a finite field (Q2272384) (← links)
- Faster polynomial multiplication over finite fields using cyclotomic coefficient rings (Q2274408) (← links)
- Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals (Q2280315) (← links)
- Fast Hermite interpolation and evaluation over finite fields of characteristic two (Q2284960) (← links)
- Arithmetic complexity of certain linear transformations (Q2352607) (← links)
- The arithmetic computational complexity of linear transforms (Q2356497) (← links)
- Computing Frobenius maps and factoring polynomials (Q2366168) (← links)
- Polynomial evaluation and interpolation on special sets of points (Q2387413) (← links)
- Fast systematic encoding of multiplicity codes (Q2422714) (← links)
- Fast computation of special resultants (Q2457312) (← links)
- The complexity and depth of Boolean circuits for multiplication and inversion in some fields \(\mathrm{GF}(2^{n})\) (Q2513076) (← links)
- Elliptic periods for finite fields (Q2517811) (← links)
- An isomorphism test for modules over a non-commutative PID. Applications to similarity of Ore polynomials. (Q2635074) (← links)
- Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications (Q2674000) (← links)
- Analysis of Rabin's irreducibility test for polynomials over finite fields (Q2772930) (← links)
- Efficient Leakage Resilient Circuit Compilers (Q2790050) (← links)
- Finding roots in \(\mathbb F_{p^n}\) with the successive resultants algorithm (Q2878836) (← links)
- Faster Polynomial Multiplication via Discrete Fourier Transforms (Q3007620) (← links)
- Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity (Q3058727) (← links)
- Irregular primes to 163 million (Q3094304) (← links)
- Polynomial factorization over ${\mathbb F}_2$ (Q3147181) (← links)
- A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes (Q3540050) (← links)
