Re: Basically a sieve method, relation to quantum

jstevh_at_msn.com
Date: 01/22/05 

Date: 22 Jan 2005 08:31:18 -0800

Xcott Craver wrote:
> <jstevh@msn.com> wrote:
> >
> >I get a sense that some of you don't get it, so let's say you take
some
> >RSA challenge number, and calculate j and T, and factor them, and
then
> >run them through the algorithm.
> >
> >My research indicates you have a 50% chance of factoring the number.
>
> If this is true, then why not run your algorithm on ALL of the
> challenge numbers, and factor about half of them?
>
> If what you're saying is true, you could factor at least one
> challenge number today.
>

Conceivably, yes, if I used some other program to factor T, since my
current program just would in all likelihood fail to fully factor it,
as I call it recursively to do all the factorizations, breaking down a
number until it gets to something smaller than 200, at which point it
uses a table of primes!

Remember my method is *surrogate* factoring, which means you have to
factor something!!!

To factor an RSA challenge number I'd need a full factorization of some
number off of it. Now T = M^2 - j^2, where M is the target number, and
j is a number you get to pick.

My analysis is that if you do that with my method there is a
significant chance that you will factor M, if you use a full
decomposition of T, and all combinations of its factors.

Now I know that you people don't believe me, which is actually good, as
it just make it kind of funny, you know?

Like, if you believed me, maybe one of you might do it, but you won't
because you don't, until someone of greater intellectual ability comes
along, or I do it myself.

What I'm doing is getting a handle on the theory so that I don't waste
time searching for a solution, like having to experiment with different
j's to get one that works, without knowing exactly why it works.

Now someone else who only cares about getting the solution might not be
so particular.

I'm about finesse.

You people talk a lot so I'm not worried about you. I can freely talk
about this research without concern that any of you will do anything,
but talk.

I have years of experience dealing with you, from which I can tell what
you will and will not do.

James Harris

Relevant Pages

  • Re: Basically a sieve method, relation to quantum
    ... >>run them through the algorithm. ... as I call it recursively to do all the factorizations, ... To factor an RSA challenge number I'd need a full factorization of some ... I have years of experience dealing with you, from which I can tell what ...
    (sci.math)
  • Re: What is exponent?
    ... For simple description of RSA algorithm ... I also have the receiver's certificate (public key only). ... Use RSA to encrypt the session key ...
    (microsoft.public.dotnet.security)
  • Re: Dummy questions from a newbie
    ... does this in a reasonable amount of time. ... However RSA is used widely enough that most cryptosystems ... hashing algorithm should i choose in your opinion? ... Increasing the number of Deep Crack boards could it make it simpler to ...
    (sci.crypt)
  • Re: RSA Challenge Question
    ... unless the algorithm required some deep ... RSA is not used for encryption. ... *them* (Sally Jane) submit the results, wherein Chappy calls John Doe, ...
    (sci.crypt)
  • Re: Quantum slip - Quantum conspiracy
    ... RSA and DH are done in by Shor's algorithm. ... So you can look on ECC as slightly more vulnerable ... As far as NTRU goes, ...
    (sci.crypt)