We need to find an analogue of this team.

It looks like a hex like this: B9SSSSSSSS3680310E4181F9LLLLLLLL75F3E9JJJJJJJJ

00401945 > B9 XXXXXXXX MOV ECX,XXXXXXXX 0040194B 36:8031 0E XOR BYTE PTR SS:[ECX],0E 0040194F 41 INC ECX 00401950 81F9 XXXXXXXX CMP ECX,XXXXXXXX 00401956 ^ 75 F3 JNZ SHORT 0040194B 00401958 ^ E9 XXXXXXXX JMP XXXXXXXX
  • 3
    This is a cycle of some kind. What kind of analog is needed? - skegg
  • propose all that is - Nikolay69

3 answers 3

 BYTE x[...]; BYTE * ecx; ecx = x; // или ecx = &x[0] что то же самое // mov ecx, XXXXXXXX do { (*ecx) ^= 0x0E; // XOR BYTE PTR SS:[ECX],0E ecx++; // inc ecx } while(ecx!=XXXXXXX); // CMP ECX,XXXXXXXX, jnz

In fact, just walk through the array (or a string of characters) and apply XOR 0x0E to each element.

  • That was what ATP needed - Nikolay69

loop?

    Do so.

    1. Step by step execute commands.
    2. Make a flowchart.
    3. Looking for the description of the microprocessor commands analog.

    I didn’t particularly peer, but, for sure, guess @Torteg is correct, this is the closest analogue - the loop command with a counter in ECX.