SHA-1 encryption has been broken by a team of researchers; Xiaoyun Wang, Yiqun Lisa Yin, and Hongbo Yu, and apparently they have been shadily distributing their paper, but its not readily publicly available. They used hash collisions to break the encryption. I personally know calculus, differential equations, greens and stokes theorem, and linear albegra, but this type of math is still way over my head. From my limited understanding on this...hash collisions would be the only real way to actually crack the encryption (vs. bypass, or the work you have been doing..), and considering that it has already been done, then I suppose that makes it a viable solution. I don't know if a team of researchers from Shandong University in China would care enough about the android hacker community to share their findings... but I suppose anything is possible. If in fact they were willing to share this information, the function could be used in a powerful computational program such as Maple, Matlab, or Mathmatica, to generate the private keys... but I think you might need the public key..? Like I said...I really only have a surface-level understanding of whats involved.
The more practical but still highly unlikely method for getting the keys would be to get them from moto somehow... but the hacker community is too small for them to care.
We could all stand outside of moto headquaters and wait for the ceo to walk towards his car and then.... lol.
If you are interested in actually cracking it.. wish would be epic, and probably more likely than reverse engineering the radio baseband drivers (which seems to be the issue...right?), then hash collisions are the way to go, and those researchers are the ones with the knowledge on how to do it. I don't think they want to publicly distribute their work because SHA-1 encryption is still widely used and has been implemented as an industry standard since md5 encryption was broken.
I hope that helps, or provides some hope... I personally have a DX and would love it to be cracked.. I wish I had a better understanding of the math involved. Regardless... I really appreciate your determination and commitment to this project, thank you for all your hard work.
I will try and see if I can find some solid information on this... but I really think that those guys are the only ones with the info that relevant... that being, the actual solution. There are documented studies with hash collisions available.. but they don't have what you need. Those guys have the answer.
{{ WugFresh }}