yeah, you'll find a lot of things replace parentheses with brackets. Same with matrixes (I think that was my first thread on here )

Actually, technically the nspire is just that: a common netbook-style processor (granted, a fairly weak one)

If they wanted the nspire to be some fancy handheld computer, they could do it with one OS release. The OS currently used on the nspire is one made for mininetbooks anyways, so it would take minimal effort.


Better yet, fb39, get an army of 81s with all their keypads hacked to talk to each other, and crack it.


Edit: Oh, btw I'm leaving on another trip, won't be back until tuesday night. Sorry!


I was thinking: if we used ndless, could we ever access the area of the memory to change the factor required? We could make our own rsa key and replace ti's (making a key takes like 3 seconds)

Well, this way the server can send new numbers faster. If it doesn't recieve one set within x min/hrs of sending, it resets it to open.

Well, every bit you add doubles the difficulty, so 1024 is 2^256 harder than 768. That's a lot more than 1000. Not very easy at all.....

I was thinking, if you assign computers to do so many numbers, randomly within a certain bit range, it might go faster, so:

(increments of 40 example)
Server:
0-40 Unsolved
41-80 Solved, no answer
81-120 In process by 12.60.2.255
121-160 Unsolved

When a computer finishes its portion, it receives a random other portion to solve. Hopefully, several computers doing this all at the same time should hopefully hit the solution eventually, and the server sends the message to all the rest, spreading the key instantly to (hopefully) thousands of people!

By a fermat attack, are you referring to http://en.wikipedia.org/wiki/Fermat%27s_factorization_method?

I'd be willing to write it if I knew how a little better. Unfortunately, my best programming language is still TI-Basic I have lots of time on my hands for this kind of thing.

Yes, I know 40 numbers is nothing. It was just an example. It would probably be maybe 30-minute segments, not too long or they get interrupted before they finish when you turn off your computer.

brute forcing the key doesn't require much memory. Check that perl script's memory usage, and it's slim to none. But yes, the virus portion was a bad idea.


I had one other idea: Where exactly is this code stored? Is there any way we could replace it with a different key, that we know? That way, you couldn't have the nspire OS (which sucks anyways ) but you could have another OS, maybe similar to KnightOS, or moonshell (flashcart menu for DS) based.

Edit: repitition fix. Sorry about that.

Just think: a virus that infects a computer, completes some rsa factoring, sends results to a server as it does (so as not to duplicate work), and spreads to some more hosts. Nobody notices it's there since it has a low processor priority, and we get the nspire keycode super fast! (well, not super fast, but you get the idea)

Like it?

Yeah, Silver, I know how you feel! I can't wait for ndless 2.0!

I feel so lucky now. My math teacher cleared the ram once on a test we did, since it was a regulated test, but never does it otherwise. Once, I let him reset my ram with my 84+ pad in, then switched to my nspire pad with all my progs

It rocks and sucks at the same time to live in the country.

I think I have a few. You might already have them though.

Nspire ARM Asm Support
OS Signing
Open Source (Eventually, I hope that I will be able to run this on other devices)

Good Luck! I really like the idea of an IDE where I don't have to worry so much about setting it up correctly.