On line 1 we combine x and y (using XOR) to get this "hybrid" and we store it back in x. XOR is a great way to save information, because you can remove it by doing an XOR again. So, this is exactly what we do on line 2. We XOR the hybrid with y, which cancels out all the y information, leaving us only with x.I have this byte array: static byte[] buf = new byte[] { (byte) 0x01, (byte) 0x04, (byte)0x00, (byte)0x01,(byte)0x00, (byte) 0x01}; Now, the CRC checksum of this byte array is supposed to be 0x60, 0x0A. I want the Java code to recreate this checksum, however I cant seem to recreate it. I have tried crc16:

Bitwise XOR Operator is – The XOR operator (^) combines bits such that if either of the bits in the operands is a 1, then the resultant bit is a 1 Binary Operator as it Operates on 2 Operands. Denoted by : ^ Bitwise XOR Summary Table : A B A ^ B 0 0 … Implementing XOR cipher encryption / decryption in C#. A theoretical and practical implementation of the XOR encryption technology in C# which is extended from the Vernam cipher . Introduction. XOFT is an encryption algorithm using a key to mash it up with the cipher string. Its result is base64 encoded.