Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Cantor–Zassenhaus algorithm
open-in-new
<p>In <a href="/facts/Computational_mathematics/JRoX1lu0">computational</a> <a href="/facts/Abstract_algebra/YNNE1CNz">algebra</a>, the Cantor–Zassenhaus algorithm is a method for factoring <a href="/facts/Polynomial/Lzak8VVx">polynomials</a> over <a href="/facts/Finite_field/UkMGJo3m">finite fields</a> (also called Galois fields). </p><p>The algorithm consists mainly of exponentiation and polynomial <a href="/facts/Greatest_common_divisor/kNFvBuKl">GCD</a> computations. It was invented by <a href="/facts/David_G._Cantor/dHuuzATR">David G. Cantor</a> and <a href="/facts/Hans_Zassenhaus/jbyAhTMg">Hans Zassenhaus</a> in 1981. </p><p>It is arguably the dominant algorithm for solving the problem, having replaced the earlier <a href="/facts/Berlekamp%2527s_algorithm/qBfq6P78">Berlekamp's algorithm</a> of 1967. It is currently implemented in many <a href="/facts/Computer_algebra_system/jkLAC1U3">computer algebra systems</a> like <a href="/facts/PARI%2fGP/JhTL8ysP">PARI/GP</a>. </p>