Re: A very fast Fermat factoring algorithm

From: Volker Hetzer (volker.hetzer_at_ieee.org)
Date: 03/30/05 

Date: Wed, 30 Mar 2005 19:27:54 +0200

"quantumgecko" <pete2498@umn.edu> schrieb im Newsbeitrag news:1112160089.853788.153910@z14g2000cwz.googlegroups.com...
> For my undergraduate thesis in mathematics I developed a factoring
> algorithm which is identical to Fermat's factoring algorithm but about
> 10^9 times faster. I have heard that Fermat's algorithm can be
> significantly optimized and that it has been applied in a special form
> of the quadratic sieve, but my professors are not familiar enough with
> the field of cryptography to know if my discovery is significant.
>
> Does anyone know whether a ~10^9 speed increase to Fermat's algorithm
> is of any significance to modern factoring?
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?

Lots of Greetings!
Volker

Relevant Pages

  • Re: JSH: Way too interesting
    ... And on this group, surprising even me, there is still the usual ... microscope ever built--a simple solution to the factoring problem ... To show that your algorithm really does work. ... like interesting mathematics. ...
    (sci.math)
  • Re: [OT] The PGP Signed Posts Farce
    ... ]>> They have to obey mathematics, and yes, there is every way to know. ... ]have to have an algorithm for solving p-complete problems in polynomial ... factoring numbers less than say 10^99. ... Being able to solve one finite problem ...
    (comp.os.linux.misc)
  • Re: Surrogate factoring, a fascinating idea
    ... That's because so far your "algorithm" isn't complete. ... > factoring is NOT a hard problem as previously thought. ... time trying to impress us with you gee-wow whiz-bang mathematics why ...
    (sci.crypt)
  • beta version of Victor Shoups book, "A Computational Introduction to Number Theory and Algebra&
    ... Computing with Large Integers ... The Basic Euclidean Algorithm ... Factoring and Computing Euler's phi-Function are Equivalent ... The Existence of Finite Fields ...
    (sci.crypt)
  • Re: Ultimate check, new way to factor or not?
    ... It's commonly known as a the "factoring sieve" and Fermat showed that ... It is listed as "algorithm ... "factoring with sieves" on pp.389. ... > when it defies the mathematics. ...
    (sci.crypt)