- it appears that the RSA challenge is no longer open. is this true?

-alex

Mark Underwood wrote:>

--

> --- In primenumbers@yahoogroups.com

> <mailto:primenumbers%40yahoogroups.com>, Kermit Rose <kermit@...> wrote:

> >

> >

> > I am working on programming this algorithm in python.

> >

> > I expect to be able to prove that this algorithm works and is a

> >

> > polynomial time algorithm by factoring

> > the RSA challenge large integers.

> >

> > Detailed illustration of polynomial time factoring algorithm

> >

> > Factoring z = 105 = 3 * 5 * 7 by polynomial time factoring

> >

> > algorithm.

> >

>

> Good luck Kermit. At least, the proof will be in the pudding. I hope

> you are rewarded for your work.

>

> I found out about python when I was exploring ways to get gp pari

> working on my mac. It turns out there is a free new program called

> 'sage' which is primarily based on python, and it gathers several

> math programs out there under its umbrella, including gp pari.

>

> Mark

>

>

>

alex petty

alexander.petty@...

skype: alex.petty

skypein: +001.540.322.3922

mobile: +001.540.272.7970

[Non-text portions of this message have been removed] - --- On Tue, 1/6/09, Alex Petty <alexander.petty@...> wrote:
> it appears that the RSA challenge is no longer open. is this

Given that that's a stand-alone question, why did you not trim the couple of dozens of lines of cruft that followed it and was no longer required for context?

> true?

Anyway, to answer your question, yup, the beancounters finally pushed the final academic out of RSA, and decided that such challenges didn't look good on the balance sheet.

Phil