scientific article; zbMATH DE number 1008373

zbMath0882.11065MaRDI QIDQ4336113

Daniel Panario, Shuhong Gao

Publication date: 8 December 1997

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

zbMATH Keywords

finite fieldsirreducible polynomialsfactoring algorithms\(m\)-rough polynomials

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)

Related Items (11)

A note on the reducibility of binary affine polynomials ⋮ Full classification of permutation rational functions and complete rational functions of degree three over finite fields ⋮ Message authentication based on cryptographically secure CRC without polynomial irreducibility test ⋮ Standard generators of finite fields and their cyclic subgroups ⋮ On the degrees of polynomial divisors over finite fields ⋮ Calculating the set of orders of elements in the finite linear groups ⋮ Gauss periods: orders and cryptographical applications ⋮ Factoring polynomials over finite fields: A survey ⋮ Analysis of Rabin's irreducibility test for polynomials over finite fields ⋮ A note on the multiple-recursive matrix method for generating pseudorandom vectors ⋮ On Sets of Irreducible Polynomials Closed by Composition

This page was built for publication: