Polynomials over finite fields free from large and small degree irreducible factors

DOI10.1016/S0196-6774(02)00207-9zbMath1055.11074OpenAlexW2117264801MaRDI QIDQ4799524

Theodoulos Garefalakis, Daniel Panario

Publication date: 23 March 2003

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0196-6774(02)00207-9

Mathematics Subject Classification ID

Cryptography (94A60) Polynomials in general fields (irreducibility, etc.) (12E05) Polynomials over finite fields (11T06)

Related Items (5)

Local probabilities for random permutations without long cycles ⋮ Permutations without long or short cycles ⋮ The index calculus method using non-smooth polynomials ⋮ Enumeration of decomposable combinatorial structures with restricted patterns ⋮ Sequences of consecutive smooth polynomials over a finite field

This page was built for publication: Polynomials over finite fields free from large and small degree irreducible factors