skip to main content
10.1145/1374376.1374445acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
research-article

Fast polynomial factorization and modular composition in small characteristic

Published: 17 May 2008 Publication History

Abstract

We obtain randomized algorithms for factoring degree n univariate polynomials over F_q that use O(n1.5 + o(1) + n1 + o(1)log q) field operations, when the characteristic is at most no(1). When log q < n, this is asymptotically faster than the best previous algorithms (von zur Gathen & Shoup (1992) and Kaltofen & Shoup (1998)); for log q ≥ n, it matches the asymptotic running time of the best known algorithms.
The improvements come from a new algorithm for modular composition of degree n univariate polynomials, which is the asymptotic bottleneck in fast algorithms for factoring polynomials over finite fields. The best previous algorithms for modular composition use O(n(omega + 1)/2) field operations, where omega is the exponent of matrix multiplication (Brent & Kung (1978)), with a slight improvement in the exponent achieved by employing fast rectangular matrix multiplication (Huang & Pan (1997)).
We show that modular composition and multipoint evaluation of multivariate polynomials are essentially equivalent in the sense that an algorithm for one achieving exponent α implies an algorithm for the other with exponent α + o(1), and vice versa. We then give a new algorithm that requires O(n1 + o(1)) field operations when the characteristic is at most no(1), which is optimal up to lower order terms.
Our algorithms do not rely on fast matrix multiplication, in contrast to all previous subquadratic algorithms for these problems. The main operations are fast univariate polynomial arithmetic, multipoint evaluation, and interpolation, and consequently the algorithms could be feasible in practice.

References

[1]
B. S. A. Bostan, P. Flajolet and E. Schost. Fast computation of special resultants. Journal of Symbolic Computation, 41(1):1--29, 2006.
[2]
E. R. Berlekamp. Factoring polynomials over large finite fields. Mathematics of Computation, 24(111):713, 1970.
[3]
D. J. Bernstein. Composing power series over a finite ring in essentially linear time. J. Symb. Comput., 26(3):339--341, 1998.
[4]
R. P. Brent and H. T. Kung. Fast algorithms for manipulating formal power series. J. ACM, 25(4):581--595, 1978.
[5]
D. Cantor and H. Zassenhaus. A new algorithm for factoring polynomials over finite fields. Mathematics of Computation, 36(154):587, 1981.
[6]
D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. J. Symb. Comput., 9(3):251--280, 1990.
[7]
V. Guruswami and A. Rudra. Explicit capacity-achieving list-decodable codes. In J. M. Kleinberg, editor, STOC, pages 1--10. ACM, 2006.
[8]
X. Huang and V. Y. Pan. Fast rectangular matrix multiplication and applications. J. Complexity, 14(2):257--299, 1998.
[9]
E. Kaltofen. Polynomial factorization: a success story. In J. R. Sendra, editor, ISSAC, pages 3--4. ACM, 2003.
[10]
E. Kaltofen and V. Shoup. Fast polynomial factorization over high algebraic extensions of finite fields. In ISSAC, pages 184--188, 1997.
[11]
E. Kaltofen and V. Shoup. Subquadratic-time factoring of polynomials over finite fields. Mathematics of Computation, 67(223):1179--1197, 1998.
[12]
M. Nüsken and M. Ziegler. Fast multipoint evaluation of bivariate polynomials. In S. Albers and T. Radzik, editors, ESA, volume 3221 of Lecture Notes in Computer Science, pages 544--555. Springer, 2004.
[13]
F. Parvaresh and A. Vardy. Correcting errors beyond the Guruswami-Sudan radius in polynomial time. In FOCS, pages 285--294. IEEE Computer Society, 2005.
[14]
M. O. Rabin. Probabilistic algorithms in finite fields. SIAM J. Comput., 9(2):273--280, 1980.
[15]
V. Shoup. Fast construction of irreducible polynomials over finite fields. J. Symb. Comput., 17(5):371--391, 1994.
[16]
V. Shoup. Efficient computation of minimal polynomials in algebraic extensions of finite fields. In ISSAC, pages 53--58, 1999.
[17]
J. von zur Gathen. Who was who in polynomial factorization. In B. M. Trager, editor, ISSAC, page 2. ACM, 2006.
[18]
J. von zur Gathen and J. Gerhard. Modern Computer Algebra. Cambridge University Press, 1999.
[19]
J. von zur Gathen and D. Panario. Factoring polynomials over finite fields: A survey. J. Symb. Comput., 31(1/2):3--17, 2001.
[20]
J. von zur Gathen and V. Shoup. Computing Frobenius maps and factoring polynomials. Computational Complexity, 2:187--224, 1992.

Cited By

View all

Index Terms

  1. Fast polynomial factorization and modular composition in small characteristic

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      STOC '08: Proceedings of the fortieth annual ACM symposium on Theory of computing
      May 2008
      712 pages
      ISBN:9781605580470
      DOI:10.1145/1374376
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 17 May 2008

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. modular composition
      2. multipoint evaluation
      3. polynomial factorization

      Qualifiers

      • Research-article

      Conference

      STOC '08
      Sponsor:
      STOC '08: Symposium on Theory of Computing
      May 17 - 20, 2008
      British Columbia, Victoria, Canada

      Acceptance Rates

      STOC '08 Paper Acceptance Rate 80 of 325 submissions, 25%;
      Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

      Upcoming Conference

      STOC '25
      57th Annual ACM Symposium on Theory of Computing (STOC 2025)
      June 23 - 27, 2025
      Prague , Czech Republic

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)14
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 18 Feb 2025

      Other Metrics

      Citations

      Cited By

      View all
      • (2024)Fast Multivariate Multipoint Evaluation over All Finite FieldsJournal of the ACM10.1145/365202571:3(1-32)Online publication date: 11-Jun-2024
      • (2024)Faster Modular CompositionJournal of the ACM10.1145/363834971:2(1-79)Online publication date: 10-Apr-2024
      • (2024)Sparse Tensors and Subdivision Methods for Finding the Zero Set of Polynomial EquationsComputer Algebra in Scientific Computing10.1007/978-3-031-69070-9_14(236-251)Online publication date: 21-Aug-2024
      • (2023)Fast, Algebraic Multivariate Multipoint Evaluation in Small Characteristic and ApplicationsJournal of the ACM10.1145/362522670:6(1-46)Online publication date: 22-Sep-2023
      • (2023)Fast Numerical Multivariate Multipoint Evaluation2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS57990.2023.00088(1426-1439)Online publication date: 6-Nov-2023
      • (2022)Fast, algebraic multivariate multipoint evaluation in small characteristic and applicationsProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3519935.3519968(403-415)Online publication date: 9-Jun-2022
      • (2022)Fast Multivariate Multipoint Evaluation Over All Finite Fields2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS54457.2022.00028(221-232)Online publication date: Oct-2022
      • (2022)Reduced order and surrogate models for gravitational wavesLiving Reviews in Relativity10.1007/s41114-022-00035-w25:1Online publication date: 26-Apr-2022
      • (2015)Probabilistic Polynomials and Hamming Nearest NeighborsProceedings of the 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS.2015.18(136-150)Online publication date: 17-Oct-2015
      • (2014)A New Additive Homomorphic Encryption based on the co-ACD ProblemProceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security10.1145/2660267.2660335(287-298)Online publication date: 3-Nov-2014
      • Show More Cited By

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Figures

      Tables

      Media

      Share

      Share

      Share this Publication link

      Share on social media