Development of Efficient Algorithms for Quasigroup Generation & Encryption

This paper proposes a lightweight quasigroup based encryption scheme for providing message confidentiality. A fast and efficient method of generating a practically unlimited number of quasigroups of an arbitrary order is presented. The scheme first generates a random quasigroup of order 256 out of the extremely large number of available options. A new method using shift and lookup operations on the quasigroup is then used for encryption/decryption of the data. Experiments conducted on text and visual data prove that enhanced security may be provided using computationally efficient schemes involving simple operations on quasigroups.