Analysis of Rabin's irreducibility test for polynomials over finite fields

We give a precise average-case analysis of Rabin's algorithm for testing the irreducibility of polynomials over finite fields. The main technical contribution of the paper is the study of the probability that a random polynomial of degree n contains an irreducible factor of degree dividing several m...

Full description

Bibliographic Details

Main Author:	Panario, Daniel (author)
Other Authors:	Pittel, Boris (author), Richmond, Bruce (author), Viola, Alfredo (author)
Format:	report
Published:	2001
Subjects:	RANDOM POLYNOMIALS FINITE FIELDS ALGORITHMS
Online Access:	http://hdl.handle.net/20.500.12008/3455
Tags:	Add Tag No Tags, Be the first to tag this record!