I found DropBox very useful to backup online your project.
You have 2GB free and you can get more after following some tasks and inviting people.
This a tip more assembly or C calculator related, web development and other things. But you can also send from your calculator to computer and them put into DropBox.

For TI-BASIC you can also use SourceCoder2 in cemetech.

I noted the new smilies, but who doesn't? They attract attention.

Start to give them good use.

I knew the feature would come. Too bad it isn't for this year POTY because passed 1st December. :'(

IT HAD to be featured anyway. <- Almost exaggerating there. *runs*

TI only needed to generate a few primes, though, to make the key. Their job was relatively easy.

I know just a few primes are needed. (and with certain cares for vulnerabilities like some numbers allow to decrypt by encrypting the message over and over some n times)
I think you did not get to the point. I guess I was guessing bad. xD If we knew the method they used to generate the primes, we could come with a narrower list of primes to try factor the secret key. In the particular case of Nspire, this idea is almost certainly useless.
But there was one case they managed to factor a RSA 1024 this way, probably incomparable to the case of Nspire.

The final release has some cool screenies I did not see.
Ticalc definitely will feature it.

I use WikiTI a ton when working on z80 calcs.  A lot of KnightOS comes from WikiTI.

I saw the threads of documentation on programming OSes for z80 and I started the topic in WikiTI. It makes sense to unite everything now in there.
Do you mind to heavily rely on code you posted on forums? I ask mainly for having complete peace of mind but I know you posted for others to use, so it is not an issue in principle. As always I fully acknowledge work of others.
Here's the link http://wikiti.brandonw.net/index.php?title=Programming_an_OS_for_z80_calculators

It is very well hosted under brandonw domain.

I am wondering if this wiki could explain the drastic increase in ASM program quality over the last few years? It has been around for 4 years, but back then it often got hacked or spammed by bots so people avoided it. Now it's solved and it seems to get more popular.

I have no idea how much people visit WikiTI except the regulars in the community that visit it occasionally to see updates and update links to their projects.
But I have seen a programmer to create an account in WikiTI for starting develop for a z80.

When I saw a lot of changes in wiki I started to contribute again too recently. I hope it continues.
I can write something if it is on my reach if you request it and even better add ideas to http://wikiti.brandonw.net/index.php?title=To_Do_List .

EDIT: don't forget Hackspire is already a good wiki about Nspire. (it has ports documented, some hardware)

Hmm what stuff does it sort in particular? Or is it an all-purpose sorting routine?

It sorts a list of 1 byte numbers only from the least to the greatest.
The author made just because of the challenge and "beauty" for z80 code. It is quicksort (a great algorithm by the way) in old z80.
It is not general purpose.
For curiosity a general purpose would use a passed subroutine (callback it) that compares 2 elements and tells if they are in correct order or not and specify the length of each element.

Talking of sorting algorithms, I know a implementation of heap sort (sigma's code, the author of z80 in 28 days) but it is not as small as this quicksort one.
Sigma's code is for much more generic use unlike this one that sorts 1 byte numbers only from the least to the greatest. Here it is the link.
Heap sort is the competitor of quicksort for generic sorting algorithms.
Plus I remember this topic in MC forums where the smallest z80 sorting routine is a kind of bubblesort.

So this topic is now a complete reference of z80 sorting code.
I shall update WikiTI as well sometime in the future.