Re: IL Code Security

Tech-Archive recommends: Fix windows errors by optimizing your registry

From: gabriel (no_at_no--spam.com)
Date: 02/05/04 

Date: Thu, 05 Feb 2004 16:11:06 +0000

Tim Mulholland wrote:

> Basically, i'm curious to find out what others think about all this,

Let your boss know that it is rather straightforward to disassemble a C/C++
application and if you are looking for an algorithm in particular, it is
even easier to get from the generated assembler.

Likewise, you can reverse engineer .NET IL. I use Thinstall to obfuscate
and prevent memory-peeking which is a way to get aroung obfuscation of .NET
assemblies.

There is no perfect solution for either .NET or older stuff. 

-- 
gabriel

Relevant Pages

  • Re: Optimization help please
    ... few people that can improve such a routine using assembly. ... Have the compiler output assembler code for that routine and see if any ... be read then the CRC can be computed on each 'block' and the algorithm could ... > checksum is cpu and disk intensive, ...
    (comp.lang.asm.x86)
  • Re: Population count in SSE2, again
    ... This is a crude version of the well-known code in AMD's optimization ... and is not as fast as the AMD code. ... oneself that the algorithm is mathematically sound. ... Yes I'm sure you are right, but a typo in assembler is easily made. ...
    (comp.lang.asm.x86)
  • Re: Thinking assembly?
    ... This is one part of thinking in assembler to me. ... > algorithm and implement it in the higher-level language. ... you can't merely go back the HLL code to obtain ...
    (alt.lang.asm)
  • Re: Time this code, please!
    ... as you've created the term "HLL Pre-Parser" to specifically ... Now if you're comparing the speed of the HLA assembler against other ... magnitude faster than the division algorithm. ... What is way less funny, is that preaching Strategy Optimization, ...
    (alt.lang.asm)
  • Re: 128 by 64 unsigned division
    ... in 32bit assembler, and why can't I do it in 32bit Forth? ... A shift algorithm for 64 bits starts out by lasting 4 times ... For 32 bit architectures that don't provide it, ... If it still works the algorithm is independant of the quality ...
    (comp.lang.forth)