This paper continues the investigation regarding the operation of substituting subwords of a given word with other strings, an operation useful in cryptography. Some results concerning the closure properties of the families in the Chomsky hierarchy are presented. A set of different necessary conditions for the separable encryption systems are established. Possible applications in the authentication signature are finally mentioned.