About a Feistel block cipher generalization

Generalized Feistel Networks based on shift registers are investigated. The involutivity criterion is proved for the encryption algorithms in this class. The mixing properties of concerned algorithms are researched using a graph-theoretical approach. The upper bounds for the diameter and for the exponent of the mixing graph of the appropriated round function are given.