Re: JSH: Remarkably odd

On Sun, 22 Feb 2009 08:06:49 -0800 (PST), JSH <jstevh@xxxxxxxxx>
wrote:

On Feb 22, 7:30 am, rossum <rossu...@xxxxxxxxxxxx> wrote:
On Sun, 22 Feb 2009 07:12:31 -0800 (PST), JSH <jst...@xxxxxxxxx>
wrote:

But that's not true.  It's trivial to find a rational v that will
work!

Then show us a worked example of this trivial task, one that does not
start from a prior knowledge of the factors of our target integer.

That condition is unnecessary as its EXISTENCE is what matters.
James, if you need to know the factors before you start then you have
not solved the factoring problem. You must start from a position
where you do not know the factors. I agree that v exists, just as I
know that non-trivial factors of a given RSA number exist. The hard
part is not showing that they exist but finding exactly what their
values are.


You have shown that such a v must exist by working backwards from the
factors.  You have not yet shown us how to find v without knowing the
factors in advance.

Which contradicts with the minima argument!!!
I am not doubting that v exists, I am asking how to find the right v
without having to try all the wrong v's first. I can show that an RSA
number is composite and hence that it has non-trivial factors. That
does not enable me to find those factors quickly. How do we find the
right v? We know that it is in the haystack somewhere; do you have a
metal detector or do we have to examine every straw in the whole stack
individually?


You're coming up with arbitrary conditions which dodge the
mathematical proof.
All I am asking for is how we find the correct value of v. Without a
correct value of v we cannot proceed to complete your method. All I
am asking for is a worked example of how to find v for say factoring
15.

Asking for a *quick* method is not imposing an arbitrary condition on
the factoring problem, it is the essence of the problem. If I want a
slow method I have plenty to pick from already available. If you want
your method to stand out from the crowd then your method must be fast.
Show us a worked example of how to pick the required value of v
quickly.

rossum

.

Relevant Pages

  • Re: JSH: Remarkably odd
    ... Then show us a worked example of this trivial task, ... start from a prior knowledge of the factors of our target integer. ... not solved the factoring problem. ... know that non-trivial factors of a given RSA number exist. ...
    (sci.math)
  • Re: JSH: Ethics of a factoring solution
    ... When you post one of your solutions to the factoring problem there are ... Remember that I can find a solution to the RSA problem with a simple ... due warning and allowed time to change to a more secure method. ...
    (sci.crypt)
  • Re: JSH, when is this "Internet buzz" supposed to start?
    ... It would be cool to have a solution to the factoring problem (that is, ... faster than you can use that composite to encrypt with RSA. ... algorithm covering an arbitrary collection of variously connected ... Knowledge is power. ...
    (sci.crypt)
  • Re: JSH: Remarkably odd
    ... It's called the RSA Challenge. ... Ok, the game is cancelled, ... factoring problem. ... remarkable group effort, as if it matters. ...
    (sci.math)
  • JSH: Ethics of a factoring solution
    ... factoring problem if every time I think I have one I beat myself up ... find one, my temptation is always to dump it out on Usenet, and let ... I would not give a damn about the RSA prize money. ...
    (sci.crypt)