Re: No code is crack proof!

[Mark Nudelman]

Aaron Ardiri wrote:
>        this means you need to do the following:
> 
>          a) write your algorithm (in C or whatever)
>          b) compile to assembly, get opcodes
>          c) encrypt opcodes, and store in an array,
>          d) when "regcheck" occurs, decrypt, and execute.

I still don't see the point of this.  Presumably after you've done all
this magic, you make some decision: did the regcode check out ok or
not?  A cracker just needs to find this bit of logic and make it look
like the decision came out "ok".  Alternatively, he can find the place
where you start the regcode process and branch around the whole thing. 
Or am I missing something?
--Mark