Re: efficiency of modular exponentiation

Bill Allombert on Wed, 27 Mar 2013 16:36:40 +0100

[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]

Re: efficiency of modular exponentiation

To: pari-users@pari.math.u-bordeaux.fr
Subject: Re: efficiency of modular exponentiation
From: Bill Allombert <Bill.Allombert@math.u-bordeaux1.fr>
Date: Wed, 27 Mar 2013 16:36:33 +0100
Delivery-date: Wed, 27 Mar 2013 16:36:40 +0100
In-reply-to: <1364397645.84928.YahooMailClassic@web185001.mail.gq1.yahoo.com>
Mail-followup-to: pari-users@pari.math.u-bordeaux.fr
References: <CAJkPp5Nd0HeFdzRkH0EekYDWMoHTjJV+jfYsQHmhsxKjr-Cx=g@mail.gmail.com> <1364397645.84928.YahooMailClassic@web185001.mail.gq1.yahoo.com>
User-agent: Mutt/1.5.20 (2009-06-14)

On Wed, Mar 27, 2013 at 08:20:45AM -0700, William Hart wrote:
> I believe Magma has special code for working over GF2.

So does PARI, but this requires to define GF(2^n) elements as FFELT instead of
POLMOD of INTMOD. (INTMOD mod 2 are especially inefficient).

Cheers,
Bill.

References:
- efficiency of modular exponentiation
  - From: Max Alekseyev <maxale@gmail.com>
- Re: efficiency of modular exponentiation
  - From: William Hart <hart_wb@yahoo.com>

Prev by Date: Re: efficiency of modular exponentiation
Next by Date: Re: efficiency of modular exponentiation
Previous by thread: Re: efficiency of modular exponentiation
Next by thread: Re: efficiency of modular exponentiation
Index(es):
- Date
- Thread