scientific article; zbMATH DE number 1254267
From MaRDI portal
Publication:4227316
Recommendations
Cited in
(23)- On a polytime factorization algorithm for multilinear polynomials over \(\mathbb{F}_2\)
- Fast transforms over finite fields of characteristic two
- Computing Frobenius maps and factoring polynomials
- Interval partitions and polynomial factorization
- A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over F₂
- Polynomial factorization over ${\mathbb F}_2$
- Improving the Berlekamp algorithm for binomials \(x^{n}-a\)
- scientific article; zbMATH DE number 6500356 (Why is no real title available?)
- Polynomial factorisation using Drinfeld modules
- A New Algorithm for Decoding Reed-Solomon Codes
- scientific article; zbMATH DE number 3939455 (Why is no real title available?)
- Complexity of computation in finite fields
- scientific article; zbMATH DE number 1254268 (Why is no real title available?)
- Factoring high-degree polynomials over $\mathbf F_2$ with Niederreiter's algorithm on the IBM SP2
- scientific article; zbMATH DE number 1273637 (Why is no real title available?)
- scientific article; zbMATH DE number 1519867 (Why is no real title available?)
- scientific article; zbMATH DE number 6981627 (Why is no real title available?)
- Quantum-assisted QD-CFS signatures
- Computing special powers in finite fields
- scientific article; zbMATH DE number 1420754 (Why is no real title available?)
- Multiplication
- Faster Multiplication in GF(2)[x]
- Euclidean polynomials for certain arithmetic progressions and the multiplicative group of 𝔽p2
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 Q4227316)
