Re: Surrogate factoring, top to bottom
- From: gordonb.rsibi@xxxxxxxxxxx (Gordon Burditt)
- Date: Wed, 28 Mar 2007 02:11:22 -0000
The human species can rot and die before any of those people will lift
a finger to support any of my research as they rightly see it as an
issue of survival.
RSA Security has a long record of providing cash prizes for factoring
large composites.
http://www.rsa.com/rsalabs/node.asp?id=2093
There are prizes ranging from $30k for factoring a 704 bit number,
up to $200k for a 2048 bit number.
It's my guess that someone will successfully factor the 704 bit
number, using only crayons and paper and their brain, before JSH
manages to use surrogate factoring to factor 6.
Proposed algorithm for the crayon-and-paper method:
first_trial_divisor = floor(sqrt(i704_bit_number));
for (i = first_trial_divisor; ; i--) {
Try dividing i704_bit_number by i.
If it comes out without remainder, you've found a factor!
Otherwise, eat lunch, then try the next lower number.
}
.
- References:
- Surrogate factoring, top to bottom
- From: jstevh
- Re: Surrogate factoring, top to bottom
- From: Peter Trei
- Surrogate factoring, top to bottom
- Prev by Date: Batch verification via Pippenger's algorithm
- Next by Date: Re: Large-Number Math DLL?
- Previous by thread: Re: Surrogate factoring, top to bottom
- Next by thread: JSH: Psyching myself up
- Index(es):