Algorithms for Factoring Polynomials over Finite Fields

Tanja Lange () and Arne Winterhof ()
Additional contact information
Tanja Lange: TU Braunschweig, Institut für Geometrie
Arne Winterhof: Österreichische Akademie der Wissenschaften, Institut für Diskrete Mathematik

A chapter in Finite Fields and Applications, 2001, pp 319-328 from Springer

Abstract: 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.

Keywords: Finite Field; Deterministic Algorithm; Monic Polynomial; Irreducible Factor; Extended Algorithm (search for similar items in EconPapers)
Date: 2001
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-56755-1_25

Ordering information: This item can be ordered from
http://www.springer.com/9783642567551

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

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().