The following pages link to (Q4226960):
Displaying 21 items.
- Genus 2 point counting over prime fields (Q412199) (← links)
- Modular composition via factorization (Q722764) (← links)
- Fast rectangular matrix multiplication and some applications (Q931517) (← links)
- On fast multiplication of polynomials over arbitrary algebras (Q1186518) (← links)
- Threshold data structures and coding theory (Q1978695) (← links)
- Computing in degree \(2^k\)-extensions of finite fields of odd characteristic (Q2260788) (← links)
- Fast multivariate multi-point evaluation revisited (Q2283121) (← links)
- A new efficient factorization algorithm for polynomials over small finite fields (Q2366271) (← links)
- Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic (Q2430987) (← links)
- Improving the algorithms of Berlekamp and Niederreiter for factoring polynomials over finite fields (Q2457415) (← links)
- On the Cipolla-Lehmer type algorithms in finite fields (Q2631927) (← links)
- On the complexity exponent of polynomial system solving (Q2658549) (← links)
- Taking roots over high extensions of finite fields (Q2862538) (← links)
- (Q3641494) (← links)
- (Q4237366) (← links)
- Subquadratic-time factoring of polynomials over finite fields (Q4396457) (← links)
- Fast Decomposition of Polynomials with Known Galois Group (Q4426704) (← links)
- Computing isomorphisms and embeddings of finite fields (Q4612574) (← links)
- Univariate polynomial factorization over finite fields with large extension degree (Q6122401) (← links)
- On the computation of \(r\)-th roots in finite fields (Q6615544) (← links)
- On the weakness of ring-LWE mod prime ideal \(\mathfrak{q}\) by trace map (Q6619835) (← links)
