A new algorithm for factoring polynomials over finite fields - Concepedia

Concepedia

Publication | Open Access

A new algorithm for factoring polynomials over finite fields

DOI Full Paper Access

290

Citations

5

References

1981

Year

David G. Cantor, Hans Zassenhaus

Mathematics of Computation

Mathematical ProgrammingFinite FieldsEngineeringMatrix FactorizationComputational Number TheoryProbabilistic AnalysisFinite FieldProbabilistic ComputationComputer ScienceNew Probabilistic AlgorithmApplied AlgebraApproximation TheoryNew Algorithm

Abstract

We present a new probabilistic algorithm for factoring polynomials over finite fields.

References

	Year	Citations

Page 1