Re: A very fast Fermat factoring algorithm

From: Pubkeybreaker (Robert_silverman_at_raytheon.com)
Date: 03/31/05


Date: 31 Mar 2005 05:33:18 -0800


"Just out of curiosity, have you experienced that speedup or is this
a theoretical result? "

Indeed, I find the claim rather incredible. Consider a Fermat
factorization
that takes a second on a 3 GHz (or so) machine. The claim amounts to
saying
that his method can do it in 1 nanosecond, i.e. about 3 clock
ticks!!! This
seems ridiculous!!!



Relevant Pages

  • Re: Special form numbers factorization
    ... I'm studying something about factorization and I have a curiosity. ... > I've often read that there are some 'special form numbers' very easy ... > Thank you very much Sandra ...
    (sci.math)
  • Re: Special form numbers factorization
    ... I'm studying something about factorization and I have a curiosity. ... The Cunningham numbers do not fall into this category. ...
    (sci.math)
  • Special form numbers factorization
    ... I'm studying something about factorization and I have a curiosity. ... I've often read that there are some 'special form numbers' very easy ...
    (sci.math)
  • Re: Special form numbers factorization
    ... I'm studying something about factorization and I have a curiosity. ... > I've often read that there are some 'special form numbers' very easy ...
    (sci.math)