It's hard to say,
for example let's get a file with all 32 bit numbers in it,
so CRC32 of this file gives us a number which already contains in
file,
so it's not impossible - some solutions for some files exists.
Also CRC32 is not a strong crypto hash function so Np or not Np this
is the question.
So basically the advice given the blog is impossible to achive (or NP-
Complete)?
On Nov 2, 9:09 am, cybice wrote:
> But, no 100% probability that this method find something :-)
> But :-) i think CRC32 is not a good hash function so probability to
> find solution is not zero
>
> On Nov 2, 3:45
But, no 100% probability that this method find something :-)
But :-) i think CRC32 is not a good hash function so probability to
find solution is not zero
On Nov 2, 3:45 am, cybice wrote:
> Another way :-)
>
> while(CALC_CRC(compiled_code)!=CRC)
> {
> CRC = CRC++;
> InjectCRCIntoSource(CRC);
Another way :-)
while(CALC_CRC(compiled_code)!=CRC)
{
CRC = CRC++;
InjectCRCIntoSource(CRC);
Compile();
}
On Nov 1, 10:50 am, Zsolt Vasvari wrote:
> Under the part "Make your application temper-resistant" Tim Bray
> advises:
>
> "The most obvious mechanism is to use a lightweight hash fun
Just have the hash file install into the res or something and when you
loop through as res files, skip that file.
-niko
On Nov 1, 2:50 am, Zsolt Vasvari wrote:
> Under the part "Make your application temper-resistant" Tim Bray
> advises:
>
> "The most obvious mechanism is to use a lightweight ha
5 matches
Mail list logo
