Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

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

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

LATIN SQUARES. A Brief Introduction to Latin Squares. Mutually Orthogonal Latin Squares. GENERALIZATIONS. Orthogonal Hypercubes… Expand

Highly Cited

1997

Highly Cited

1997

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

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