Abstract—A new symmetric cipher algorithm is introduced in this article. This algorithm is based on multiple quasigroups (QGs), constructed by special kind of mapping called a complete mapping. All these transformations are controlled by equations for encryption and decryption QGs. So, there is a total storage reduction and an ability to use huge number of QGs with large order. Moreover, this proposal is enhanced with a new cyclic random permutation (CRP) to construct randomly big number of QGs. Analytical and comparative study concerned the proposal, was achieved. It proved its strength (key length 192 bits), its speed (encryption times comparable to standard already exists) and its immunity against most known attacks.
Index Terms—Private Key Cryptosystems, Quasigroup, String Transformations, Random Permutations.
H. Zorkta and T. Kabani are with Aleppo University- Syria. (email: drzorkta@hotmail.com; tarek_kabani@hotmail.com)
Cite: Haythem Zorkta, and Tarek Kabani, Member, IACSIT, "New Cipher Algorithm Based on Multiple Quasigroups," International Journal of Machine Learning and Computing vol. 1, no. 5, pp. 454-459, 2011.