> Dustbin Cook wrote:
>> BugHunter uses a proprietary checksum algorithm that I developed over 14
>> years ago.
>
> You developed ey? Something cobbled
> together more like.
>
>> In an effort to reduce scantime, BugHunter scans files ONLY
>> if they have a known filelength; IE: Known to BugHunter as potentially
>> being malicious. Once BugHunter takes a scan of the suspect file, it
>> gets two 32bit numbers in a specific order. If the numbers match the
>> record as well as the filelength in the correct order, BugHunter
>> considers it a valid match and looks the information up to give it a
>> more descriptive name, of course that depends on the record having a
>> matching description in one of the buginfo files.
>>
>
> Hmmm, it's a bit lacking on details of
> how this "algorithm" works. Can we see
> the mathematical analysis for this
> whacked up bit of cobble code? Was is
> published in a well known academic
> journal for a rigorous critique by
> crytographers or computer scientists?
>
>
>
>>
>> I hope this will help with any qu estions you may have about what
>> BugHunter is, and what it is not. If you have any questions, I will
>> monitor this thread; you may respond here or in email.
>>
>> Thanks for reading!
>
> If you aren't going to provide more
> description or code for this "algorithm"
> then I'd suggest anyone interested in
> how checksummers work could pick up
> several undergradute books on data
> communication theory or cryptography.
> Rather than wasting their time with
> homemade crap whacked together in
> dead of night by an bASIC wizard in his
> Harry Potter themed "dungeon".
>
> Lookup authors like William Stallings,
> Andrew Tanenbaum. Read back issues
> of Bruce Schneier's "Crypto-Gram"
> newsletter for advice to wanna-be
> proprietary algorithm developers. )
>
>
> 4Q

thanks Dustin
I just LOVE that prog, as do many others.