Re: Fast Modular Exponentiation with Huge Exponents

SugarBug <3883@sugar.bug> writes:

I am seeking different efficient programming methods (algorithms) for
modular exponentiation with huge exponents, viz. 160-bit to 1024-bit

...

I am not the least bit interested in using 3rd party code for this
project. Please point the way to _algorithms_, not libraries or units.

/Prime Numbers and Computer Methods for Factorization/ - Hans Riesel
/Prime Numbers: A Computational Perspective/ - Crandall & Pomerance

Phil
--
We are no longer hunters and nomads. No longer awed and frightened, as we have
gained some understanding of the world in which we live. As such, we can cast
aside childish remnants from the dawn of our civilization.
-- NotSanguine on SoylentNews, after Eugen Weber in /The Western Tradition/