Document Type : Research Paper

Authors

• Laith M Kadhum ¹
• Ahmad Firdaus ²
• Mohamad Fadli Zolkiplib ³
• Luay Saferalia ⁴
• Mohd Faizal Ab Razaka ⁵

¹ Faculty of Computing College of Computing and Applied Sciences, Universiti Malaysia Pahang 26600 Pekan, Pahang Darul Makmur, Malaysia; & University of Kufa, Najaf, Iraq

² aFaculty of Computing College of Computing and Applied Sciences, Universiti Malaysia Pahang 26600 Pekan, Pahang Darul Makmur

³ School of Computing, UUM College Arts Sciences, Universiti Utara Malaysia, 06010 UUM Sintok, Kedah Darul Aman, Malaysia

⁴ Faculty of Computing College of Computing and Applied Sciences, Universiti Malaysia Pahang 26600 Pekan, Pahang Darul Makmur, Malaysia

⁵ aFaculty of Computing College of Computing and Applied Sciences, Universiti Malaysia Pahang 26600 Pekan, Pahang Darul Makmur, Malaysia

Abstract

Reaction automata direct graph (RADG) is a new technique that uses the automata direct graph method to represent a certain design for encryption and decryption. Jump states are available in the RADG design that enables the encipher to generate different ciphertexts each time from the same plaintext and wherein not a single ciphertext is related to a certain plaintext. This study created a matrix representation for RADG designs that allows the calculation of the number of cases ($F_{Q}$)mathematically possible for any design of the set $Q$. $F_{Q}$ is an important part of the function $\mathrm{F}(\mathrm{n}, \mathrm{m}, \lambda)$ that calculates the total number of cases of a certain design for the values $Q, R, \sum, \psi, J$ and $T$. This paper produces a mathematical equation to calculate $F_{Q}$.

Keywords

• RADG
• Cryptography
• Block Cipher
• Keyless
• Graph Theory