Given that theres no initial permutation only 16 32 bit long randomly generated keys and the round function is simply
f(x) = x ⊕ Ki. Also there are 10 64bit plaintext/cyphertext pairs given.
Now I have to show a way to universally break this cypher, but I can only think of brute-force. Any suggestions?