Re: JSH: Finding k

rolf180@xxxxxxxxx wrote:
"rossum" <rossum48@xxxxxxxxxxxx> wrote in message news:rusrr3lf1ebiu85on58s30e6cmiafre84h@xxxxxxxxxx
On Thu, 21 Feb 2008 14:47:36 -0600, "local host" <Dorkus@xxxxxxxxxxxx>
wrote:

JSH is thinking of number 119 or less to factor, but RSA is that many digits
long.

I think JSH has made fundimental mistake,
he is only trying to factor very small numbers,
and you can look those upon the internet.
Since James is leery of factoring a real RSA sized number (>500 bits),
how about something smaller:

45 bits: 17008656535007
46 bits: 38535186426049
47 bits: 66224816531197
48 bits: 115976333497043
49 bits: 308526162022031
50 bits: 429386409732223
51 bits: 1340026057765453
52 bits: 3695249821766513
53 bits: 8115064944675869
54 bits: 11169459453931717
55 bits: 19302767134139309

All or these are square free and have two odd prime factors. They are
big enough to show up issues that factoring 119 (7 bits) might miss.

rossum


I think the best he could do now is a 3 or 4 digit number.
But he is way off track


I say 3 bits tops...


--
Posted via a free Usenet account from http://www.teranews.com

.

Relevant Pages

  • Re: Latest 4D tally as forecasted
    ... as this may not worthy to anymore to anyone as this from ... down to giving only one set of 4 digits for people to bet. ... then the crediblitly of you in your prediciton will hold. ... Posted via a free Usenet account from http://www.teranews.com ...
    (soc.culture.singapore)
  • Re: JSH: Finding k
    ... JSH wrote: ... being celebrated for making a major discovery. ... David Bernier ... Posted via a free Usenet account from http://www.teranews.com ...
    (sci.math)
Quantcast