QUASIGROUP STRING PROCESSING: PART 4

A b s t r a c t: Given a flnite alphabet A and a quasigroup operation ⁄ on the set A, in earlier paper of ours we have deflned the quasigroup transformation E : A + ! A + , where A + is the set of all flnite strings with letters from A. Here we present several generalizations of the transformation E and we consider the conditions under which the transformed strings have uniform distributions of n-tuples of letters of A. The obtained results can be applied in cryptography, coding theory, deflning and improving pseudo random generators, and so on.