Kadhum, Laith M. and Ahmad Firdaus, Zainal Abidin and Mohamad Fadli, Zolkipli and Saferalia, Luay and Mohd Faizal, Ab Razak (2021) New formula to calculate the number of designs in RADG cryptosystem. International Journal of Nonlinear Analysis and Applications (IJNAA), 12 (1). pp. 821-829. ISSN 2008-6822. (Published)
|
Pdf
New formula to calculate the number of designs in RADG.pdf Available under License Creative Commons Attribution. Download (676kB) | Preview |
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 (FQFQ)mathematically possible for any design of the set QQ. FQFQ is an important part of the function F(n,m,λ)F(n,m,λ) that calculates the total number of cases of a certain design for the values Q,R,∑,ψ,JQ,R,∑,ψ,J and TT. This paper produces a mathematical equation to calculate FQFQ.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | RADG; Cryptography; Block Cipher; Keyless; Graph Theory |
| Subjects: | Q Science > QA Mathematics > QA76 Computer software |
| Faculty/Division: | Institute of Postgraduate Studies Faculty of Computing |
| Depositing User: | Mrs Norsaini Abdul Samat |
| Date Deposited: | 09 May 2022 08:34 |
| Last Modified: | 09 May 2022 08:34 |
| URI: | http://umpir.ump.edu.my/id/eprint/34007 |
| Download Statistic: | View Download Statistics |
Actions (login required)
 |
View Item |