Post new topic Reply to topic  [ 2 posts ] 
Author Message
 Post subject: how to quickly find ONE primitive polynomial in GF(2^m)
PostPosted: Fri Apr 30, 2010 3:45 am 

Joined: Thu Jul 09, 2009 7:28 am
Posts: 24
Hi,
How to quickly find ONE primitive polynomial in GF(2^m) with "m" up to 2048 ?
I have searched for a while but failed to find such a function.

Thanks
Gepo


Report this post
Top
 Profile  
Reply with quote  
 Post subject: Re: how to quickly find ONE primitive polynomial in GF(2^m)
PostPosted: Mon May 03, 2010 6:42 pm 

Joined: Wed Mar 03, 2010 5:08 pm
Posts: 108
Location: Germany, Münster
gepo wrote:
Hi,
How to quickly find ONE primitive polynomial in GF(2^m) with "m" up to 2048 ?
I have searched for a while but failed to find such a function.

Thanks
Gepo


Supposed you mean: GF(2^m) with 2^m<= 2048 (and not m<=2048)
you can define in Singular theses Galois fields and then display the minimal polynomial.

Code:
ring r2048 = (2^11,a),x,dp;
minpoly;


It is unlikly that an explicit function for the minpolys exist. But on
Frank Luebeck's website you find lists of primitive polynomials and
two methods how to compute the Conway polynomials:

http://www.math.rwth-aachen.de/~Frank.L ... index.html


C. Gorzel


Report this post
Top
 Profile  
Reply with quote  
Display posts from previous:  Sort by  
Post new topic Reply to topic  [ 2 posts ] 

You can post new topics in this forum
You can reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot post attachments in this forum

It is currently Fri May 13, 2022 11:05 am
Powered by phpBB © 2000, 2002, 2005, 2007 phpBB Group