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

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

Abstract

We present a new algorithm for factoring polynomials over finite fields. Our algorithm is deterministic, and its running time is "almost" quadratic when the characteristic is a small fixed prime. As such, our algorithm is asymptotically faster than previously known deterministic algorithms for factoring polynomials over finite fields of small characteristic.

Original languageEnglish (US)
Title of host publicationISSAC 1991 - Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation
EditorsStephen M. Watt
PublisherAssociation for Computing Machinery
Pages14-21
Number of pages8
VolumePart F129962
ISBN (Print)0897914376, 9780897914376
DOIs
StatePublished - Jun 1 1991
Event1991 International Symposium on Symbolic and Algebraic Computation, ISSAC 1991 - Bonn, Germany
Duration: Jul 15 1991Jul 17 1991

Other

Other1991 International Symposium on Symbolic and Algebraic Computation, ISSAC 1991
CountryGermany
CityBonn
Period7/15/917/17/91

Fingerprint

Factoring
Deterministic Algorithm
Fast Algorithm
Galois field
Polynomial

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

Shoup, V. (1991). A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic. In S. M. Watt (Ed.), ISSAC 1991 - Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation (Vol. Part F129962, pp. 14-21). Association for Computing Machinery. https://doi.org/10.1145/120694.120697

A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic. / Shoup, Victor.

ISSAC 1991 - Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation. ed. / Stephen M. Watt. Vol. Part F129962 Association for Computing Machinery, 1991. p. 14-21.

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

Shoup, V 1991, A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic. in SM Watt (ed.), ISSAC 1991 - Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation. vol. Part F129962, Association for Computing Machinery, pp. 14-21, 1991 International Symposium on Symbolic and Algebraic Computation, ISSAC 1991, Bonn, Germany, 7/15/91. https://doi.org/10.1145/120694.120697
Shoup V. A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic. In Watt SM, editor, ISSAC 1991 - Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation. Vol. Part F129962. Association for Computing Machinery. 1991. p. 14-21 https://doi.org/10.1145/120694.120697
Shoup, Victor. / A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic. ISSAC 1991 - Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation. editor / Stephen M. Watt. Vol. Part F129962 Association for Computing Machinery, 1991. pp. 14-21
@inproceedings{92a9a5e3de234f35b1a3f735b6fb93a4,
title = "A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic",
abstract = "We present a new algorithm for factoring polynomials over finite fields. Our algorithm is deterministic, and its running time is {"}almost{"} quadratic when the characteristic is a small fixed prime. As such, our algorithm is asymptotically faster than previously known deterministic algorithms for factoring polynomials over finite fields of small characteristic.",
author = "Victor Shoup",
year = "1991",
month = "6",
day = "1",
doi = "10.1145/120694.120697",
language = "English (US)",
isbn = "0897914376",
volume = "Part F129962",
pages = "14--21",
editor = "Watt, {Stephen M.}",
booktitle = "ISSAC 1991 - Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation",
publisher = "Association for Computing Machinery",

}

TY - GEN

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

AU - Shoup, Victor

PY - 1991/6/1

Y1 - 1991/6/1

N2 - We present a new algorithm for factoring polynomials over finite fields. Our algorithm is deterministic, and its running time is "almost" quadratic when the characteristic is a small fixed prime. As such, our algorithm is asymptotically faster than previously known deterministic algorithms for factoring polynomials over finite fields of small characteristic.

AB - We present a new algorithm for factoring polynomials over finite fields. Our algorithm is deterministic, and its running time is "almost" quadratic when the characteristic is a small fixed prime. As such, our algorithm is asymptotically faster than previously known deterministic algorithms for factoring polynomials over finite fields of small characteristic.

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

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

U2 - 10.1145/120694.120697

DO - 10.1145/120694.120697

M3 - Conference contribution

SN - 0897914376

SN - 9780897914376

VL - Part F129962

SP - 14

EP - 21

BT - ISSAC 1991 - Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation

A2 - Watt, Stephen M.

PB - Association for Computing Machinery

ER -