Kadhum, Laith M, Firdaus, Ahmad, Zolkiplib, Mohamad Fadli, Saferalia, Luay, Ab Razaka, Mohd Faizal. (1400). New formula to calculate the number of designs in RADG cryptosystem. هنرهای کاربردی, 12(1), 821-829. doi: 10.22075/ijnaa.2021.4937
Laith M Kadhum; Ahmad Firdaus; Mohamad Fadli Zolkiplib; Luay Saferalia; Mohd Faizal Ab Razaka. "New formula to calculate the number of designs in RADG cryptosystem". هنرهای کاربردی, 12, 1, 1400, 821-829. doi: 10.22075/ijnaa.2021.4937
Kadhum, Laith M, Firdaus, Ahmad, Zolkiplib, Mohamad Fadli, Saferalia, Luay, Ab Razaka, Mohd Faizal. (1400). 'New formula to calculate the number of designs in RADG cryptosystem', هنرهای کاربردی, 12(1), pp. 821-829. doi: 10.22075/ijnaa.2021.4937
Kadhum, Laith M, Firdaus, Ahmad, Zolkiplib, Mohamad Fadli, Saferalia, Luay, Ab Razaka, Mohd Faizal. New formula to calculate the number of designs in RADG cryptosystem. هنرهای کاربردی, 1400; 12(1): 821-829. doi: 10.22075/ijnaa.2021.4937

New formula to calculate the number of designs in RADG cryptosystem

International Journal of Nonlinear Analysis and Applications
مقاله 65، دوره 12، شماره 1، مرداد 2021، صفحه 821-829    اصل مقاله (661.12 K)
نوع مقاله: Research Paper
شناسه دیجیتال (DOI): 10.22075/ijnaa.2021.4937
نویسندگان
Laith M Kadhum1؛ Ahmad Firdaus* 2؛ Mohamad Fadli Zolkiplib3؛ Luay Saferalia4؛ Mohd Faizal Ab Razaka5
1Faculty of Computing College of Computing and Applied Sciences, Universiti Malaysia Pahang 26600 Pekan, Pahang Darul Makmur, Malaysia; & University of Kufa, Najaf, Iraq
2aFaculty of Computing College of Computing and Applied Sciences, Universiti Malaysia Pahang 26600 Pekan, Pahang Darul Makmur
3School of Computing, UUM College Arts Sciences, Universiti Utara Malaysia, 06010 UUM Sintok, Kedah Darul Aman, Malaysia
4Faculty of Computing College of Computing and Applied Sciences, Universiti Malaysia Pahang 26600 Pekan, Pahang Darul Makmur, Malaysia
5aFaculty of Computing College of Computing and Applied Sciences, Universiti Malaysia Pahang 26600 Pekan, Pahang Darul Makmur, Malaysia
چکیده
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}$.
کلیدواژه‌ها
RADG؛ Cryptography؛ Block Cipher؛ Keyless؛ Graph Theory
مراجع
آمار
تعداد مشاهده مقاله: 16,194
تعداد دریافت فایل اصل مقاله: 9,637
دانشگاه سمنان
پیوندهای مفید
آمار
تعداد نشریات22
تعداد شماره‌ها722
تعداد مقالات10,383
تعداد مشاهده مقاله72,839,200
تعداد دریافت فایل اصل مقاله64,535,815