1 Name: Anonymous : 2017-03-07 04:12
We simply define the binary xor as modulo addition without carry on the base 2 components of two numbers
7 = 0111
3 = 0011
(=) 0100
7 xor(2) 3 = 4
and then increase the base
7 = 21
3 = 10
(=) 01
7 xor(3) 3 = 1
2 Name: Anonymous : 2017-03-10 00:33
naive decryption
1 xor(3) 3 = 4
4 xor(3) 3 = 7
1 xor(3) 7 = (22) = 8
8 xor(3) 7 = (10) = 3
3 Name: GF(3) : 2017-03-21 08:14
Hello. I'd like to have a word with you.