Article

Free access

A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic

Author:

Victor ShoupAuthors Info & Claims

ISSAC '91: Proceedings of the 1991 international symposium on Symbolic and algebraic computation

Pages 14 - 21

https://doi.org/10.1145/120694.120697

Published: 01 June 1991 Publication History

PDF eReader

References

[1]

W. Baur and V. Strassen. The complexity of computing partial derivatives. Theoretical Computer Science, 22:317-330, 1983.

Crossref

Google Scholar

[2]

M. Ben-Or. Probabilistic Mgorithms in finite fields. In 22nd Annual Symposium on Foundations of Computer Science, pages 394-398, 1981.

Digital Library

Google Scholar

[3]

E. R. Berlekamp. Factoring polynomi- Ms over large finite fields. Math. Comp., 24( 111):713-735, 1970.

Google Scholar

[4]

A. Borodin and I. Munro. The Computational Complexity of Algebraic and Numeric Problems. American Elsevier, 1975.

Google Scholar

[5]

D. A. Burgess. A note on the distribution of residues and non-residues. Jour. London Math. Soc., 38:253-256, 1963.

Crossref

Google Scholar

[6]

P. Camion. Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials. IEEE Trans. Inform. Theory, IT-29(3):378- 385, 1983.

Crossref

Google Scholar

[7]

J. F. Canny~ E. Kaltofen~ and L. Yagati. Solving systems of non-linear polynomial equations faster. In Proc. A CM-SIGSAM Int. Syrup. on Symbolic and Algebraic Computation, pages 121-128, 1989.

Digital Library

Google Scholar

[8]

D. G. Cantor and E. Kaltofen. Fast multiplication of polynomials over arbitrary rings. Technical Report 87-35, Department of Computer Science, Rensselaer Polytechnic Institute, 1987. To appear, Acta. inf.

Google Scholar

[9]

D. G. Cantor and H. Zassenhaus. A new algorithm for factoring polynomials over finite fields. Math. Comp., 36(154):587-592, 1981.

Crossref

Google Scholar

[10]

D. Coppersmith and S. Winograd. Matrix multiplication via Behrend's method. In 19th Annual A CM Symposium on Theory of Computing, pages 1-6, 1987.

Digital Library

Google Scholar

[11]

M. Kaminski, D. G. Kirkpatrick, and N. H. Bshouty. Addition requirements for matrix and transposed matrix products. Journal of Algorithms, 9:354-364, 1988.

Digital Library

Google Scholar

[12]

R. T. Moenck. On the efficiency of algorithms for polynomial factoring. Math. Comp., 31(137):235-250, 1977.

Crossref

Google Scholar

[13]

V. Shoup. On the deterministic complexity of factoring polynomials over finite fields. Inform. Process. Lett., 33(5):261-267, 1990.

Digital Library

Google Scholar

[14]

I. E. Shparlinsky. On some questions in the theory of finite fields. Preprint, 1990.

Google Scholar

[15]

J. von zur Gathen. Factoring polynomials and primitive elements for special primes. Theoret. Comput. Sci., 52:77-89, 1987.

Digital Library

Google Scholar

Cited By

View all

Villard G(2024)Bivariate polynomial reduction and elimination ideal over finite fieldsJournal of Symbolic Computation10.1016/j.jsc.2024.102367(102367)Online publication date: Jul-2024
https://doi.org/10.1016/j.jsc.2024.102367
Villard G(2023)Elimination ideal and bivariate resultant over finite fieldsProceedings of the 2023 International Symposium on Symbolic and Algebraic Computation10.1145/3597066.3597100(526-534)Online publication date: 24-Jul-2023
https://dl.acm.org/doi/10.1145/3597066.3597100
Beelen PRosenkilde JSolomatov G(2022)Fast Decoding of AG CodesIEEE Transactions on Information Theory10.1109/TIT.2022.318884368:11(7215-7232)Online publication date: Nov-2022
https://doi.org/10.1109/TIT.2022.3188843
Show More Cited By

Index Terms

A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic
1. Computing methodologies
  1. Symbolic and algebraic manipulation
    1. Symbolic and algebraic algorithms
      1. Algebraic algorithms
2. Mathematics of computing
  1. Mathematical analysis
    1. Numerical analysis
      1. Computations in finite fields
      2. Computations on polynomials

Recommendations

Factoring bivariate lacunary polynomials without heights
ISSAC '13: Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation

We present an algorithm which computes the multilinear factors of bivariate lacunary polynomials. It is based on a new Gap theorem which allows to test whether P(X)=∑^k_j=1 α_jX^αj(1+X)^βjis identically zero in polynomial time. The algorithm we obtain is ...
Factoring polynomials over finite fields
SFCS '87: Proceedings of the 28th Annual Symposium on Foundations of Computer Science

