1994-08-26 - Re: Fast modular exponentiation

Header Data

From: tcmay@netcom.com (Timothy C. May)
To: karn@qualcomm.com
Message Hash: e99cb627ed46a5152be0c5dc4db8c4c42084582bd43945b5bf41c7fdf4590351
Message ID: <199408260726.AAA17588@netcom2.netcom.com>
Reply To: <199408260554.WAA16670@unix.ka9q.ampr.org>
UTC Datetime: 1994-08-26 07:26:33 UTC
Raw Date: Fri, 26 Aug 94 00:26:33 PDT

Raw message

From: tcmay@netcom.com (Timothy C. May)
Date: Fri, 26 Aug 94 00:26:33 PDT
To: karn@qualcomm.com
Subject: Re: Fast modular exponentiation
In-Reply-To: <199408260554.WAA16670@unix.ka9q.ampr.org>
Message-ID: <199408260726.AAA17588@netcom2.netcom.com>
MIME-Version: 1.0
Content-Type: text/plain

> An interesting discussion. Thanks.
> How about a basic tutorial on these various modexp algorithms, with
> particular attention to how many of each arithmetic operation

I want to tie this in to that other hot Cypherpunks topic: Pretty Good

Even though the topic is nearly depleted, and the sabots have jammed
the list machine pretty thoroughly, how much faster would a fast
modular exponentiation go if the inner loops were encased in a layer
of deleted unobtainium?

--Klaus! von Future Prime