Re: Simple answer, surrogate factoring

jstevh_at_msn.com
Date: 03/04/05 

Date: 4 Mar 2005 14:54:20 -0800

fiziwig wrote:
> I've followed your postings off and on for several years. I, too, am
> an amateur interested in the factoring problem, and probably more
> willing than most to give you the benefit of the doubt. I suspect
that
> there is a very fast factoring algorithm just waiting to be
discovered,
> and it's likely it might come from a completely unexpected direction.
> I don't see any compelling reason why it might not be discovered by
an
> amateur such as your or me. I've pondered this problem since my high
> school days in 1960 but haven't accomplished anything more exciting
> that re-inventing Pollard's rho before I knew of it's existence.
But,
> fool that I am, I keep studying and trying new approaches.
>

It's fun. I think it sad that people who like to just play with
interesting mathematics have to feel a need to apologize for that and
be self derogatory on a cryptology or math newsgroup, but I understand
the reality that makes that a good idea.

People on math newsgroups simply aren't tolerant.

They attack not only new ideas, but simply daring to put forward new
ideas.

Sure if you're begging for math help they'll be nice to you, but dare
to claim you have some ideas of your own worth considering? And
they'll try to whack you for it.

Believe me, I know.

> But I have to ask one question. As I recall, I think I asked you
this
> question a year or two ago and didn't get an answer. The question is
> simply this: Could you take a reasonably small number, say 8 or 10
> digits, and DEMONSTRATE, step by step how your method would be
applied
> to factoring that number. Can I see how you use it to factor an easy
> number like 50,985,511 for example?
>
> --gary

Why? It'd make as much sense to factor an easy number like 15.

I'm more of a theoretical guy. I want to know why.

So I give the mathematical basis for various ideas, and if you're
interested enough, you can play with it and test it out.

I don't like specific factorization requests though I have tried some
at times, as they don't serve a purpose.

If I factor the number, people will just put up bigger numbers, and if
I could factor RSA Challenge numbers I wouldn't be talking about it on
Usenet, but posters would keep putting up numbers until that point and
beyond, as that's how Usenet is.

James Harris

Relevant Pages

  • Re: Simple answer, surrogate factoring
    ... > an amateur interested in the factoring problem, ... > there is a very fast factoring algorithm just waiting to be discovered, ... > amateur such as your or me. ... genuine insight to discover it. ...
    (sci.math)
  • Re: Simple answer, surrogate factoring
    ... > an amateur interested in the factoring problem, ... > there is a very fast factoring algorithm just waiting to be discovered, ... > amateur such as your or me. ... genuine insight to discover it. ...
    (sci.crypt)
  • Re: Simple answer, surrogate factoring
    ... > an amateur interested in the factoring problem, ... > there is a very fast factoring algorithm just waiting to be discovered, ... > I don't see any compelling reason why it might not be discovered by an ... > amateur such as your or me. ...
    (sci.math)
  • Re: Simple answer, surrogate factoring
    ... > an amateur interested in the factoring problem, ... > there is a very fast factoring algorithm just waiting to be discovered, ... > I don't see any compelling reason why it might not be discovered by an ... > amateur such as your or me. ...
    (sci.crypt)
  • Re: Simple answer, surrogate factoring
    ... > an amateur interested in the factoring problem, ... > amateur such as your or me. ... be self derogatory on a cryptology or math newsgroup, ...
    (sci.math)