Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Irreducible polynomial

Known as: Prime (disambiguation), Prime polynomial, Reducible polynomial 
In mathematics, an irreducible polynomial is, roughly speaking, a non-constant polynomial that cannot be factored into the product of two non… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
  • P. Pollack
  • Finite Fields Their Appl.
  • 2013
  • Corpus ID: 10500602
Abstract We study the number of monic irreducible polynomials of degree n over F q having certain preassigned coefficients, where… Expand
Highly Cited
2006
Highly Cited
2006
In (Micciancio, FOCS 2002), it was proved that solving the generalized compact knapsack problem on the average is as hard as… Expand
Highly Cited
2002
Highly Cited
2002
  • H. Wu
  • IEEE Trans. Computers
  • 2002
  • Corpus ID: 7838255
Bit-parallel finite field multiplication using polynomial basis can be realized in two steps: polynomial multiplication and… Expand
Highly Cited
2000
Highly Cited
2000
We present a new formulation of the Mastrovito multiplication matrix for the field GF(2/sup m/) generated by an arbitrary… Expand
Highly Cited
2000
Highly Cited
2000
  • P. Shiu
  • The Mathematical Gazette
  • 2000
  • Corpus ID: 117450221
LATIN SQUARES. A Brief Introduction to Latin Squares. Mutually Orthogonal Latin Squares. GENERALIZATIONS. Orthogonal Hypercubes… Expand
Highly Cited
1997
Highly Cited
1997
  • D. Wan
  • Math. Comput.
  • 1997
  • Corpus ID: 7421410
Weil's character sum estimate is used to study the problem of constructing generators for the multiplicative group of a finite… Expand
Highly Cited
1993
Highly Cited
1993
The main result of this paper a new algorithm for constructing an irreducible polynomial of specified degree n over a finite… Expand
Highly Cited
1990
Highly Cited
1990
Let GF(pn) be the finite field with pn elements, where p is prime. We consider the problem of how to deterministically generate… Expand
Highly Cited
1988
Highly Cited
1988
  • V. Shoup
  • [Proceedings ] 29th Annual Symposium on…
  • 1988
  • Corpus ID: 9449894
An algorithm is presented for finding an irreducible polynomial of specified degree over a finite field. It is deterministic and… Expand
Highly Cited
1986
Highly Cited
1986
I. In troduc t ion Irreducible polynomials in Fp[X] are used to carry out the arithmetic in field extension of Fp. Computations… Expand