Re: gnupg rsa question // why use e of 41 ?
- From: Sebastian Gottschalk <seppi@xxxxxxxxx>
- Date: Fri, 28 Apr 2006 21:01:37 +0200
David Wagner wrote:
vedaal wrote:
/* find an public exponent.
We use 41 as this is quite fast and more secure than the
commonly used 17. Benchmarking the RSA verify function
with a 1024 bit key yields (2001-11-08):
This is a suspicious comment and indicates to me that maybe the
developer is not fully up to speed on all of the literature on the
security of RSA.
BTW, isn't 65537 chosen because it can be implemented faster than
generic numbers (due to its form 1<<16+1)?
.
- Follow-Ups:
- Re: gnupg rsa question // why use e of 41 ?
- From: David Wagner
- Re: gnupg rsa question // why use e of 41 ?
- From: tomstdenis
- Re: gnupg rsa question // why use e of 41 ?
- References:
- gnupg rsa question // why use e of 41 ?
- From: vedaal
- Re: gnupg rsa question // why use e of 41 ?
- From: David Wagner
- gnupg rsa question // why use e of 41 ?
- Prev by Date: Re: gnupg rsa question // why use e of 41 ?
- Next by Date: Re: gnupg rsa question // why use e of 41 ?
- Previous by thread: Re: gnupg rsa question // why use e of 41 ?
- Next by thread: Re: gnupg rsa question // why use e of 41 ?
- Index(es):