Finding irreducible polynomials over finite fields

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Finding irreducible polynomials over finite fields

Full text

Pdf (284 KB)

Source

Annual ACM Symposium on Theory of Computing archive
Proceedings of the eighteenth annual ACM symposium on Theory of computing table of contents

Berkeley, California, United States

Pages: 350 - 355

Year of Publication: 1986

ISBN:0-89791-193-8

Authors

L M Adleman	Dept. of Computer Science, University of Southern California
H W Lenstra	Mathematisch Instituut, Universiteit van Amsterdam and Mathematical Sciences Research Institute

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 14, Downloads (12 Months): 97, Citation Count: 3

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/12130.12166 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	E. Bach and J. Shallit, ~Factoring with Cyclotomic Polynomials, ~ Proceedings 26th FOCS, 1985, pp. 443-450.
	2	E.R. Berlekamp, "Algebraic Coding Theory, ~ McGraw-Hill Publishing Company, New York, 1968.
	3	Benny Chor , Ronald L Rivest, A knapsack type public key cryptosystem based on arithmetic in finite fields, Proceedings of CRYPTO 84 on Advances in cryptology, p.54-65, August 1985, Santa Barbara, California, United States
	4	J. Von zur Gathen, ~Irreducible Polynomials Over Finite Fields," Manuscript, 1985.
	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.
	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.
	7	P.J. McCarthy, ~Algebraic Extensions of Fields, ~ Blaisdell Publishing Company, Waltham, Mass., 1966
	8	M.O. Rabin, "Probabilistie Algorithms in Finite Fields," SIAM J. Comput., Vol. 9, (1980), pp. 273-280.
	9	L. Washington, "Cyclotomic Fields," Springer- Verlag, New York 1980.
	10	J. H. Wilkinson, The algebraic eigenvalue problem, Oxford University Press, Inc., New York, NY, 1988

CITED BY 3

	Michael Ben-Or, A deterministic algorithm for sparse multivariate polynomial interpolation, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.301-309, May 02-04, 1988, Chicago, Illinois, United States
	Victor Shoup, Fast construction of irreducible polynomials over finite fields, Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms, p.484-492, January 25-27, 1993, Austin, Texas, United States
	V. Shoup, Searching for primitive roots in finite fields, Proceedings of the twenty-second annual ACM symposium on Theory of computing, p.546-554, May 13-17, 1990, Baltimore, Maryland, United States