Article

Free access

Finding irreducible polynomials over finite fields

Authors:

L M Adleman,

H W LenstraAuthors Info & Claims

STOC '86: Proceedings of the eighteenth annual ACM symposium on Theory of computing

Pages 350 - 355

https://doi.org/10.1145/12130.12166

Published: 01 November 1986 Publication History

PDF eReader

References

[1]

E. Bach and J. Shallit, ~Factoring with Cyclotomic Polynomials, ~ Proceedings 26th FOCS, 1985, pp. 443-450.

Google Scholar

[2]

E.R. Berlekamp, "Algebraic Coding Theory, ~ McGraw-Hill Publishing Company, New York, 1968.

Google Scholar

[3]

B. Chor and R. Rivest, ~A Knapsack Type Public Key Cryptosystem Based on Arithmetic in Finite Fields, ~ Advances in Cryptography (Ed., G. Goos and J. Hartmanis), Springer- Verlag, New York, pp. 54-65.

Digital Library

Google Scholar

[4]

J. Von zur Gathen, ~Irreducible Polynomials Over Finite Fields," Manuscript, 1985.

Google Scholar

[5]

E.E. Kummer, Uber die Divisoren gewisser Formen der Zahlen, welche aus der Theorie der Kreistheilung entstehen, J. reine angew. Math. 30 (1846), 107-116; pp. 193-202 in Collected papers, Springer-Verlag, Berlin, 1975.

Google Scholar

[6]

L. Mirsky, "The Number of Representations of an Integer as the Sum of a Prime and a k-free Integer, ~ Amer. Math. Monthly 56 (1949), 17-19.

Crossref

Google Scholar

[7]

P.J. McCarthy, ~Algebraic Extensions of Fields, ~ Blaisdell Publishing Company, Waltham, Mass., 1966

Google Scholar

[8]

M.O. Rabin, "Probabilistie Algorithms in Finite Fields," SIAM J. Comput., Vol. 9, (1980), pp. 273-280.

Crossref

Google Scholar

[9]

L. Washington, "Cyclotomic Fields," Springer- Verlag, New York 1980.

Google Scholar

[10]

J.H. Wilkinson, "The Algebraic Eigenvalue Problem," Oxford Clarendon Press, 1965, pp. 353-355 and 410.

Digital Library

Google Scholar

Cited By

View all

Aryanfard BPanolan F(2022)Parameterized Complexity of List Coloring and Max ColoringComputer Science – Theory and Applications10.1007/978-3-031-09574-0_4(46-63)Online publication date: 24-Jun-2022
https://doi.org/10.1007/978-3-031-09574-0_4
Gulati AChakrabarti SMittal R(2021)On Algorithms to Find p-orderingAlgorithms and Discrete Applied Mathematics10.1007/978-3-030-67899-9_27(333-345)Online publication date: 28-Jan-2021
https://doi.org/10.1007/978-3-030-67899-9_27
Guo ZSaxena NSinhababu AServedio R(2018)Algebraic dependencies and PSPACE algorithms in approximative complexityProceedings of the 33rd Computational Complexity Conference10.5555/3235586.3235596(1-21)Online publication date: 22-Jun-2018
https://dl.acm.org/doi/10.5555/3235586.3235596
Show More Cited By

Recommendations

Irreducible polynomials over finite fields with prescribed trace/prescribed constant term

We obtain an equivalent version of Carlitz's formula for the number of monic irreducible polynomials of degree n and trace @c<>0 over a finite field via an integer recurrence. Similar expressions for the @c=0 case are also given. We also obtain formulas ...
Self-Reciprocal Irreducible Polynomials Over Finite Fields

We classify monic self-reciprocal irreducible polynomials over finite fields in terms of their orders. We also study the weights of these polynomials.
Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields
ISSAC '06: Proceedings of the 2006 international symposium on Symbolic and algebraic computation

