From: Brad Huntting <huntting@glarp.com>
Date: Sat, 27 Aug 94 18:58:10 PDT
To: karn@toad.com
Subject: Re: DSPs
In-Reply-To: <199408262009.NAA17046@unix.ka9q.ampr.org>
Message-ID: <199408280157.TAA17552@misc.glarp.com>
MIME-Version: 1.0
Content-Type: text/plain



> But then I hear people say that it's not the multiplication that slows
> down modular exponentiation, it's the modular reduction.

A once saw a short paper on "modular multiplication without trial
division" or some such.

The down side was that (at least for the 486 doing RSA) you didnt
seem to get any extra speed over using a straight forward
test-subtract-n-shift method.

Unfortunatly, I dont have a reference.  Sorry.


brad