Cryptographic mixing transformations and message embedding in chaotic systems

Abstract

The paper focuses on mixing functions for cryptographic applications, pursued in the context of including the message in a dynamic system. The contribution of the dynamic system to the mixing function when the message is included in the dynamic system is highlighted. For the discussion we chose three popular dynamic systems - the Hénon map, the logistic map and the tent map - and we used the mixing functions suggested by C.E. Shannon. The analyzed aspects are illustrated on images, but the applicability is much wider.