[go: up one dir, main page]

Skip to content

A direct Yara/Ghidra integration, finally YARA for Ghidra without the suck!

License

Notifications You must be signed in to change notification settings

subreption/ghidra_yara

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

37 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

GhidraYara

A direct Yara/Ghidra integration, finally YARA for Ghidra without the suck!

Build

Screenshot Screenshot

Introduction

This is an extension providing an Analyzer for Ghidra integrating the YARA engine (via yara-java bindings) directly in the analysis process, as well as YARA generation and management capabilities throughout the Ghidra toolkit.

Until now, Ghidra users interested in leveraging YARA signature detection needed to resort to scripting or out-of-band solutions. With this extension, the entire process can be configured per-program and executed within the existent analysis workflow, automatically or manually, making the YARA engine a first-class citizen in the process. The same approach is applied for rule generation and testing.

This extension is still in development. It is fully functional, but should be considered experimental.

Highlights

Scanning (signature matching)

Screenshot

  • Can operate in monolithic or block-based scanning mode: the former loads the entirety of the program in contiguous memory (coalescing the initialized memory blocks), while the latter will iterate through each block independently.
  • High performance: typical sub-second completion times even with dozens of thousands of non-optimized rules loaded.
  • Can load external user-provided rules, refreshed each time the analyzer is tasked.
  • Provides excellent detection capabilities for:
    • Algorithmic (ex. CRC) and cryptographic constants using a modernized version of the signsrch ruleset, among others.
    • Packers (via rules translated from PEID and other sources).
  • Fully integrated in the analysis workflow.
  • Automatic labeling and creation (avoiding conflicts) of data types matching the exact size of the detected signature.
    • For example, CRC lookup tables can be fully recovered, labeled and typed correctly.

Rule generation and testing

Screenshot

  • Rules can be generated from code or data selections, directly through contextual actions.
  • Management of rules can be done with real-time updates in an integrated table.
  • Rules can be exported to the file-system.
  • Individual selection for all operations, including verification.

Planned features and work in progress

Currently the following features are work-in-progress or planned for future inclusion:

  • Integrated save/restore functionality with the ProgramDB for generated rules.
  • Intra-program rule verification and matching.
  • Advanced rule generation using biclustering.
    • Based off the work from Edward Raff, Richard Zak, Gary Lopez Munoz, et al. ("Automatic Yara Rule Generation Using Biclustering", https://arxiv.org/abs/2009.03779)

Curated rule sets

TL;DR: Let the disassembler and decompiler do what they do best, and let the YARA engine do what it does best.

Currently, we provide a limited set of rules, documented in the data/rules directory. Some of these have been modified to eliminate false positives and otherwise irrelevant rules that, in our experience, are not particularly useful in a reverse engineering context.

The importance of minimizing or crafting rules carefully cannot be overstated: typically, the use case for YARA inside a tool like a Ghidra will be matching constants, such as those belonging to cryptographic suites, or algorithms related to error correction, lookup tables, encoding, etc. Function detection, for example, is best left to other Ghidra components to deal with (such as the FID engine). For example, YARA rules intended to match strings related to "antivm" or "antidebug", as found in many public repositories, are practically useless, and usually create conflicts. This also applies to rules attempting to detect compiler toolchains (as opposed to, say, packers).

Examples of good targets for rules to use with Ghidra:

  • URLs, API tokens, and other potential secrets.
  • S-Boxes, initialization vectors and constants, multiplication constants.
  • Error correction tables.
  • Codec-specific tables, transformations, etc.
  • Telltale marks from known APT samples and their components, including variants of known ciphers.
  • Shellcode stages.
  • Packet and network protocol headers that could be used as part of covert channels or C2 routines.

Reporting bugs

Please file an issue, or even better, provide a tested and documented PR. :-)

Licensing

   Copyright (c) 2024 Subreption LLC. All rights reserved.

   Licensed under the Apache License, Version 2.0 (the "License");
   you may not use this file except in compliance with the License.
   You may obtain a copy of the License at

       http://www.apache.org/licenses/LICENSE-2.0

   Unless required by applicable law or agreed to in writing, software
   distributed under the License is distributed on an "AS IS" BASIS,
   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   See the License for the specific language governing permissions and
   limitations under the License.

This library and source code are distributed under the terms described in the LICENSE file.