Re: Explaining surrogate factoring, again
From: ošin (ošin_at_ragnarok.com)
Date: 01/25/05
- Next message: lucy: "how to do simulation for branching process?"
- Previous message: Timothy Little: "Re: C(n, k): binomial coefficient calculation"
- In reply to: jstevh_at_msn.com: "JSH: Explaining surrogate factoring, again"
- Messages sorted by: [ date ] [ thread ]
Date: Mon, 24 Jan 2005 21:44:47 -0800
You never explained why you think that you have an algorithm that is
polynomial time. And you have not shown that if it is polynomial time that
it is practical in attacking RSA. You jack off about quadratic residues, and
super sieves, and you spew trivial little algebraic equations, that clearly
mean nothing, but you do not show how your "work" translates into an
algorithm. You have a Java program that supposedly implements some factoring
algorithm derived from your pathetic algebraic crap, that only works half
the time, and when it does work, it is very slow. And the 50% success rate,
you blame on quadratic residues on day, and you blame it on heavy recursion
on the next day. So if recursion is causing problems, why don't you avoid
using recursion? You are having about as much success in factoring as you
had in your futile FLT proof. You have convinced nobody.
- Next message: lucy: "how to do simulation for branching process?"
- Previous message: Timothy Little: "Re: C(n, k): binomial coefficient calculation"
- In reply to: jstevh_at_msn.com: "JSH: Explaining surrogate factoring, again"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|
