Abstract—A new block symmetric encryption algorithm EATF is introduced in this paper. This algorithm is based on a relatively new class of invertible mappings called T-Functions, which used to provide EATF with confusion and diffusion in its permutation and balanced mixing phases. Again T-Functions in used to generate large quasigroups as its encryption core. EATF has multiple operational modes according to its dynamic key length. Analytical study proved EATF strength in all operational modes against brute force attacks, and introduced block encryption times equal to 50 ms.
Index Terms—Private key cryptosystems, quasigroup, string transformations, random permutations.
H. Zorkta and L. Ali are with the Aleppo University- Syria (email: firstname.lastname@example.org; Laaj_4@yahoo.com).
Cite: Haythem Zorkta and Loay Ali, "New Encryption Algorithm Based on T-Functions (EATF)," International Journal of Computer Theory and Engineering vol. 4, no. 5, pp. 712-716, 2012.