Hashing of Graphical data

From: Acidus (acidus_at_yak.net)
Date: 03/27/04


Date: Sat, 27 Mar 2004 14:42:24 -0500

Folks,

I'm doing some work investigating a rather popular piece of spy
software, and could use a little advice. It uses zlib's deflate
algorithm to reduce the size of the screenshot's it takes, before
storing them unencrypted. To save more room , the program divides the
screen into 16 pieces and will only store the parts that change (like
mpeg). Further, for each screenshot piece it does need to store, the
program generates a hash from the graphical data and keeps a list of all
previous hashes I have not yet detrimined how long the sliding window is
of previous hashes, but its pretty long. When a new picture piece needs
to be written, if its hash is in the sliding window, and thus already
written to the data file, it simply writes a pointer to the previous entry.

The hash is only 32 bits. Seeing as the company used a free open
compression library, I figured this hash/checksum would be a standard as
well. However the hash doesn't seem to be CRC32, IP Checksum, Alder
Checksum. Its possible they are using a different generating polynomial,
since the only polynomials are designed for error-checking. Can anyone
give me any pointers as to what it might be? Are there any other
standard 32 bit checksums or hashes out there? How would a polynomial to
craft hashes of graphical data be different that a polynomial for
catching errors?

Thanks in advance for any info



Relevant Pages

  • Re: People ~Fing with Life
    ... That is what the charge was. ... hash values and the like'. ... this data area had no corresponding entry in the allocation tables. ... Hashes are used for the purposes of error correction ...
    (uk.legal)
  • RE: [7.8.2002 44916] Notice of Copyright Infringement]
    ... Appending a single bit onto the end of the file makes a different hash. ... and you no longer match the hashes. ... The only way to prove you're breaking copyright is to download at ... |"real" warezed version of whatever movie. ...
    (Vuln-Dev)
  • Re: ACCEPT and the SCREEN SECTION.
    ... General-purpose hashes, for hash tables and similar data structures, ... In short, cryptographic hashes like MD5 are used to verify data, ... if a client asks for and receives a chunk ...
    (comp.lang.cobol)
  • Re: what is probability to create two equal hashes for md5 algorithm
    ... Other than that, if the hash is statistically good, the longer the hash, the ... few cases the hashes match. ... md5 and crc32)? ... How much does it cost to compare two hashes? ...
    (sci.crypt)
  • Re: Parsing problem
    ... > I get into hashes I get a headache. ... First off a 'hash' is simply an 'associative array'. ... They are in turn a reference to a hash. ... a punchcard column formated cobol wingDingDingDing style ...
    (perl.beginners)

Loading