Abstract
AbstractWe 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 article is the study of the probability that a random polynomial of degree n contains an irreducible factor of degree dividing several maximal divisors of the degree n. We then study the expected value and the variance of the number of operations performed by the algorithm. We present an exact analysis when n=p1 and n=p1p2 for p1, p2 prime numbers, and an asymptotic analysis for the general case. Our method generalizes to other algorithms that deal with similar divisor conditions. In particular, we analyze the average‐case number of operations for two variants of Rabin's algorithm, and determine the ordering of prime divisors of n that minimizes the leading factor. © 2001 John Wiley & Sons, Inc. Random Struct. Alg., 19: 525–551, 2001
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
