Algorithms for Factoring Polynomials over Finite Fields

Tanja Lange,Arne Winterhof

doi:10.1007/978-3-642-56755-1_25

Algorithms for Factoring Polynomials over Finite Fields

Tanja Lange, Arne Winterhof

https://doi.org/10.1007/978-3-642-56755-1_25

Copy DOI

Publication Date: Jan 1, 2001

Citations: 7

Affiliation: Technische Universität Braunschweig, Austrian Academy of Sciences

#Finite Fields #Finite Prime Fields + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

Results on the worst case behavior of the authors’ extension ((2000)) of Shoup’s algorithm for factoring polynomials over finite prime fields ((1990)) are improved. Moreover, the consequences of the average case behavior of the extended algorithm for multivariate algorithms are described, and an extension of Lenstra’s algorithm ((1990)) for root finding over finite prime fields is presented.

Full Text