[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: diffie-hellman benchmarks



On Wed, Dec 08, 1999 at 04:28:43PM -0700, Hilarie Orman wrote:
> There's the following note re modular exponentiation, which is
> pretty easy to scale for shorter exponents. And there's a 
> 1995 Crypto paper about 155-bit EC.  

thanks but i dont think that the benchmarks from eric young take
advantage of the particular cases of IPSec (i.e. particular parameters
of MODP groups. g=2, FFFF at the begining/end of P, fixed g/p, 2
exponantiations with the same exponant, possibly others im not
aware of).
Do i overestimate the possible optimisations using the 
particular cases ?