two possible coding porjects

[Karl Hasselström]

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

On 2003-08-04 16:08:46 -0500, stephen-nuchia@utulsa.edu wrote:

> Quoting Karl Hasselstr=F6m <kha@treskal.com>:
>
> > 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.
>=20
> 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. :-)

--=20
Karl Hasselstr=F6m, kha@treskal.com
      www.treskal.com/kalle

--i9LlY+UWpKt15+FH
Content-Type: application/pgp-signature
Content-Disposition: inline

-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.2.2 (GNU/Linux)

iD8DBQE/Lt20N7iPzXSoOQoRAnvSAJ48AhBLPEE2ZXakYidy0sOooz3LPwCcCUHp
AOL7tKjBmqrUcV/WksJYNCM=
=9UxN
-----END PGP SIGNATURE-----

--i9LlY+UWpKt15+FH--