theoretical question on wm-drm

[mousemurder]

hi, i'm at work with some time to kill...

i am wondering if it is possible to brute-force a sid ?

i think it is a 20-byte value:
8^20 = 1,152,921,504,606,846,976 (1 quinttillion)

assuming 1 per second it would take 36 billion years to get thru all combinations.

could a fast computer try more keys per second than that ?
how would we know if the attempted key is wrong; is human intervention necessary to know that the resulting file is unplayable. in that case it would be more like trying 1 key every minute or 2 trillion years.

thoughts ? ...

[mousemurder]

sorry my logic is a little wrong
2^(20 * 8) = 1.46 x 10^48 seconds equals about 4.63 x 10^40 years.

how many sid's can we try a second ?

[gioowe]

Don't bother.

Even if one sid per cpu-clock on an octa-core (10 GHz, 8 cores) you can only calculate 80 billion. (80 x 10^9)

You even then need 578.750.000.000.000.000.000.000.000.000 years. In 4.500.000.000 our sun goes crazy.

If you use 1000 billion of such crazy-machines you still need 578.750.000.000.000.000 years. That's 200 machines per human on earth.

[KenD00]

This time is needed to search the whole keyspace, but you will find a valid sid a bit sooner, depending on the population of the keyspace. So you need some billion years less ;).

:rolleyes: