Digital Forensics Framework (DFF) is a discontinued computer forensicsopen-source software package. It is used by professionals and non-experts to collect, preserve and reveal digital evidence without compromising systems and data.[2]
Digital Forensics Framework offers a graphical user interface (GUI) developed in PyQt and a classical tree view. Features such as recursive view, tagging, live search and bookmarking are available. Its command line interface allows the user to remotely perform digital investigation. It comes with common shell functions such as completion, task management, globing and keyboard shortcuts. DFF can run batch scripts at startup to automate repetitive tasks. Advanced users and developers can use DFF directly from a Python interpreter to script their investigation.
"Scriptez vos analyses forensiques avec Python et DFF" in the French magazine MISC[8]
Several presentations about DFF in conferences: "Digital Forensics Framework" at ESGI Security Day[9] "An introduction to digital forensics" at RMLL 2013[10]
Published books that mention Digital Forensics Framework are:
Digital Forensics with Open Source Tools (Syngress, 2011)[11]
DFF was used to solve the 2010 Digital Forensic Research Workshop (DFRWS) challenge consisting of the reconstructing a physical dump of a NAND flash memory.[24]
^Stuttgen, Johannes; Dewald, Andreas; Freiling, Felix C. (2013-03-14). "Selective Imaging Revisited". 2013 Seventh International Conference on IT Security Incident Management and IT Forensics. IEEE. pp. 45–58. doi:10.1109/IMF.2013.16. ISBN978-1-4673-6307-5. S2CID17356972.
^Eijkhoudt, Arnim; Suerink, Tristan (2013). "Uforia: Universal forensic indexer and analyzer". Journal of Computer Virology and Hacking Techniques. 9 (2): 59–63. doi:10.1007/s11416-013-0177-4. S2CID29814904.
^Vomel, Stefan; Lenz, Hermann (2013-03-14). "Visualizing Indicators of Rootkit Infections in Memory Forensics". 2013 Seventh International Conference on IT Security Incident Management and IT Forensics. IEEE. pp. 122–139. doi:10.1109/IMF.2013.12. ISBN978-1-4673-6307-5. S2CID11765652.