Changes

782 bytes added ,  19:24, 29 August 2011
no edit summary
Line 61: Line 61:     
--[[User:Luigi2us|Luigi2us]] 19:59, 28 August 2011 (CEST)
 
--[[User:Luigi2us|Luigi2us]] 19:59, 28 August 2011 (CEST)
 +
 +
@Luigi2us the checksum algorithm can be a crc because XorIn as well as XorOut can be use that result in non zero results
 +
 +
there is a way to find out if it is a crc or something like that or something simple
 +
 +
xor the message by B1 than the checkbit change by C1 xor the message with B2 and the checkbyte change by C2 xor the message by (B1 xor B2) and the checkbyte should change by (C1 xor C2)
 +
 +
example crc in this case crc-16 but also work with crc-8
 +
 +
06 06 01 05 crc is 1A21
 +
 +
06 06 01 05 xor 01 02 03 04 = 07 04 02 01 crc is 1580
 +
 +
06 06 01 05 xor 08 09 01 02 = 0E 0F 00 07 crc is 2973
 +
 +
06 06 01 05 xor 01 02 03 04 xor 08 09 01 02 = 0F 0D 03 03 crc is 26D2 (2973 xor 1580 xor 1A21)
 +
 +
 +
that don't work for most hash functions
 +
 +
ADD:Sorry for my bad English
 +
 +
--[[User:ichfly|ichfly]]
164

edits