Cryptanalysis of F.E.A.L

At Eurocrypt 87 the blockcipher F.E.A.L. was presented [2]. Earlier algorithms called F.E.A.L-1 and F.E.A.L-2 had been submitted to standarization organizations but this was presumably the final version. It is a Feistel cipher, but in contrast to D.E.S., a software implementation does not require a table look-up. The intention was a fast software implementation and also an avoidance of discussions about random tables. As Walter Fumy indicated at Crypto 87 [1] a certain transformation on 32 bits used by the cipher was not complete in contrast to a remark made during the presentation of F.E.A.L. at Eurocrypt 87.