A Proof of unsecure in the polynomial time for the XOR of two random variables

Xoring (Exclusive-OR) two variables is a very simple way to build pseudorandom functions from pseudorandom permutations. The aim of this paper proves it may insecure for this type of form A⊕B when the two variables run XOR operation on specific environment. Because such constructions have many applications in cryptography, the problem is interesting from both theoretical and practical points of view. In this paper we will prove that for form A⊕B, we have in fact already unsecure when A and B are two numbers data type. The research results and conclusions are drawn at the end.