Install any skill in seconds. Free to start, no credit card required.
Get Started Free →Develop precise YARA rules for malware detection by identifying unique byte patterns, strings, and behavioral indicators in executable files while minimizing false positives.
.claude/skills/performing-yara-rule-development-for-detection/SKILL.md| Test case | Without → With | Effect | Δ tokens | Δ turns |
|---|---|---|---|---|
| case-21 | ✗→✓ | ▲ Improved | — | — |
| case-01 | ✗→✓ | ▲ Improved | — | — |
| case-13 | ✓→✓ | = Same ✓ | — | — |
| case-15 | ✗→✗ | = Same ✗ | — | — |
| case-09 | ✗→✗ | = Same ✗ | — | — |
YARA is the pattern matching swiss knife for malware researchers, enabling identification and classification of malware based on textual or binary patterns. Effective YARA rules combine unique string patterns, byte sequences, PE header characteristics, import table analysis, and conditional logic to detect malware families while avoiding false positives. Modern YARA-X (rewritten in Rust, stable since June 2025) brings improved performance and new modules. Rules should target unpacked malware artifacts like hardcoded stack strings, C2 URLs, mutex names, encryption constants, and unique code sequences rather than packer signatures.
yara-python librarypefile, pestudio)Every YARA rule consists of three sections: meta (optional descriptive metadata), strings (pattern definitions), and condition (matching logic). String types include text strings (ASCII/wide/nocase), hex patterns with wildcards and jumps, and regular expressions. Conditions combine string matches with file properties using boolean operators.
Effective rules target patterns that are unique to the malware family and survive recompilation. Hardcoded stack strings are excellent choices because compilers embed them consistently. C2 domain patterns, custom encryption routines, unique error messages, and specific API call sequences provide stable detection anchors. Avoid compiler-generated boilerplate and common library strings.
YARA evaluates conditions short-circuit style. Place the most discriminating and cheapest-to-evaluate conditions first. Use filesize limits to skip irrelevant files quickly. Minimize regex usage in favor of hex patterns. Use private rules as building blocks for complex detection logic without generating standalone matches.
python#!/usr/bin/env python3 """Extract candidate strings and byte patterns for YARA rule creation.""" import pefile import re import sys from collections import Counter def extract_strings(filepath, min_length=6): """Extract ASCII and wide strings from binary.""" with open(filepath, 'rb') as f: data = f.read() # ASCII strings ascii_strings = re.findall( rb'[\x20-\x7e]{' + str(min_length).encode() + rb',}', data ) # Wide (UTF-16LE) strings wide_strings = re.findall( rb'(?:[\x20-\x7e]\x00){' + str(min_length).encode() + rb',}', data ) return { 'ascii': [s.decode('ascii') for s in ascii_strings], 'wide': [s.decode('utf-16-le') for s in wide_strings], } def analyze_pe_imports(filepath): """Extract import table for API-based detection.""" try: pe = pefile.PE(filepath) except pefile.PEFormatError: return [] imports = [] if hasattr(pe, 'DIRECTORY_ENTRY_IMPORT'): for entry in pe.DIRECTORY_ENTRY_IMPORT: dll_name = entry.dll.decode('utf-8', errors='replace') for imp in entry.imports: if imp.name: func_name = imp.name.decode('utf-8', errors='replace') imports.append(f"{dll_name}!{func_name}") return imports def find_unique_byte_patterns(filepath, pattern_length=16): """Find unique byte sequences suitable for YARA hex patterns.""" with open(filepath, 'rb') as f: data = f.read() try: pe = pefile.PE(filepath) # Focus on code section for section in pe.sections: if section.Characteristics & 0x20000000: # IMAGE_SCN_MEM_EXECUTE code_start = section.PointerToRawData code_end = code_start + section.SizeOfRawData code_data = data[code_start:code_end] break else: code_data = data except Exception: code_data = data # Find byte patterns that appear exactly once patterns = [] for i in range(0, len(code_data) - pattern_length, 4): pattern = code_data[i:i+pattern_length] if pattern.count(b'\x00') < pattern_length // 3: # Skip null-heavy hex_pattern = ' '.join(f'{b:02X}' for b in pattern) patterns.append(hex_pattern) # Count frequency and return unique ones freq = Counter(patterns) unique = [p for p, count in freq.items() if count == 1] return unique[:20] # Top 20 candidates def suggest_rule_strings(filepath): """Suggest strings and patterns for YARA rule.""" print(f"[+] Analyzing: {filepath}") # Extract strings strings = extract_strings(filepath) # Filter for suspicious/unique strings suspicious_keywords = [ 'http', 'https', 'cmd', 'powershell', 'mutex', 'pipe', 'password', 'credential', 'inject', 'hook', 'debug', 'sandbox', 'virtual', 'vmware', 'vbox', ] print("\n[+] Suspicious ASCII strings:") for s in strings['ascii']: if any(kw in s.lower() for kw in suspicious_keywords): print(f" $ = \"{s}\" ascii") print("\n[+] Suspicious wide strings:") for s in strings['wide']: if any(kw in s.lower() for kw in suspicious_keywords): print(f" $ = \"{s}\" wide") # Import analysis imports = analyze_pe_imports(filepath) suspicious_apis = [ 'VirtualAlloc', 'VirtualProtect', 'WriteProcessMemory', 'CreateRemoteThread', 'NtUnmapViewOfSection', 'RtlMoveMemory', 'OpenProcess', 'CreateToolhelp32Snapshot', 'InternetOpenA', 'HttpSendRequestA', 'CryptEncrypt', 'CryptDecrypt', ] print("\n[+] Suspicious imports:") for imp in imports: func = imp.split('!')[-1] if func in suspicious_apis: print(f" {imp}") # Byte patterns print("\n[+] Candidate hex patterns:") patterns = find_unique_byte_patterns(filepath) for p in patterns[:5]: print(f" $hex = {{ {p} }}") if __name__ == "__main__": if len(sys.argv) < 2: print(f"Usage: {sys.argv[0]} <sample_path>") sys.exit(1) suggest_rule_strings(sys.argv[1])
pythonimport yara import os def create_yara_rule(rule_name, meta, strings, condition): """Generate a YARA rule from components.""" meta_str = "\n".join(f' {k} = "{v}"' for k, v in meta.items()) strings_str = "\n".join(f" {s}" for s in strings) rule = f"""rule {rule_name} {{ meta: {meta_str} strings: {strings_str} condition: {condition} }}""" return rule def test_yara_rule(rule_text, test_dir): """Compile and test YARA rule against sample directory.""" try: rules = yara.compile(source=rule_text) except yara.SyntaxError as e: print(f"[-] YARA syntax error: {e}") return None results = {"matches": [], "no_match": []} for filename in os.listdir(test_dir): filepath = os.path.join(test_dir, filename) if not os.path.isfile(filepath): continue matches = rules.match(filepath) if matches: results["matches"].append({ "file": filename, "rules": [m.rule for m in matches], }) else: results["no_match"].append(filename) print(f"[+] Matches: {len(results['matches'])}") print(f"[-] No match: {len(results['no_match'])}") return results # Example: Create a rule for a hypothetical malware family example_rule = create_yara_rule( rule_name="MalwareFamily_Variant_A", meta={ "description": "Detects MalwareFamily Variant A", "author": "Malware Analysis Team", "date": "2025-01-01", "hash": "abc123...", "tlp": "WHITE", }, strings=[ '$mutex = "Global\\\\UniqueM4lwareMutex" ascii wide', '$c2_pattern = /https?:\\/\\/[a-z]{5,10}\\.(xyz|top|buzz)\\/gate\\.php/', '$api1 = "VirtualAllocEx" ascii', '$api2 = "WriteProcessMemory" ascii', '$api3 = "CreateRemoteThread" ascii', '$hex_decrypt = { 8B 45 ?? 33 C1 89 45 ?? 83 C1 04 }', '$pdb = "C:\\\\Users\\\\" ascii', ], condition=( 'uint16(0) == 0x5A4D and filesize < 2MB and ' '($mutex or $c2_pattern) and ' '2 of ($api*) and ' '$hex_decrypt' ), ) print(example_rule)
pythonimport time def benchmark_rule(rule_text, scan_directory, iterations=3): """Benchmark YARA rule scan performance.""" rules = yara.compile(source=rule_text) files = [] for root, _, filenames in os.walk(scan_directory): for f in filenames: files.append(os.path.join(root, f)) print(f"[+] Benchmarking against {len(files)} files " f"({iterations} iterations)") times = [] for i in range(iterations): start = time.perf_counter() matches = 0 for filepath in files: try: result = rules.match(filepath) if result: matches += 1 except Exception: pass elapsed = time.perf_counter() - start times.append(elapsed) print(f" Iteration {i+1}: {elapsed:.3f}s ({matches} matches)") avg_time = sum(times) / len(times) files_per_sec = len(files) / avg_time print(f"\n[+] Average: {avg_time:.3f}s ({files_per_sec:.0f} files/sec)") return avg_time
| Case | Status | Duration (ms) | Turns | Tokens | Tool calls | ||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Without | With | Δ | Without | With | Δ | Without | With | Δ | Without | With | Δ | ||
case-15 | fail→fail | — | — | — | — | — | — | — | — | — | — | — | — |
case-09 | fail→fail | — | — | — | — | — | — | — | — | — | — | — | — |
case-21 | fail→pass | — | — | — | — | — | — | — | — | — | — | — | — |
case-05 | fail→fail | — | — | — | — | — | — | — | — | — | — | — | — |
case-06 | fail→fail | — | — | — | — | — | — | — | — | — | — | — | — |
case-19 | fail→fail | — | — | — | — | — | — | — | — | — | — | — | — |
case-22 | fail→fail | — | — | — | — | — | — | — | — | — | — | — | — |
case-25 | fail→fail | — | — | — | — | — | — | — | — | — | — | — | — |
case-18 | fail→fail | — | — | — | — | — | — | — | — | — | — | — | — |
case-17 | fail→fail | — | — | — | — | — | — | — | — | — | — | — | — |
case-10 | fail→fail | — | — | — | — | — | — | — | — | — | — | — | — |
case-08 | fail→fail | — | — | — | — | — | — | — | — | — | — | — | — |
case-20 | fail→fail | — | — | — | — | — | — | — | — | — | — | — | — |
case-02 | fail→fail | — | — | — | — | — | — | — | — | — | — | — | — |
case-23 | fail→fail | — | — | — | — | — | — | — | — | — | — | — | — |
case-03 | fail→fail | — | — | — | — | — | — | — | — | — | — | — | — |
case-14 | fail→fail | — | — | — | — | — | — | — | — | — | — | — | — |
case-24 | fail→fail | — | — | — | — | — | — | — | — | — | — | — | — |
case-01 | fail→pass | — | — | — | — | — | — | — | — | — | — | — | — |
case-04 | fail→fail | — | — | — | — | — | — | — | — | — | — | — | — |
case-07 | fail→fail | — | — | — | — | — | — | — | — | — | — | — | — |
case-11 | fail→fail | — | — | — | — | — | — | — | — | — | — | — | — |
case-12 | fail→fail | — | — | — | — | — | — | — | — | — | — | — | — |
case-13 | pass→pass | — | — | — | — | — | — | — | — | — | — | — | — |
case-16 | fail→fail | — | — | — | — | — | — | — | — | — | — | — | — |
DecimalAI ran this skill against gemini-3.6-flash twice over the same eval suite — once with the skill loaded and once without — and compared the two runs case by case. 25 cases were attempted. The headline lift of +8 percentage points is the difference between those two pass rates over the 25 comparable cases.
The per-case answers from this run were removed by the retention sweep, so the case table below shows the verdicts without the text either arm produced. The counts above were recorded at the time and are unaffected. Answers are now kept for 180 days.
Other measured skills in the registry, with their headline benchmark lift.