پیوندهای مفید
آمار
| تعداد نشریات | 22 |
| تعداد شمارهها | 705 |
| تعداد مقالات | 10,146 |
| تعداد مشاهده مقاله | 71,451,328 |
| تعداد دریافت فایل اصل مقاله | 63,174,261 |
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 | ||
| تاریخ دریافت: 16 مهر 1399، تاریخ بازنگری: 22 آذر 1400، تاریخ پذیرش: 06 اسفند 1399 | ||
| چکیده | ||
| 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 | ||
| مراجع | ||
|
[1] G. Baumslag, B. Fine, M. Kreuzer and G. Rosenberger, A Course in Mathematical Cryptography, De Gruyter, 2015. [2] L. Mao, Mathematics after CC conjecture-combinatorial notions and achievements, Int. J. Math. Comb. 2 (2015) 1–31. [3] S. Lovett, Additive combinatorics and its applications in theoretical computer science, Theory Comput. 2016 (2016) 1–53. [4] S.A. Albermany and G.A. Safdar, Keyless Security in Wireless Networks, Wirel. Pers. Commun. 79(3) (2014) 1713–1731. [5] J.L. Gross and J. Yellen, Handbook of Graph Theory, CRC Boca Raton, Florida, 2004. [6] I. Anderson and R. Diestel, Graph theory, Math. Gazette 85(502) (2001) 176-177. [7] S. Albermany, F. Radi Hamade and G.A. Safdar, New random block cipher algorithm, Int. Conf. Current Res. Comput. Sci. Inf. Technol. (ICCIT), 2017. [8] S.A. Albermany and A.H. Alwan, RADG design on elliptic curve cryptography, ICCIIDT 2016 London - UK Proceedings, 2016. [9] S. Albermany, M. Nathim and Z.M. Hussain, CRADG: A chaotic RADG security system, J. Eng. Appl. Sci. 12 (2017) 4118–4122. [10] A. Salah, D. Amer and S. Kamal, S-RADG: A stream cipher RADG cryptography, J. Eng. Appl. Sci. 13 (2018) 2317–2321. | ||
|
آمار تعداد مشاهده مقاله: 16,109 تعداد دریافت فایل اصل مقاله: 9,534 |
||