A very fast Fermat factoring algorithm
From: quantumgecko (pete2498_at_umn.edu)
Date: 03/30/05
- Next message: Shannon Appel: "[SSL-Talk List FAQ] Secure Sockets Layer Discussion List FAQ v1.1.1"
- Previous message: Paul Rubin: "Re: Dieter Schmidt Blowfish Paper Results"
- Next in thread: A. Caspis: "Re: A very fast Fermat factoring algorithm"
- Reply: A. Caspis: "Re: A very fast Fermat factoring algorithm"
- Reply: Pubkeybreaker: "Re: A very fast Fermat factoring algorithm"
- Reply: Volker Hetzer: "Re: A very fast Fermat factoring algorithm"
- Reply: quantumgecko: "Re: A very fast Fermat factoring algorithm"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: 29 Mar 2005 21:21:29 -0800
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?
- Next message: Shannon Appel: "[SSL-Talk List FAQ] Secure Sockets Layer Discussion List FAQ v1.1.1"
- Previous message: Paul Rubin: "Re: Dieter Schmidt Blowfish Paper Results"
- Next in thread: A. Caspis: "Re: A very fast Fermat factoring algorithm"
- Reply: A. Caspis: "Re: A very fast Fermat factoring algorithm"
- Reply: Pubkeybreaker: "Re: A very fast Fermat factoring algorithm"
- Reply: Volker Hetzer: "Re: A very fast Fermat factoring algorithm"
- Reply: quantumgecko: "Re: A very fast Fermat factoring algorithm"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|
|