scientific article; zbMATH DE number 3803550

MaRDI QIDQ4748221zbMATH OpenFDO

Authors Arjen K. Lenstra

Publication date 1982

zbMATH Keywords

algorithms for partial factorizationalgorithms for root-findingalgorithms for square-free decompositionBerlekamp-Hensel techniquecomplete factorizationdeciding irreducibilitypolynomial-time factoring algorithmpolynomials over algebraic number fieldspolynomials over finite fieldspolynomials over integers

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Polynomials (irreducibility, etc.) (11R09) Polynomials over finite fields (11T06) Research exposition (monographs, survey articles) pertaining to field theory (12-02) Software, source code, etc. for problems pertaining to field theory (12-04) Numerical computation of solutions to single equations (65H05) Analysis of algorithms and problem complexity (68Q25)

Cited in

(3)

• Calculating the structure of a semisimple Lie algebra
• On the Chor-Rivest knapsack cryptosystem
• Using zeta functions to factor polynomials over finite fields

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4748221)