Re: JSH: Easy math, easy solution

From: denis feldmann (denis.feldmann_at_wanadoo.fr)
Date: 02/09/05 

Date: Wed, 09 Feb 2005 21:52:50 +0100

Steven a écrit :
>>Factorization is quite simple. Here is an algorithm for it.
>>Input: a composite number n.
>>Output: an ordered pair (b,c) such that 1 < b <n, 1 < c < n, and bc =
>
> n.
>
>
> Why on earth did you post this!!! IF YOU THINK FACTORIZATION IS SO
> EASY TRY FACTORING A 500+ DIGIT RSA MODULUS!! Then tell us hhoe easy
> it is to win the RSA factoring challenge. According to your reasoning,
> the trial-division algorithm is even *simpler*, but it is as slow as
> heck. The algorithm you posted (Pollard?) is only marginally better
> than trial-division, and unless I am mistaken, the algorithm is
> probablistic, meaning it is possible (but not likely) to never return.
> Do I need you to tell me that some factorization *ALGORITHMS* are
> simple? I did a whole research paper on it!!!

Interesting. I hope this research was better conducted that the way you
read (or not) his answer (Hint: for your information, this is really a
polynomial -time algrithm *on quantic computers*)

>

Relevant Pages

  • Re: Elementary group theory: Proof of Fermat-Maas primality-test (was: correcting Dik ...)
    ... the Fermat-Maas algorithm to prove it's really prime, ... the known factorization of p-1 that you got when you directly ... Back to the RSA page: ... So somebody buys 80 high-speed computers, ...
    (sci.math)
  • Re: Spectral Matrix Factorization via Wilson Method
    ... inner-outer factorization of a spectral density matrix, S, (where ... Factorization of Matricial Spectral Densities, ... algorithm does not quite converge on the correct solution. ...
    (comp.dsp)
  • Simple answer, surrogate factoring
    ... where M is the target to be factored, j is some non-zero natural ... Az is related to the factorization of T and M. ... So the full algorithm, which splits up A and x requires that you solve ... And then for at least one case, it must be true that the denominator ...
    (sci.math)
  • Simple answer, surrogate factoring
    ... where M is the target to be factored, j is some non-zero natural ... Az is related to the factorization of T and M. ... So the full algorithm, which splits up A and x requires that you solve ... And then for at least one case, it must be true that the denominator ...
    (sci.crypt)
  • Re: Surrogate factoring demonstrated
    ... > Will Twentyman wrote: ... >>or success wise? ... > Initial Factorization: ... be a sharp increase in factoring efficiency depending on what algorithm ...
    (sci.math)
Quantcast