two possible coding porjects

Karl Hasselström
Tue, 5 Aug 2003 00:27:00 +0200

Content-Type: text/plain; charset=iso-8859-1
Content-Disposition: inline
Content-Transfer-Encoding: quoted-printable

On 2003-08-04 16:08:46 -0500, wrote:

> Quoting Karl Hasselstr=F6m <>:
> > That is, you call a function that may or may not preinvert your
> > divisor depending on how big it is, how many operations you'll do,
> > etc.
> OK, as long as there is a provision for telling it the number of
> expected operations is very very large. Pollard Rho spends a long
> time computing modular squares against an invariant divisor that can
> be presumed to be largish, for example. There is no way to know
> (without already knowing the factorization) how many times it will
> use the inverse.

Yes, there'll be a simple way to pass "really, REALLY many times" as a
parameter. :-)

Karl Hasselstr=F6m,

Content-Type: application/pgp-signature
Content-Disposition: inline

Version: GnuPG v1.2.2 (GNU/Linux)