Factoring polynomials of the form \(f(x^n) \in \mathbb{F}_q [x]\) (Q1679708): Difference between revisions

@@ Property / cites work @@
+Efficient computation of roots in finite fields
@@ Property / cites work: Efficient computation of roots in finite fields / rank @@
+Normal rank
@@ Property / cites work @@
+Q2762882
@@ Property / cites work: Q2762882 / rank @@
+Normal rank
@@ Property / cites work @@
+Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\)
+Normal rank
@@ Property / cites work @@
+Explicit factorization of \(x^n-1\in \mathbb {F}_q[x]\)
+Normal rank
@@ Property / cites work @@
+On fast multiplication of polynomials over arbitrary algebras
+Normal rank
@@ Property / cites work @@
+Explicit factorization of \(X^{2^m}p^n-1\) over a finite field
+Normal rank
@@ Property / cites work @@
+Explicit Factorizations of Cyclotomic and Dickson Polynomials over Finite Fields
+Normal rank
@@ Property / cites work @@
+Computing Frobenius maps and factoring polynomials
+Normal rank
@@ Property / cites work @@
+Subquadratic-time factoring of polynomials over finite fields
+Normal rank
@@ Property / cites work @@
+On the Chor-Rivest knapsack cryptosystem
@@ Property / cites work: On the Chor-Rivest knapsack cryptosystem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3765876
@@ Property / cites work: Q3765876 / rank @@
+Normal rank
@@ Property / cites work @@
+Factorization of the cyclotomic polynomial \(x^{2^n}+1\) over finite fields
+Normal rank
@@ Property / cites work @@
+Fast construction of irreducible polynomials over finite fields
+Normal rank
@@ Property / cites work @@
+Composed products and factors of cyclotomic polynomials over finite fields
+Normal rank