scientific article; zbMATH DE number 3803550

zbMath0509.12002MaRDI QIDQ4748221

Arjen K. Lenstra

Publication date: 1982

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

polynomials over finite fieldscomplete factorizationpolynomials over integersalgorithms for partial factorizationalgorithms for root-findingalgorithms for square-free decompositionBerlekamp-Hensel techniquedeciding irreducibilitypolynomial-time factoring algorithmpolynomials over algebraic number fields

Mathematics Subject Classification ID

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

Related Items (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: