Cluster-wide overclocking...

[Robert G. Brown]

On Thu, 24 Sep 1998, Shachar Tal wrote:

> needed to achieve it. An example would be computing a password from a
> crypt()'ed one vs. verifying it to be correct against its encrypted form.
> In such case, calculating every 1.2 billionth calculation will give you an
> overhead of 1/(1-1/1200000000) ~ 1+1/1200000000 i.e. virutally no overhead
> at all. 

That is, of course, assuming that one COULD compute a password from its
encrypted form...;-)

   rgb

Robert G. Brown	                       http://www.phy.duke.edu/~rgb/
Duke University Dept. of Physics, Box 90305
Durham, N.C. 27708-0305
Phone: 1-919-660-2567  Fax: 919-660-2525     email:rgb@phy.duke.edu