Re: Factoring RSA type prime products

On Jan 27, 10:58�am, jonas.thornv...@xxxxxxxxxxx wrote:
On 27 Jan, 17:42, JSH <jst...@xxxxxxxxx> wrote:





On Jan 27, 8:31 am, jonas.thornv...@xxxxxxxxxxx wrote:

Hello James it would be nice if you gave us the timings, for your code
and algorithm using binaries from 1-50 digits. Of course prime
products of RSA type "two primes".

So we could plot out a curve and estimate how efficient both algorithm
and your algebra solution for the prime problem actually would be on a
number of RSA size.

I am no math head and i don't want to start repeat my high school
algebra all over *again*

Best regards Jonas T

I'm the theoretician here, but I wouldn't worry about thinking that
request will go unanswered.

With time I'm sure someone out there will do it (if they haven't done
so already).

Of course, they may not just post their results!

James Harris

I do not ask you to publish or reveal your code only the timings for
different binary digit sizes.

Code? JSH got no code. He don't have to show you
no stinkin' code!

I think people will take you seriously as soon as you do it,

Just fell off the turnip truck, eh?

if indeed
your factorisation turn out to have timings that is not exponential.

Here's a hint: JSH doesn't write code anymore, not
since he moved from Atlanta. Not that his code was
any better than his math. For example, here's how
one of the last programs he posted behaved when
tasked with factoring all the 6-digit composite
numbers of two 3-digit primes.

<http://members.aol.com/mensanator/JSH/JSH_results.htm>

Now, of course, he's got new ideas, but he's not
demonstrated yet that he knows how to program and
thus, will NEVER be able to test his ideas let alone
factor RSA sized problems.


JT

.

Relevant Pages

  • Re: Factoring RSA type prime products
    ... and algorithm using binaries from 1-50 digits. ... Of course prime ... products of RSA type "two primes". ... and your algebra solution for the prime problem actually would be on a ...
    (sci.math)
  • Re: Secure permutation of a 1e8 element set
    ... RSA would be fine, but very slow, wouldn't it? ... Additionaly I could permute the digits. ... you map to within the nearest higher power of two using bit twiddling, ... A arbitary permutation of 1e8 numbers is equivelent to a key size ...
    (sci.crypt)
  • Re: Secure permutation of a 1e8 element set
    ... would choose RSA, it won't be secure, but limiting the range arbitrarily is ... just use the original RSA algorithm. ... Of course if there are numbers consisting of more digits, ... Do you reallywant to use 10 different ...
    (sci.crypt)
  • Re: Can a certain determination be made on a large composite such as rsa2048?
    ... Sorry if I explained it wrong but I know the RSA ... from people that are sending me composites now. ... up to 3 digits shorter than the largest factor. ... Progess in Computer Science & Applied>Logic Volume ...
    (sci.math)
  • Binary number digits <- > Decimal number digits
    ... A friend told me something about the RSA Challenge. ... prizes and records (http://en.wikipedia.org/wiki/ ... starting from the number of digits of the decimal number? ... what calculus was made to arrive that a decimal number of ...
    (sci.math)
Loading