We present algorithms that compute all irreducible factors of degree ≤ d of supersparse (lacunary) multivariate polynomials in n variables over an algebraic number field in deterministic polynomial-time in (l+d)ⁿ, where l is the size of the input ...

Comments

Information & Contributors

Information

Published In

STOC '86: Proceedings of the eighteenth annual ACM symposium on Theory of computing

November 1986

461 pages

ISBN:0897911938

DOI:10.1145/12130

Chairman:
Juris Hartmanis

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 November 1986

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC86

Sponsor:

SIGACT

STOC86: Eighteenth Annaul ACM Symposium on Theory of Computing

May 28 - 30, 1986

California, Berkeley, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

52
Total Citations
View Citations
1,672
Total Downloads

Downloads (Last 12 months)154
Downloads (Last 6 weeks)19

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Aryanfard BPanolan F(2022)Parameterized Complexity of List Coloring and Max ColoringComputer Science – Theory and Applications10.1007/978-3-031-09574-0_4(46-63)Online publication date: 24-Jun-2022
https://doi.org/10.1007/978-3-031-09574-0_4
Gulati AChakrabarti SMittal R(2021)On Algorithms to Find p-orderingAlgorithms and Discrete Applied Mathematics10.1007/978-3-030-67899-9_27(333-345)Online publication date: 28-Jan-2021
https://doi.org/10.1007/978-3-030-67899-9_27
Guo ZSaxena NSinhababu AServedio R(2018)Algebraic dependencies and PSPACE algorithms in approximative complexityProceedings of the 33rd Computational Complexity Conference10.5555/3235586.3235596(1-21)Online publication date: 22-Jun-2018
https://dl.acm.org/doi/10.5555/3235586.3235596
Lin B(2018)The Parameterized Complexity of the k-Biclique ProblemJournal of the ACM10.1145/321262265:5(1-23)Online publication date: 29-Aug-2018
https://dl.acm.org/doi/10.1145/3212622
Lokshtanov DMisra PPanolan FSaurabh S(2018)Deterministic Truncation of Linear MatroidsACM Transactions on Algorithms10.1145/317044414:2(1-20)Online publication date: 12-Mar-2018
https://dl.acm.org/doi/10.1145/3170444
Shparlinski I(2018)On Constructing Primitive Roots in Finite Fields With AdviceIEEE Transactions on Information Theory10.1109/TIT.2018.281093864:11(7132-7136)Online publication date: Nov-2018
https://doi.org/10.1109/TIT.2018.2810938
Bhargava VIvanyos GMittal RSaxena NYap CEl Din M(2017)Irreducibility and Deterministic r-th Root Finding over Finite FieldsProceedings of the 2017 ACM International Symposium on Symbolic and Algebraic Computation10.1145/3087604.3087620(37-44)Online publication date: 23-Jul-2017
https://dl.acm.org/doi/10.1145/3087604.3087620
Harvey DHoeven JLecerf G(2017)Faster Polynomial Multiplication over Finite FieldsJournal of the ACM10.1145/300534463:6(1-23)Online publication date: 20-Jan-2017
https://dl.acm.org/doi/10.1145/3005344
Gurjar RKorwar ASaxena NThierauf T(2017)Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching ProgramsComputational Complexity10.1007/s00037-016-0141-z26:4(835-880)Online publication date: 1-Dec-2017
https://dl.acm.org/doi/10.1007/s00037-016-0141-z
Gurjar RKorwar ASaxena NThierauf TZuckerman D(2015)Deterministic identity testing for sum of read-once oblivious arithmetic branching programsProceedings of the 30th Conference on Computational Complexity10.5555/2833227.2833243(323-346)Online publication date: 17-Jun-2015
https://dl.acm.org/doi/10.5555/2833227.2833243
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

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

Irreducible polynomials over finite fields with prescribed trace/prescribed constant term

Self-Reciprocal Irreducible Polynomials Over Finite Fields

Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields