This Demonstration presents some results of using modified cellular automata to generate fingerprints of electronic documents based on their contents. It uses the binary data of the document as the initial condition. The result of the computation is a fingerprint of the document, which can have 128, 256, or 512 bits. This Demonstration evaluates the performance of different compression techniques on different file sizes and of generating different hash sizes compared with common hash algorithms. The timing axis on the graphic is plotted with a logarithmic scale.

Each test measures the time to process each compression technique, which is compared with common hash functions (MD5, SHA), with different hash sizes (128, 256 and 512 bits).