Total Posts
General Information
  • Last Activity: 19th September 2017 01:53 PM
  • Last Login: 1st January 1970 01:00 AM
  • Join Date: 1st February 2010
  • Referrals: 0

Most Thanked

Post Summary
I'm sure most of you know the previous thread about this topic, but it died pretty fast.. I spent the last few weeks on developing a boinc project to bruteforce the RSA key Motorola uses to sign the boot and recovery partitions on the Motorola ...
I created a little tutorial i wanted to share here: I hope some people will find it helpful!
For sure we won't release worker source code. This is intellectual property created by Sesef made using his mathematic knowledge and experience. He doesn't want to public it. Optimalization has been explained some time ago:
I'm a HTC user (Been using the Magic and now the Desire HD), so excuse me for my dumb question, but: - There is plenty of roms for the motorola, what will be the improvment to crack the RSA Key ? (Better Bootload ?) Currently it is not possibl...
i thought about the order of the workunits for a long time, but the probability always stays the same, because possible solutions (prime numbers) are more or less uniformly distributed over the whole interval.. if we split forces and start from th...