We propose a new deterministic method of factoring polynomials over finite fields. Assuming the Generalized Riemann Hypothesis (GRH), we obtain, in polynomial time, the factorization of any polynomial with a bounded number of irreducible factors. Other ...
Factoring Polynomials over Special Finite Fields

We exhibit a deterministic algorithm for factoring polynomials in one variable over finite fields. It is efficient only if a positive integer k is known for which k(p) is built up from small prime factors; here k denotes the kth cyclotomic polynomial, ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ISSAC '91: Proceedings of the 1991 international symposium on Symbolic and algebraic computation

June 1991

468 pages

ISBN:0897914376

DOI:10.1145/120694

Editor:
Stephen M. Watt

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1991

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

ISSAC 91

Sponsor:

German Comp Soc
GMD
SIGSAM

ISSAC 91: International Symposium on Symbolic Algebraic Computation

July 15 - 17, 1991

Bonn, West Germany

Acceptance Rates

Overall Acceptance Rate 395 of 838 submissions, 47%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

26
Total Citations
View Citations
478
Total Downloads

Downloads (Last 12 months)67
Downloads (Last 6 weeks)7

Reflects downloads up to 18 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Villard G(2024)Bivariate polynomial reduction and elimination ideal over finite fieldsJournal of Symbolic Computation10.1016/j.jsc.2024.102367(102367)Online publication date: Jul-2024
https://doi.org/10.1016/j.jsc.2024.102367
Villard G(2023)Elimination ideal and bivariate resultant over finite fieldsProceedings of the 2023 International Symposium on Symbolic and Algebraic Computation10.1145/3597066.3597100(526-534)Online publication date: 24-Jul-2023
https://dl.acm.org/doi/10.1145/3597066.3597100
Beelen PRosenkilde JSolomatov G(2022)Fast Decoding of AG CodesIEEE Transactions on Information Theory10.1109/TIT.2022.318884368:11(7215-7232)Online publication date: Nov-2022
https://doi.org/10.1109/TIT.2022.3188843
Bhargava VSaraf SVolkovich I(2020)Deterministic Factorization of Sparse Polynomials with Bounded Individual DegreeJournal of the ACM10.1145/336566767:2(1-28)Online publication date: 4-May-2020
https://dl.acm.org/doi/10.1145/3365667
Kim MLee HLing SWang H(2018)On the Efficiency of FHE-Based Private QueriesIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2016.256818215:2(357-363)Online publication date: 1-Mar-2018
https://dl.acm.org/doi/10.1109/TDSC.2016.2568182
Neiger VRosenkilde JSchost ÉYap CEl Din M(2017)Fast Computation of the Roots of Polynomials Over the Ring of Power SeriesProceedings of the 2017 ACM International Symposium on Symbolic and Algebraic Computation10.1145/3087604.3087642(349-356)Online publication date: 23-Jul-2017
https://dl.acm.org/doi/10.1145/3087604.3087642
Grenet BHoeven JLecerf G(2016)Deterministic root finding over finite fields using Graeffe transformsApplicable Algebra in Engineering, Communication and Computing10.1007/s00200-015-0280-527:3(237-257)Online publication date: 1-Jun-2016
https://dl.acm.org/doi/10.1007/s00200-015-0280-5
De Feo LPetit CQuisquater M(2015)Deterministic root finding in finite fieldsACM Communications in Computer Algebra10.1145/2850449.285045749:3(87-89)Online publication date: 24-Nov-2015
https://dl.acm.org/doi/10.1145/2850449.2850457
Grenet Bvan der Hoeven JLecerf GRobertz DLinton SYokoyama K(2015)Randomized Root Finding over Finite FFT-fields using Tangent Graeffe TransformsProceedings of the 2015 ACM International Symposium on Symbolic and Algebraic Computation10.1145/2755996.2756647(197-204)Online publication date: 24-Jun-2015
https://dl.acm.org/doi/10.1145/2755996.2756647
Chowdhury MJeannerod CNeiger VSchost EVillard G(2015)Faster Algorithms for Multivariate Interpolation With Multiplicities and Simultaneous Polynomial ApproximationsIEEE Transactions on Information Theory10.1109/TIT.2015.241606861:5(2370-2387)Online publication date: May-2015
https://doi.org/10.1109/TIT.2015.2416068
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Factoring bivariate lacunary polynomials without heights

Factoring polynomials over finite fields

Factoring Polynomials over Special Finite Fields