Re: Speed up RgX_mul, RgX_sqr, RgX_divrem over Z, Fp, FpXQ

[Bill Allombert <Bill.Allombert@math.u-bordeaux.fr>]

On Sun, Sep 03, 2017 at 07:08:18PM +0200, Bill Allombert wrote:
> On Mon, Aug 28, 2017 at 12:11:27PM +0200, Peter Bruin wrote:
> > Hi Bill,
> > 
> > > On Wed, Jun 07, 2017 at 09:12:55PM +0200, Bill Allombert wrote:
> > >> Maybe it would be better to have functions RgX_mul_i etc.
> > >> that does what RgX_mul is doing now, and change RgX_mul
> > >> to do what you suggest.
> > >
> > > I implemented that. Furthermore I added a framework that allows
> > > RgX_mul/RgX_sqr to add support for most types.
> > >
> > > Please check commit dcf58b3. 
> > 
> > This solution looks very nice to me!
> 
> If you are interested, you can try to do something similar with
> RgX_divrem.

I did RgX_rem, RgXQ_inv, RgM_mul, RgM_sqr, RgM_inv.
Also I implemented a fast algorithm for ZM_inv (that uses your code
for fast Flm_inv).

Cheers,
Bill.