Daniel Panario, Boris Pittel, Bruce Richmond, Alfredo Viola  Home/Search
Context Related
| fing.edu.uy/inco/pedeciba/...TR0116.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: fing.edu.uy/inco/pedec...reportes (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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 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 = Pl and n = PiP2 ... (Update)
Similar documents based on text: More All
0.6: Tests and Constructions of Irreducible Polynomials over Finite.. - Gao, Panario (1997) (Correct)
0.3: Deterministic Irreducibility Testing of Polynomials over Large.. - Kaltofen (1987) (Correct)
0.3: The Complete Analysis of a Polynomial Factorization.. - Flajolet, Gourdon.. (1998) (Correct)
BibTeX entry: (Update)
Panario, D., Pittel, B., Richmond, B., and Viola, A. Analysis of Rabin's irreducibility test for polynomials over finite fields. Preprint, 2000. http://citeseer.ist.psu.edu/panario00analysis.html More
@misc{ panario00analysis,
author = "D. Panario and B. Pittel and B. Richmond and A. Viola",
title = "Analysis of Rabin's irreducibility test for polynomials over finite fields",
text = "Panario, D., Pittel, B., Richmond, B., and Viola, A. Analysis of Rabin's
irreducibility test for polynomials over finite fields. Preprint, 2000.",
year = "2000",
url = "citeseer.ist.psu.edu/panario00analysis.html" }
Citations (may not include all citations):1450 The Design and Analysis of Computer Algorithms (context) - AHO, HOPCROfT et al. - 1974
439 An Introduction to the Theory of Numbers (context) - HARDY, WRIGHT - 1962
78 seminumerical algo- rithms (context) - KNUTH, of et al. - 1997
52 On fast multiplication of polynomials over arbitrary algebra.. - CANTOR, KALTOFEN - 1991
47 An implementation of el- liptic curve cryptosystem over F (context) - AGNEW, MULLIN et al. - 1993
40 Probabilistic algorithms in finite fields - RABIN - 1980
35 The discrete logarithm problem (context) - MCCURLEY - 1990
35 Mathematics for Computer Algebra (context) - MIGNOTTE - 1992
28 Fast evaluation of logarithms in fields of characteristic tw.. (context) - COPPERSMITH - 1984
27 Computing Frobenius maps and factor- ing polynomials - ZUR, SHOUP - 1992
11 Discrete logarithms and their cryptographic significance (context) - ODLYZKO - 1985
9 The complete analysis of a polynomial factorization algorith.. - FLAJOLET, GOURDON et al. - 1996
6 Counting irreducible factors of polynomials over a finite fi.. (context) - KNOPFMACHER, KNOPFMACHER - 1993
5 Analysis of Ben-Or's polynomial irreducibil- ity test (context) - PANARIO, RICHMOND - 1998
3 Probabilistic algorithms in finite fields (context) - BEN-OR - 1981
[Article contains additional citations not shown here]
Documents on the same site (http://www.fing.edu.uy/inco/pedeciba/bibliote/reportes.htm): More
Secure Object Sharing Development Kit for Java Card - Perovich (Correct)
Comparing assignment algorithms for the Multi-Depot VRP - Tansini, Urquhart, Viera (Correct)
A GRASP algorithm for designing a Wide Area Network backbone - Cancela, Robledo, Rubino (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC