![]() |
|
|
|
#1
|
|||
|
|||
|
20 hours? Are you sure your algorithm (or the random generator) is correct?
Long time ago, I wrote a bruteforcer for CRC32 (even before I calculated how to compute it directly ) - and on Pentium 3 1.5 GHz is takes slighly over a minute to check the 2^32 possibilities.It generates binary data (not just "numbers and letters")... but a simple algorithm that tries random texts should be about the same, i.e. getting the result in about half a time (in average). |
![]() |
| Thread Tools | |
| Display Modes | |
|
|
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| CRC32 TOOLS + src | CodeCracker | Community Tools | 6 | 04-16-2024 21:59 |
| crc32 help needed? | The Day Walker! | General Discussion | 5 | 01-16-2006 14:53 |