Re: Looking for a very fast key agreement system
- From: tomstdenis@xxxxxxxxx
- Date: 8 Apr 2006 16:16:19 -0700
xmath wrote:
Note that 256-bit prime-field ECDH is at the moment generally regarded
as equivalent in security to 3072-bit RSA or plain DH so that makes the
comparison even more favorable for this ECDH implementation.
Keep in mind his approach is not standard nor endorsed by any standard
committee [nor is he pushing it afaik].
That and his code has only been tested on FPU friendly platforms.
:-)
But who's counting.
Normal ECC over say P-256 isn't really slow and should be fast enough
as well. Though for verification RSA would win over P-256 verification
[on most platforms]
Tom
.
- Follow-Ups:
- Re: Looking for a very fast key agreement system
- From: fabrice . gautier
- Re: Looking for a very fast key agreement system
- References:
- Looking for a very fast key agreement system
- From: fabrice . gautier
- Re: Looking for a very fast key agreement system
- From: xmath
- Re: Looking for a very fast key agreement system
- From: xmath
- Looking for a very fast key agreement system
- Prev by Date: Re: Looking for a very fast key agreement system
- Next by Date: Re: The Blum-Blum-Shub generator and a guessable seed
- Previous by thread: Re: Looking for a very fast key agreement system
- Next by thread: Re: Looking for a very fast key agreement system
- Index(es):
Relevant Pages
|