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: David Wagner <daw@taverner.cs.berkeley.edu>
Date: Fri Apr 28 2006 - 21:20:57 CEST



Sebastian Gottschalk  wrote:


>BTW, isn't 65537 chosen because it can be implemented faster than


>generic numbers (due to its form 1<<16+1)?



I don't know what you mean by "generic numbers".  e=65537 is faster


than using an exponent e randomly chosen between 2..phi(n), but it is


slower than e=3.  As far as we know, e=65537 no more secure than e=3,


assuming you use appropriate padding methods.


Received on Mon May  1 02:05:47 2006