There is a Feistel block cipher based on Blowfish called Kaweichel. In one of its papers, there is this affirmation:
For the construction of the round function one choses usually parallel substitutions (s-boxes). The output bits of these s-boxes are permuted in order to achieve diffusion. For the derivation of the round keys from the userkey one has to choose a key schedule.
The basic idea behind this construction is that a weak, iterated encryption function will result in a cryptographically strong cipher. But there are minimum requirements for the round function (F-function). It should, for example, offer sufficient resistance against differential and linear cryptanalysis.
[...]
Rather than using a round key for the round function, the s-boxes are key dependant. This method got first widely known with the block cipher Blowfish. The advantage is, that differential and linear cryptanalysis are not applicable, since they require the knowledge of the s-boxes.
Is this affirmation true? Can one with little knowledge of ciphers design and build a strong cipher based on this?