Re: A very fast Fermat factoring algorithm

From: Tom St Denis (tomstdenis_at_gmail.com)
Date: 03/30/05 

Date: 30 Mar 2005 09:29:46 -0800

Volker Hetzer wrote:
> Just out of curiosity, have you experienced that speedup or is this
> a theoretical result?
> Does it occur with numbers of a size of interest for
> current RSA applications, i.e. 4K-16K bits or is this some
normalized
> stuff occurring for infinitely large numbers?

Where are >4K bit RSA keys being used? Hell most people still use 1K
bit RSA keys.

Tom