Computing Frobenius maps and factoring polynomials

Joachim von zur Gathen, Victor Shoup

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A new probabilistic algorithm for factoring univariate polynomials over finite fields is presented whose asymptotic running time improves upon previous results. To factor a polynomial of degree n over Fq, the algorithm uses O((n2+n log q)·(log n)2 log log n) arithmetic operations in Fq. The main technical innovation is a new way to compute Frobenius and trace maps in the ring of polynomials modulo the polynomial to be factored.

Original languageEnglish (US)
Title of host publicationConference Proceedings of the Annual ACM Symposium on Theory of Computing
Editors Anon
PublisherPubl by ACM
Pages97-105
Number of pages9
ISBN (Print)0897915119
StatePublished - 1992
EventProceedings of the 24th Annual ACM Symposium on the Theory of Computing - Victoria, BC, Can
Duration: May 4 1992May 6 1992

Other

OtherProceedings of the 24th Annual ACM Symposium on the Theory of Computing
CityVictoria, BC, Can
Period5/4/925/6/92

Fingerprint

Polynomials
Innovation

ASJC Scopus subject areas

  • Software

Cite this

von zur Gathen, J., & Shoup, V. (1992). Computing Frobenius maps and factoring polynomials. In Anon (Ed.), Conference Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 97-105). Publ by ACM.

Computing Frobenius maps and factoring polynomials. / von zur Gathen, Joachim; Shoup, Victor.

Conference Proceedings of the Annual ACM Symposium on Theory of Computing. ed. / Anon. Publ by ACM, 1992. p. 97-105.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

von zur Gathen, J & Shoup, V 1992, Computing Frobenius maps and factoring polynomials. in Anon (ed.), Conference Proceedings of the Annual ACM Symposium on Theory of Computing. Publ by ACM, pp. 97-105, Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, Victoria, BC, Can, 5/4/92.
von zur Gathen J, Shoup V. Computing Frobenius maps and factoring polynomials. In Anon, editor, Conference Proceedings of the Annual ACM Symposium on Theory of Computing. Publ by ACM. 1992. p. 97-105
von zur Gathen, Joachim ; Shoup, Victor. / Computing Frobenius maps and factoring polynomials. Conference Proceedings of the Annual ACM Symposium on Theory of Computing. editor / Anon. Publ by ACM, 1992. pp. 97-105
@inproceedings{3f30d0e713064697823efe887d2a0ea6,
title = "Computing Frobenius maps and factoring polynomials",
abstract = "A new probabilistic algorithm for factoring univariate polynomials over finite fields is presented whose asymptotic running time improves upon previous results. To factor a polynomial of degree n over Fq, the algorithm uses O((n2+n log q)·(log n)2 log log n) arithmetic operations in Fq. The main technical innovation is a new way to compute Frobenius and trace maps in the ring of polynomials modulo the polynomial to be factored.",
author = "{von zur Gathen}, Joachim and Victor Shoup",
year = "1992",
language = "English (US)",
isbn = "0897915119",
pages = "97--105",
editor = "Anon",
booktitle = "Conference Proceedings of the Annual ACM Symposium on Theory of Computing",
publisher = "Publ by ACM",

}

TY - GEN

T1 - Computing Frobenius maps and factoring polynomials

AU - von zur Gathen, Joachim

AU - Shoup, Victor

PY - 1992

Y1 - 1992

N2 - A new probabilistic algorithm for factoring univariate polynomials over finite fields is presented whose asymptotic running time improves upon previous results. To factor a polynomial of degree n over Fq, the algorithm uses O((n2+n log q)·(log n)2 log log n) arithmetic operations in Fq. The main technical innovation is a new way to compute Frobenius and trace maps in the ring of polynomials modulo the polynomial to be factored.

AB - A new probabilistic algorithm for factoring univariate polynomials over finite fields is presented whose asymptotic running time improves upon previous results. To factor a polynomial of degree n over Fq, the algorithm uses O((n2+n log q)·(log n)2 log log n) arithmetic operations in Fq. The main technical innovation is a new way to compute Frobenius and trace maps in the ring of polynomials modulo the polynomial to be factored.

UR - http://www.scopus.com/inward/record.url?scp=0026999432&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026999432&partnerID=8YFLogxK

M3 - Conference contribution

SN - 0897915119

SP - 97

EP - 105

BT - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

A2 - Anon, null

PB - Publ by ACM

ER -