Re: Factoring RSA type prime products

On Jan 27, 8: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.
I think people will take you seriously as soon as you do it, if indeed
your factorisation turn out to have timings that is not exponential.

JT

I'm still doing basic research, so what you see is what you get in
that the mathematics that I'm presenting is it.

There are two stages: theory, and implementation.

I'm in the theory stage, but can still state a solution to the
factoring problem based on mathematical proof.

So the challenge to that is to find that I don't have a mathematical
proof, so there is room for continued discussion without
implementation.

That is important to me for several reasons, as I know that I can
think I have a mathematical proof and be wrong, as I've done that
before, but if I do have a mathematical proof then implementation must
follow proof.

It can be frustrating to someone who just wants to SEE something work,
but it's a better way to proceed.

I can state a solution to the problem based on theory, just like, say
quantum cryptography could be stated as a solution on theory, when
there still to date is no quantum cryptographic factoring of an RSA
number to my knowledge.

But the difference here is that my proof is far simpler, with
mathematics that is very easy in comparison to other mathematics in
this area or most of modern mathematics, and I'm willing to argue out
the details with the fear that I might be wrong.


James Harris
.

Relevant Pages

  • Re: JSH: Step by step through the factoring algorithm
    ... It's one reason I'm less enthralled with the factoring research as I ... Yeah, I knew he had to be wrong, from the mathematical proof. ... It's why people who value mathematics say that proof is more important ... To the math, it's not about factoring D, as the math doesn't care. ...
    (sci.math)
  • JSH: Understanding the double bind
    ... There is overwhelming evidence that the research I have now should be ... where the best evidence is the mathematical proof ... that I found relatively simple mathematics that ends the viability of ... where the reason the system can be ...
    (sci.crypt)
  • Re: A Long Hard Dispassionate Look at Contemporary Cryptography. - adacrypt
    ... cryptography started to blow when the RSA team opted for extraordinary ... mathematics that I am going to call 'black' mathematics (as in black ... Please immediately patent your technique! ...
    (sci.crypt)
  • Re: Help. What is a model?
    ... A mathematical theorem is a mathematical statement ... mathematical proof has been given. ... mathematics to tell ... two problematic notions: mathematical statement, ...
    (sci.math)
  • Re: Job Finished - Adacrypt
    ... the mathematics of the RSA cipher and are able to make a side by side ... So that we can understand the total magnificence of your work and dispel any doubts of your genius, please show that you understand how RSA works. ... Did you know that if someone loads your web page every element on it creates a hit? ... For a practical mathematician such as yourself please do the rsa "challenge" just to humour the good and mock the rest of the "self proclaimed experts of sci-crypt". ...
    (sci.crypt)