A new class of cryptosystems based on interconnection networks

M. Portz

	   Interconnection networks have been widely studied in the
	   field of parallel processing. They have one property that
	   makes them very interesting for cryptology, i.e. they give the
	   opportunity to specify and perform permutations at the same
	   time.  This paper introduces a new class of cryptosystems which
	   is constructed using boolean functions and interconnection
	   networks. The construction is secure in the sense that it
	   can be used to construct pseudo-random permutation generators
	   from pseudo-random Boolean function generators (as proposed
	   by Luby and Rackoff and further investigated by Schnorr,
	   Pieprzyk, Ohnishi etc. It is proposed, to use simpler
	   functions instead of pseudo-random functions to construct
	   cryptosystems, e.g. theoretical pseudo-random number generators
	   (as proposed by Yao, Blum, etc.), practical pseudo-random
	   number generators (linear shift register etc.) or oneway
	   functions. The security of a specific cryptosystem based on
	   boolean functions fulfilling the strict avalanche criterion
	   (Lloydd) is investigated.