Randomization Using Quasigroups, Hadamard and Number Theoretic Transforms

Good symmetric encryption schemes as well as randomization and hashing techniques are based on effective techniques of confusion and diffusion [1]. Quasigroups provide an excellent way to generate an astronomical number of keys and therefore they are excellent at confusion [2] but they are not equally good at diffusing the statistics of the plaintext. Specifically, the quasigroup transformation can be easily discovered by the known plaintext attack. For quasigroup mappings in encryption, it is necessary, therefore, to use this mapping together with other statistics-diffusing mappings.