In this paper, we survey old and new results about random univariate polynomials over a finite field double-struck F signq. We are interested in three aspects: (1) the decomposition of a random polynomial in terms of its irreducible factors, (2) the usage of random polynomials in algorithms, and (3) the average-case analysis of algorithms that use polynomials over finite fields. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
Panario, D. (2004). What do random polynomials over finite fields look like? Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2948, 89–108. https://doi.org/10.1007/978-3-540-24633-6_8
Mendeley helps you to discover research relevant for your work.