SGN is a polymorphic binary encoder for offensive security purposes such as generating statically undetecable binary payloads. It uses a additive feedback loop to encode given binary instructions similar to LSFR. This project is the reimplementation of the original Shikata ga nai in golang with many improvements.
For offensive security community, the original implementation of shikata ga nai encoder is considered to be the best shellcode encoder(until now). But over the years security researchers found several pitfalls for statically detecing the encoder(related work FireEye article). The main motive for this project was to create a better encoder that encodes the given binary to the point it is identical with totally random data and not possible to detect the presence of a decoder. With the help of keystone assembler library following improvments are implemented.
- 64 bit support.
Finally properly encoded x64 shellcodes ! - New smaller decoder stub.
LFSR key reduced to 1 byte - Encoded stub with pseudo random schema.
Decoder stub is also encoded with a psudo random schema - No visible loop condition
Stub decodes itself WITHOUT using any loop conditions !! - Decoder stub obfuscation.
Random garbage instruction generator added with keystone - Safe register option.
Non of the registers are clobbered (optional preable, may reduce polimorphism)
You can get the pre-compiled binaries HERE. For building from source follow the steps bellow.
Dependencies:
The only dependency for building the source is the keystone engine, follow these instructions for installing the library. Once libkeystone is installed on the system, simply just go install it ツ
go install github.com/EgeBalci/sgn@latest
DOCKER INSTALL
docker pull egee/sgn
docker run -it egee/sgn
Usage
-h is pretty self explanatory use -v if you want to see what's going on behind the scenes ( ͡° ͜ʖ ͡°)_/¯
__ _ __ __ _
___ / / (_) /_____ _/ /____ _ ___ ____ _ ___ ___ _(_)
(_-</ _ \/ / '_/ _ `/ __/ _ `/ / _ `/ _ `/ / _ \/ _ `/ /
/___/_//_/_/_/\_\\_,_/\__/\_,_/ \_, /\_,_/ /_//_/\_,_/_/
========[Author:-Ege-Balcı-]====/___/=======v2.0.1=========
┻━┻ ︵ヽ(`Д´)ﾉ︵ ┻━┻ (ノ ゜Д゜)ノ ︵ 仕方がない
Usage: sgn
Flags:
-h, --help Show context-sensitive help.
-i, --input=STRING Input binary path
-o, --out=STRING Encoded output binary name
-a, --arch=64 Binary architecture (32/64)
-c, --enc=1 Number of times to encode the binary (increases overall size)
-M, --max=50 Maximum number of bytes for decoder obfuscation
--plain Do not encode the decoder stub
--ascii Generates a full ASCI printable payload (may take very long time to bruteforce)
-S, --safe Preserve all register values (a.k.a. no clobber)
--badchars=STRING Don't use specified bad characters given in hex format (\x00\x01\x02...)
-v, --verbose Verbose mode
--version
Docker Usage
docker run -it -v /tmp/:/tmp/ sgn -i /tmp/shellcode
Warning !! SGN package is still under development for better performance and several improvements. Most of the functions are subject to change.
package main
import (
"encoding/hex"
"fmt"
"io/ioutil"
sgn "github.com/egebalci/sgn/pkg"
)
func main() {
// First open some file
file, err := os.ReadFile("myfile.bin")
if err != nil { // check error
fmt.Println(err)
return
}
// Create a new SGN encoder
encoder, err := sgn.NewEncoder(64)
if err != nil {
fmt.Println(err)
return
}
// Set the proper architecture
encoder.SetArchitecture(64)
// Encode the binary
encodedBinary, err := encoder.Encode(file)
if err != nil {
fmt.Println(err)
return
}
// Print out the hex dump of the encoded binary
fmt.Println(hex.Dump(encodedBinary))
}
The following image is a basic workflow diagram for the encoder. But keep in mind that the sizes, locations and orders will change for garbage instructions, decoders and schema decoders on each iteration.
LFSR itself is pretty powerful in terms of probability space. For even more polimorphism garbage instructions are appended at the begining of the unencoded raw payload. Below image shows the the companion matrix of the characteristic polynomial of the LFSR and denoting the seed as a column vector, the state of the register in Fibonacci configuration after k steps.
Considering the probability space of this encoder I personally don't think that any rule based static detection mechanism can detect the binaries that are encoded with SGN. In fact I am willing to give out the donation money for this project as a symbolic prize if anyone can write a YARA rule that can detect every encoded output. Check out HERE for the guidelines and rules for claiming the donation money.
If you tried and failed please consider donating [̲̅$̲̅(̲̅ ͡° ͜ʖ ͡°̲̅)̲̅$̲̅]