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

Re: DH Group strengths [math]

To: svakil@usr.com
Subject: Re: DH Group strengths [math]
From: Markku-Juhani Saarinen <mjos@ssh.fi>
Date: Thu, 20 Nov 1997 10:38:56 +0200 (EET)
cc: ipsec@tis.com, Mika Kojo <mkojo@ssh.fi>
In-Reply-To: <Pine.NEB.3.95q.971120080352.26255B-100000@pilari.ssh.fi>
Sender: owner-ipsec@ex.tis.com


I wrote few minutes ago:

>   It would be silly to use an exponent that is strictly in the range 
>   [2, 2^strength]. That would make brute force search the fastest method
>   for solving the Diffie-Hellman problem.

I apologize for not thinking first..

Brute force search would not be the fastest algorithm; many discrete
logarithm methods run faster if it known that the exponent is small. 

- mj

Markku-Juhani O. Saarinen <mjos@ssh.fi>, SSH Communications Security Ltd

References:

Re: DH Group strengths [math]

From: Markku-Juhani Saarinen <mjos@ssh.fi>

Prev by Date: Re: draft-ietf-ipsec-arch-sec-02.txt and last call
Next by Date: Questions about PFS and ISAKMP SAs
Prev by thread: Re: DH Group strengths [math]
Next by thread: Re: DH Group strengths
Index(es):
- Main
- Thread