Re: gnupg rsa question // why use e of 41 ?
Available news archives: comp.lang.tcl - comp.lang.python - comp.security.firewalls - sci.crypt - comp.lang.php - comp.lang.javascript
Google
 
Web news.hping.org


sci.crypt archive

Re: gnupg rsa question // why use e of 41 ?

From: Sebastian Gottschalk <seppi@seppig.de>
Date: Fri Apr 28 2006 - 21:01:37 CEST

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)?
Received on Mon May 1 02:05:46 2006