Pages that link to "Item:Q5119925"
From MaRDI portal
The following pages link to Fast Multiplication for Skew Polynomials (Q5119925):
Displaying 13 items.
- A new faster algorithm for factoring skew polynomials over finite fields (Q507150) (← links)
- Faster polynomial multiplication via multipoint Kronecker substitution (Q840717) (← links)
- FFT-like multiplication of linear differential operators (Q1599537) (← links)
- Fast operations on linearized polynomials and their applications in coding theory (Q1635282) (← links)
- Counting invariant subspaces and decompositions of additive polynomials (Q1994893) (← links)
- LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding (Q2034992) (← links)
- Non-commutative ring learning with errors from cyclic algebras (Q2154559) (← links)
- Sparse multiplication for skew polynomials (Q5145973) (← links)
- Fast convolutions meet Montgomery (Q5444325) (← links)
- Skew-polynomial-sparse matrix multiplication (Q6051113) (← links)
- Computing a group action from the class field theory of imaginary hyperelliptic function fields (Q6543075) (← links)
- Middle-products of skew polynomials and learning with errors (Q6595945) (← links)
- Sparse multiplication of multivariate linear differential operators (Q6666531) (← links)