Factoring polynomials using fewer random bits

Eric Bach, Victor Shoup

Research output: Contribution to journalArticle

Abstract

Let F be a field of q=pn elements, where p is prime. We present two new probabilisticalgorithms for factoring polynomials in F[X] that make particularly efficient use of random bits. They are easy to implement, and require no randomness beyond an initial seed whose length is proportional to the input size. The first algorithm is based on a procedure of Berlekamp; on input f in F[X] of degree d, it uses d log2p random bits and produces in polynomial time a complete factorisation of f with a failure probability of no more than 1/p(1−e)d/2. (Here ε denotes a fixed parameter between 0 and 1 that can be chosen by the implementer.) The second algorithm is based on a method of Cantor and Zassenhaus; it uses d log2q random bits and fails to find a complete factorisation with probability no more than 1/q(1−e)d/4. For both of these algorithms, the failure probability is exponentially small in the number of random bits used.

Original languageEnglish (US)
Pages (from-to)229-239
Number of pages11
JournalJournal of Symbolic Computation
Volume9
Issue number3
DOIs
StatePublished - 1990

Fingerprint

Factoring
Polynomials
Polynomial
Failure Probability
Factorization
Cantor
Randomness
Polynomial time
Directly proportional
Denote

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Computational Mathematics

Cite this

Factoring polynomials using fewer random bits. / Bach, Eric; Shoup, Victor.

In: Journal of Symbolic Computation, Vol. 9, No. 3, 1990, p. 229-239.

Research output: Contribution to journalArticle

@article{f64a190d0911478184ec237d7cedd918,
title = "Factoring polynomials using fewer random bits",
abstract = "Let F be a field of q=pn elements, where p is prime. We present two new probabilisticalgorithms for factoring polynomials in F[X] that make particularly efficient use of random bits. They are easy to implement, and require no randomness beyond an initial seed whose length is proportional to the input size. The first algorithm is based on a procedure of Berlekamp; on input f in F[X] of degree d, it uses d log2p random bits and produces in polynomial time a complete factorisation of f with a failure probability of no more than 1/p(1−e)d/2. (Here ε denotes a fixed parameter between 0 and 1 that can be chosen by the implementer.) The second algorithm is based on a method of Cantor and Zassenhaus; it uses d log2q random bits and fails to find a complete factorisation with probability no more than 1/q(1−e)d/4. For both of these algorithms, the failure probability is exponentially small in the number of random bits used.",
author = "Eric Bach and Victor Shoup",
year = "1990",
doi = "10.1016/S0747-7171(08)80011-9",
language = "English (US)",
volume = "9",
pages = "229--239",
journal = "Journal of Symbolic Computation",
issn = "0747-7171",
publisher = "Academic Press Inc.",
number = "3",

}

TY - JOUR

T1 - Factoring polynomials using fewer random bits

AU - Bach, Eric

AU - Shoup, Victor

PY - 1990

Y1 - 1990

N2 - Let F be a field of q=pn elements, where p is prime. We present two new probabilisticalgorithms for factoring polynomials in F[X] that make particularly efficient use of random bits. They are easy to implement, and require no randomness beyond an initial seed whose length is proportional to the input size. The first algorithm is based on a procedure of Berlekamp; on input f in F[X] of degree d, it uses d log2p random bits and produces in polynomial time a complete factorisation of f with a failure probability of no more than 1/p(1−e)d/2. (Here ε denotes a fixed parameter between 0 and 1 that can be chosen by the implementer.) The second algorithm is based on a method of Cantor and Zassenhaus; it uses d log2q random bits and fails to find a complete factorisation with probability no more than 1/q(1−e)d/4. For both of these algorithms, the failure probability is exponentially small in the number of random bits used.

AB - Let F be a field of q=pn elements, where p is prime. We present two new probabilisticalgorithms for factoring polynomials in F[X] that make particularly efficient use of random bits. They are easy to implement, and require no randomness beyond an initial seed whose length is proportional to the input size. The first algorithm is based on a procedure of Berlekamp; on input f in F[X] of degree d, it uses d log2p random bits and produces in polynomial time a complete factorisation of f with a failure probability of no more than 1/p(1−e)d/2. (Here ε denotes a fixed parameter between 0 and 1 that can be chosen by the implementer.) The second algorithm is based on a method of Cantor and Zassenhaus; it uses d log2q random bits and fails to find a complete factorisation with probability no more than 1/q(1−e)d/4. For both of these algorithms, the failure probability is exponentially small in the number of random bits used.

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

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

U2 - 10.1016/S0747-7171(08)80011-9

DO - 10.1016/S0747-7171(08)80011-9

M3 - Article

VL - 9

SP - 229

EP - 239

JO - Journal of Symbolic Computation

JF - Journal of Symbolic Computation

SN - 0747-7171

IS - 3

ER -