arXiv · 1012.5322
Improvements on Cantor-Zassenhaus Factorization Algorithm
Abstract
After revisiting Cantor-Zassenhaus polynomial factorization algorithm, we describe a new simplified version of it, which requires less computational cost. Moreover we show that it is able to find a factor of a fully splitting polynomial of degree $t$ over $\mathbb F_{2^m}$ with $O(\frac{2^m}{3^{t}})$ attempts and over $\mathbb F_{p^m}$ for odd $p$ with $O(\frac{p^m}{2^{t}})$ attempts.
Explore related subjects
Keep this discovery
Michele Elia, Davide Schipani. 2011-05-27. Improvements on Cantor-Zassenhaus Factorization Algorithm. https://arxiv.org/abs/1012.5322
Cite the original work for its findings. Save a collection to share your selection of sources.