0 Members and 4 Guests are viewing this topic.
Probably around the same. Of course, an extremely similar file would be much easier to compute than an extremely difficult one, and if we made the boot2 simply accept our own OS's key (which could be an extremely close semiprime number, but one we know the factors of ) it would boot the OS just fine, since it would operate the same from there on.
So, could we attack boot2 by writing our own code, and appending more data to the end until we find something with the same hash as boot2?
However, if (and this is a big if) someone discovered a way to reliably make collisions in SHA-256, then we could conceivably launch a successful birthday attack in reasonable time using Chabaud-Joux techniques (basically testing weak versions of the hash until you have an algorithm that can short circuit the real one) that would theoretically allow us to install another OS.
I'd like to know, how much work is it brute forcing a collision say, compared to factoring a 512 bit key?
Also, I found this: http://eprint.iacr.org/2004/304.pdf, which has an algorithm to reduce the number of steps before a collision occurs.
How the collision attack will help us?
Quote from: calcforth on November 15, 2010, 04:07:53 pmHow the collision attack will help us?Because they let you use your own file instead of the original message without changing the hash.
As I said, it would only allow the theoretical possibility of installing an OS. In practice, it would be next to useless.
However, if we could generate an OS with the same Hash as the current OS (a collision), then we could install that OS and the boot code wouldn't realize it. The problem is that any collision is likely to be complete gibberish codewise.