by digitaloperatives | Jun 23, 2016 | Research

What does a cult Brezhnev-era movie have to do with how exploit code finds its bearings in a Windows processâ€™ address space? How can cryptographically insecure hashing functions be exploited to create honeypots that thwart shellcode? We researched this as a part of our Halting Attacks Via Obstructing Configurations project, funded by DARPA Cyber Fast Track. You can read about it in the International Journal of PoC||GTFO, issue 0x12.

by digitaloperatives | Feb 23, 2015 | Capture the Flag

We began with no hint, and the file ‘cloudfs-31c938df3531611b82fddf0685784a2b67373305ec689015f193a555b756beb2’. The command file tells us that it is compressed data. $ file cloudfs-31c938df3531611b82fddf0685784a2b67373305ec689015f193a555b756beb2...
by digitaloperatives | Sep 25, 2014 | Research

Just wanted to post a quick alternative of Metasploit’s VMWare Fusion CVE-2014-6271 exploit ( `metasploit-framework / modules / exploits / osx / local / vmware_bash_function_root.rb`

) for local shell use.

by digitaloperatives | Sep 22, 2014 | Capture the Flag

The annual NYU Polytechnic School of Engineering Cyber Security Awareness Week (CSAW) Capture The Flag (CTF) competition online qualifiers were held September 19-21, 2014. This is a writeup of one of the Exploitation challenges we solved: "saturn". The...
by digitaloperatives | Feb 13, 2014 | Research

There is a subfield of computer science known as *approximation algorithms* whose goal is to find algorithms that can quickly find solutions that are not necessarily optimal, but are within some known bound of optimal. Under very reasonable assumptions, the expected value for the constant of approximation of a randomly selected feasible solution is almost always going to **at most** two. We present some empirical evidence suggesting that the random solutions are often even closer to optimal than ones produced by state-of-the-art approximation algorithms. Sometimes quickly and mindlessly choosing a random solution isn’t half bad!