scientific article; zbMATH DE number 1253982
From MaRDI portal
Publication:4226960
Recommendations
Cited in
(33)- On fast multiplication of polynomials over arbitrary algebras
- Threshold data structures and coding theory
- Computing in degree \(2^k\)-extensions of finite fields of odd characteristic
- Fast multivariate multi-point evaluation revisited
- A new efficient factorization algorithm for polynomials over small finite fields
- Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic
- Improving the algorithms of Berlekamp and Niederreiter for factoring polynomials over finite fields
- On the Cipolla-Lehmer type algorithms in finite fields
- On the complexity exponent of polynomial system solving
- Taking roots over high extensions of finite fields
- Polynomial factorization over ${\mathbb F}_2$
- Fast polynomial factorization and modular composition
- scientific article; zbMATH DE number 3880116 (Why is no real title available?)
- scientific article; zbMATH DE number 5630829 (Why is no real title available?)
- A remark on factorisation
- scientific article; zbMATH DE number 4069025 (Why is no real title available?)
- Genus 2 point counting over prime fields
- scientific article; zbMATH DE number 1263216 (Why is no real title available?)
- scientific article; zbMATH DE number 1273636 (Why is no real title available?)
- Subquadratic-time factoring of polynomials over finite fields
- Fast Decomposition of Polynomials with Known Galois Group
- Algebraic problems equivalent to beating exponent 3/2 for polynomial factorization over finite fields
- Computing isomorphisms and embeddings of finite fields
- Univariate polynomial factorization over finite fields with large extension degree
- On the computation of r-th roots in finite fields
- On the weakness of ring-LWE mod prime ideal \(\mathfrak{q}\) by trace map
- Faster modular composition
- Encounters in symbolic computation: ideas for the ages
- Plane curve germs and contact factorization
- Modular composition via factorization
- Fast modular composition using spiroids
- On the deterministic complexity of factoring polynomials over finite fields
- Fast rectangular matrix multiplication and some applications
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4226960)
