Revision as of 14:38, 13 July 2020 edit Rcgldr (talk \| contribs) Extended confirmed users 2,505 edits →Trying to understand how any of these methods would work for f(x) with coefficients in GF(p^r) ← Previous edit		Revision as of 15:41, 13 July 2020 edit undo D.Lazard (talk \| contribs) Extended confirmed users 35,640 edits →Trying to understand how any of these methods would work for f(x) with coefficients in GF(p^r): rp Next edit →
Line 76: For the first algorithm shown, the issue is that f '(x) = 1. For the others it would seem that math would involve multiply or xor of the values 0 and 1, and I don't see how non-zero values other than 1 are produced. [[User:Rcgldr\|Rcgldr]] ([[User talk:Rcgldr\|talk]]) 14:38, 13 July 2020 (UTC) :As your polynomial is square free and all its factors are quadratic, the first algorithms to be considered are Berlekamp and Cantor–Zassenhaus algorithms. Berlekamp algorithm has a loop on all elements of the ground field (here GF(2^16)), and Cantor–Zassenhaus algorithm chooses at random polynomials with coefficients in GF(2^16). This is this way that polynomial coefficients that are not in GF(2) are introduced. [[User:D.Lazard\|D.Lazard]] ([[User talk:D.Lazard\|talk]]) 15:41, 13 July 2020 (UTC)

Talk:Factorization of polynomials over finite fields: Difference between revisions