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

AN - SCOPUS:84971235488

SN - 0897914376

SN - 9780897914376

T3 - Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

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

T2 - 1991 International Symposium on Symbolic and Algebraic Computation, ISSAC 1991

Y2 - 15 July 1991 through 17 July 1991

ER -