[XPERIA X10 Android Development] Chillaxed:
OK, so it has been said many many times before, that maybe obtaining the 1024 character long RSA key to be able to act like sony and do whatever we want to do to the phone.

Now that there has been some success cracking the PS3 through a fairly complex bruteforce algorithm, people are having some hope on the x10.

The devs have said many times it's not that simple, but it's always on the back of everyone's mind.

So what do you guys want to do about it? Prove the devs right? or prove them wrong? i'm not exactly a dev myself, but i know exactly what's going on, and i know how the phone works (i studied networking in college for a few years and also did computer science before i decided to become an auto mechanic, all through high school, and of course alot of googling and cracking my own stuff. i still have a fond interest in this stuff)

there was a guy who said he could write a program for this. and i'm sure a few people could get working on this too. it might not work, but while the real devs are hard at work, why not dedicate some cpu time overnight to maybe successfully get that 1024 character RSA key?

here's what we know.

the RSA key is 1024 characters long. a random number bruteforce means there are 1267650600228229401496703205376 combinations of numbers. if it's a HEX key, multiply that by 1.6 and thats how many combinations there are.

however, RSA keys are generated through the following formula, there is something called Open SSL that can generate 1024 bit RSA keys. and open source means we can turn this into a tool for what we want to do, if it isn't already.

the RSA algorithm itself:

http://www.di-mgt.com.au/rsa_alg.html

Open SSL:

http://en.wikibooks.org/wiki/Transwiki:Generate_a_keypair_using_OpenSSL

so, any takers?

Update:

raw buteforce is impossible after some research. however, there will have to be multiple programs written for this task, once the first program is written and does it job, write a new program to reference the data that the old program gave you. (assuming everyone wants to try and get some devs in on it.)

1. a 1024 bit key if it is only numbers will be 309 characters long. i referenced this chart :http://en.wikipedia.org/wiki/Password_strength#Password_strength_depends_on_symbol_set_and_length

2. write a program that calculates every single prime number up to 999999.....etc up to 309 characters long, and only store those numbers somewhere.

3. use distributed computing to ONLY use those calculated prime numbers that were calculated to start multiplying prime numbers by eachother.

4. discard any numbers that add up to a number that is less or more than 309 characters long. this eliminates the program asking if a password that isn't even the right length if it is right or not.

5. only test those 309 digit keys that were calculated from the data given from the last two steps on the bootloader. this eliminates every possibility of a truly random number that is that length.

the "309" changes if it's not just numbers, if it is alphanumeric its 199 digits, if it is all letters its 218 digits (just look at the chart)

does this seem viable? it definitely would speed things up quite a bit no?