Analyse des chaînes et des références croisées

You can disassemble code, identify functions, and read control flow graphs. One of the fastest ways to orient yourself in an unknown binary is to read its strings.

Error messages, URLs, file paths, and format specifiers reveal intent before you read a single instruction.

The classic command-line tool dumps printable sequences. Disassemblers like Ghidra and IDA have a dedicated Strings window with addresses.

Windows binaries often store text as UTF-16 (wide) strings, where each character is two bytes. A naive ASCII scan misses them.

Always check for both encodings; missing wide strings hides half the evidence.

A cross-reference (xref) links a location to every place that references it.

• Code xref: an instruction that jumps or calls here
• Data xref: an instruction that reads or writes this address

The power move: find an interesting string, then follow its data xref to the code that uses it.

Finding the string 'Invalid license key' and jumping to its xref often lands you right inside the license check.

Xrefs also map function relationships. Listing who calls a function (callers) and who it calls (callees) builds a call graph.

This shows how a key routine fits into the program's overall structure.

API imports are high-value xref targets. Find the import for connect or CreateFileW, then xref it to locate every networking or file routine.

This focuses analysis on the behavior you care about.

As xrefs reveal purpose, rename functions and add comments. FUN_00401a30 becomes check_license.

Good naming compounds: every future xref now reads as meaningful pseudocode.

Be cautious: strings can be decoys, dead code, or library boilerplate. A string's presence does not prove the feature is reachable.

Confirm with xrefs that the string is actually referenced by live code.

Malware often hides strings, decrypting them at runtime. If strings shows mostly gibberish, look for a small decode routine referenced everywhere; that is the string decryptor.

Identifying it unlocks the rest of the analysis.

Disassemblers let you jump through xrefs interactively. Pressing the xref hotkey on a function shows every caller, and you can walk up the chain to main.

This turns a flat list of addresses into a navigable map of the program.

You found the string 'Invalid license key'. What is the most efficient next step to reach the license-check logic?

Strings and xrefs are a static-analysis superpower:

• Extract ASCII and UTF-16 strings for instant context
• Follow data xrefs from strings into key code
• Use import xrefs and call graphs to map structure
• Beware decoys and on-the-fly string decryption