Faster table compute in mpn_sec_powm

[Emmanuel Thomé]

On Tue, Mar 20, 2018 at 04:13:54PM +0100, Paul Zimmermann wrote:
>        Torbjörn,
> 
> > B^(2j)   = (B^j)^2      (i.e., even values of i)
> > B^(2j+1) = (B^(2j))*B   (i.e., odd values of i)
> 
> this is a classical trick we use at several places in MPFR, and we mention
> in Modern Computer Algebra (page 142).

Paul, the title of your book is "Modern Computer Arithmetic"  ;-).

E.

> 
> Does someone has an earlier reference for that trick?
> 
> Paul
> _______________________________________________
> gmp-devel mailing list
> gmp-devel at gmplib.org
> https://gmplib.org/mailman/listinfo/gmp-devel