Compute x^(2^field_size) mod poly.
(poly, gf)
| 251 | return out |
| 252 | |
| 253 | def poly_frobeniusmod(poly, gf): |
| 254 | """Compute x^(2^field_size) mod poly.""" |
| 255 | out = [0, 1] |
| 256 | for _ in range(gf.field_size): |
| 257 | _, out = poly_divmod(poly_sqr(out, gf), poly, gf) |
| 258 | return out |
| 259 | |
| 260 | def poly_find_roots(poly, gf): |
| 261 | """Find the roots of poly if fully factorizable with unique roots, [] otherwise.""" |
no test coverage detected