Lempel-Ziv Jaccard Distance, an Effective Alternative to Ssdeep and Sdhash

August 10, 2017 Β· Declared Dead Β· πŸ› Digital Investigation. The International Journal of Digital Forensics and Incident Response

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Edward Raff, Charles K. Nicholas arXiv ID 1708.03346 Category cs.CR: Cryptography & Security Citations 43 Venue Digital Investigation. The International Journal of Digital Forensics and Incident Response Last Checked 6 months ago
Abstract
Recent work has proposed the Lempel-Ziv Jaccard Distance (LZJD) as a method to measure the similarity between binary byte sequences for malware classification. We propose and test LZJD's effectiveness as a similarity digest hash for digital forensics. To do so we develop a high performance Java implementation with the same command-line arguments as sdhash, making it easy to integrate into existing workflows. Our testing shows that LZJD is effective for this task, and significantly outperforms sdhash and ssdeep in its ability to match related file fragments and files corrupted with random noise. In addition, LZJD is up to 60x faster than sdhash at comparison time.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Cryptography & Security

Died the same way β€” πŸ‘» Ghosted