Re: Primitive polynomials in extended Galois fields
- From: Phil Carmody <thefatphil_demunged@xxxxxxxxxxx>
- Date: 28 Mar 2007 16:37:56 +0300
"Anup" <anupkc@xxxxxxxxx> writes:
I understand that the number of checks should be the number of factors
of 4^degree-1 and not 4^degree-1 as I mentioned in the first post. Is
that what you meant Phil ?
Yes. To check the order of an element you never have to perform more
tests than there are factors of the order of the multiplicative group.
Factors of 4^n-1 are well known from the Cunningham project, so you
don't even need to do the factorisation yourself.
Phil
--
"Home taping is killing big business profits. We left this side blank
so you can help." -- Dead Kennedys, written upon the B-side of tapes of
/In God We Trust, Inc./.
.
- Follow-Ups:
- References:
- Primitive polynomials in extended Galois fields
- From: Anup
- Re: Primitive polynomials in extended Galois fields
- From: Phil Carmody
- Re: Primitive polynomials in extended Galois fields
- From: Anup
- Primitive polynomials in extended Galois fields
- Prev by Date: Re: Primitive polynomials in extended Galois fields
- Next by Date: Re: Large-Number Math DLL?
- Previous by thread: Re: Primitive polynomials in extended Galois fields
- Next by thread: Re: Primitive polynomials in extended Galois fields
- Index(es):
Relevant Pages
|
|
