Re: Surrogate factoring, theory versus implementation

From: Xcott Craver (caj_at_B-r-a-i-n-H-z.com)
Date: 01/23/05 

Date: Sun, 23 Jan 2005 20:44:33 GMT

<jstevh@msn.com> wrote:
>
>I've checked the theory, and it's not wrong.
>
>Maybe I messed up in checking my own theory, so it seems reasonable
>that I might suppose that if there were any serious people on these
>groups with a modicum of interest that they might go check the theory
>and point out any errors in it.
>
>I don't see that happening.
   
     That's because they are waiting for you to factor an RSA challenge,
     which you could do if your math was correct.
      
     The onus is upon you to concretely prove that you have an efficient
     algorithm. The only way you can really do this is running it
     on a large composite which other people cannot factor.
  
     If you cannot do this, then arguably you have not solved the
     factoring problem.
                                                       --Xcott

Relevant Pages

  • Re: Surrogate factoring, theory versus implementation
    ... The onus is upon you to concretely prove that you have an efficient ... algorithm. ... on a large composite which other people cannot factor. ... factoring problem. ...
    (sci.math)
  • Re: Innovation, my TSP algorithm and factoring, timelines
    ... Now more recently I came up with an algorithm which I think solves the ... naturally, from thinking I have a break on the factoring problem, I'd ... And doing so I came up with two travelers where one is going backwards ... pick the least cost path, ...
    (comp.lang.java.programmer)
  • Re: EFFICIENCY: PRIME TEST vs PRIME GENERATOR
    ... > Let's suppose we have an algorithm that will take a positive ... > For example, the USUAL test runs on odd numbers, checking for primality. ... > The time it takes to prove one such number is either composite or prime is ... > you DON'T use every partition, you might require very large exponents. ...
    (sci.math)
  • Re: Primes algorithm
    ... > method which is generally used, as far as I know, is the Miller-Rabin ... > algorithm, ... > that a given number is composite, then it is definitely composite; ... A number is prime with a probability equal to either 0 or to 1. ...
    (sci.crypt)
  • Re: Towards a Formula for Primes
    ... did the OP prove that this algorithm always makes primes? ... which are either composite, or not necessarily prime ... it certainly comports to Big Peak Oil's statistics -- ...
    (sci.math)