Fast Construction of Irreducible Polynomials of degree n over any Finite Field

burritoloco
Messages
81
Reaction score
0
Hello, I'm currently doing an undergrad project on this topic and I was wondering if any of you guys know what is the fastest algorithm (asymptotically) that has been discovered so far, for such purpose. Here is paper by Shoup (1993) which gave the fastest algorithm up to then.

http://www.shoup.net/papers/fastirred.pdf

After that, I'm not really sure. Any ideas? Thank you.
 
Physics news on Phys.org
Just found this paper by Jean-Marc Couveignes and Reynald Lercier (2009):

http://www.math.univ-toulouse.fr/~couveig/publi/couveignes-lercier.pdf
 
Last edited by a moderator:

Thread '##(A/\mathfrak{a})_{\mathfrak{p}/\mathfrak{a}}## and its isomorphism?'

I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
View full post »

Thread 'Questions about non existence of GCDs vs (coimages, cokernels)'

The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
View full post »

Thread 'Decomposition into irreps of compact Lie group'

When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
View full post »

Similar threads

Fast Construction of Irreducible Polynomials of degree n over any Finite Field
Replies
1
Views
2K
Irreducible Polynomials over Finite Fields
Replies
5
Views
3K
Definition of Finite Field: Addition and Multiplication Groups
Replies
1
Views
2K
Irreducible Polynomials p 5 degree 4
Replies
1
Views
6K
Irreducibility test for polynomials over Fp
Replies
4
Views
6K
Irreducible polynomials over finite fields
Replies
15
Views
14K
Constructing the splitting field for a polynomial over Z/Z3
Replies
12
Views
4K
Minimum Number of Distinct Values for a Polynomial over a Finite Field
Replies
8
Views
4K
Irreducible polynomial over finite field
Replies
12
Views
7K
Constructing a Finite Field of Order 16 and Finding Primative Element
Replies
3
Views
3K

Hot Threads

Recent Insights

Back
Top