Protecting executable from reverse engineering?

by

but they can all be worked around and or figured out by code analysists given the right time frame.

If you give people a program that they are able to run, then they will also be able to reverse-engineer it given enough time. That is the nature of programs. As soon as the binary is available to someone who wants to decipher it, you cannot prevent eventual reverse-engineering. After all, the computer has to be able to decipher it in order to run it, and a human is simply a slower computer.

More Related Contents:

  1. Why C/C++ is slower than Assembly and other low level languages?
  2. Can num++ be atomic for ‘int num’?
  3. How do you get assembler output from C/C++ source in gcc?
  4. Is < faster than
  5. How do I achieve the theoretical maximum of 4 FLOPs per cycle?
  6. What is IACA and how do I use it?
  7. How to hide a string in binary code?
  8. Atomic double floating point or SSE/AVX vector load/store on x86_64
  9. What C/C++ compiler can use push pop instructions for creating local variables, instead of just increasing esp once?
  10. How to Detect the Number of Physical Processors / Cores on Windows, Mac and Linux
  11. How do objects work in x86 at the assembly level?
  12. Is right shift undefined behavior if the count is larger than the width of the type?
  13. How do I call “cpuid” in Linux?
  14. Algorithm for finding the smallest power of two that’s greater or equal to a given value [duplicate]
  15. Difference in performance between MSVC and GCC for highly optimized matrix multplication code
  16. Why does a std::atomic store with sequential consistency use XCHG?
  17. Unoptimized clang++ code generates unneeded “movl $0, -4(%rbp)” in a trivial main()
  18. Why can a T* be passed in register, but a unique_ptr cannot?
  19. Assembly ADC (Add with carry) to C++
  20. Function to mangle/demangle functions
  21. Address of function is not actual code address
  22. Visual Studio 2017: _mm_load_ps often compiled to movups
  23. Calculate system time using rdtsc
  24. Most insanely fast way to convert 9 char digits into an int or unsigned int
  25. Address of labels (MSVC)
  26. What are these seemingly-useless callq instructions in my x86 object files for?
  27. How is floating point conversion actually done in C++?(double to float or float to double)
  28. Fast divisibility tests (by 2,3,4,5,.., 16)?
  29. Why is this SIMD multiplication not faster than non-SIMD multiplication?
  30. How to force GCC to assume that a floating-point expression is non-negative?

Leave a Comment