any info on RSA factoring challenge?

[esung]

Does anyone know the status of the numbers that RSA put up long time ago for factoring? from 100 digits to 500 digits long? Anyone know how many of them has been factored?

Thanx

 

[Sukhoi]

Can I do this kind of factoring on my TI-89?

 

[ViRGE]

When it comes to teachers, ignornace is bliss.

 

[Sukhoi]

ViRGE, do I sense you have a TI-89?

 

[ViRGE]

Possibly.

 

[Ken g6]

I don't see that anything above RSA-130 has been cracked. Here's the page on that achievement.

Maybe when D.Net is done with this round of RC5, they'll move to RSA. It looks very promising for distributed computing. Especially since,
<< It is likely that slightly more sieving (and therefore more partials) would have led to substantially smaller (and easier) matrix and square root problems. >>

 

[esung]

Thanx. the last one I heard is RSA-129.. the problem with factoring number is to write a good client, that's been optimized fully, otherwise it'll take loads of CPU and memory.. evne with Number Field Sieve. I think NFS is faster at factoring large number, while Quaratic Sieve is faster at smaller number though.

 

[Sukhoi]

ViRGE, do you know of any C++ compilers for the TI-89? I've found a C compiler, but I don't know the syntax differences between C++ and C, so I can't use a C compiler.

 

[ViRGE]

Sorry Sukhoi, but the TI-89 doesn't support C languages natively. Instead, it supports TI-BASIC, and assembly(to which TI has a dev kit for).

 

[Sukhoi]

Ah. But how does the C compiler work? Does it just convert to assembly instead of machine code?

 

[ViRGE]

Yes, that's what all compilers do inheriently. As for that C compiler, I don't keep up too muhc in the TI world; so since I was wrong the first time, I'm not too sure about the C++ thing now either.

 

[Sukhoi]

Oh well, thanks for the info.