New formula to calculate the number of designs in RADG cryptosystem
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...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Semnan University
2021
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/34007/1/New%20formula%20to%20calculate%20the%20number%20of%20designs%20in%20RADG.pdf |
| _version_ | 1796995070761631744 |
|---|---|
| author | Kadhum, Laith M. Ahmad Firdaus, Zainal Abidin Mohamad Fadli, Zolkipli Saferalia, Luay Mohd Faizal, Ab Razak |
| author_facet | Kadhum, Laith M. Ahmad Firdaus, Zainal Abidin Mohamad Fadli, Zolkipli Saferalia, Luay Mohd Faizal, Ab Razak |
| author_sort | Kadhum, Laith M. |
| collection | UMP |
| description | 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. |
| first_indexed | 2024-03-06T12:56:55Z |
| format | Article |
| id | UMPir34007 |
| institution | Universiti Malaysia Pahang |
| language | English |
| last_indexed | 2024-03-06T12:56:55Z |
| publishDate | 2021 |
| publisher | Semnan University |
| record_format | dspace |
| spelling | UMPir340072022-05-09T08:34:07Z http://umpir.ump.edu.my/id/eprint/34007/ New formula to calculate the number of designs in RADG cryptosystem Kadhum, Laith M. Ahmad Firdaus, Zainal Abidin Mohamad Fadli, Zolkipli Saferalia, Luay Mohd Faizal, Ab Razak QA76 Computer software 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. Semnan University 2021 Article PeerReviewed pdf en cc_by_4 http://umpir.ump.edu.my/id/eprint/34007/1/New%20formula%20to%20calculate%20the%20number%20of%20designs%20in%20RADG.pdf 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) http://dx.doi.org/10.22075/ijnaa.2021.4937 http://dx.doi.org/10.22075/ijnaa.2021.4937 |
| spellingShingle | QA76 Computer software Kadhum, Laith M. Ahmad Firdaus, Zainal Abidin Mohamad Fadli, Zolkipli Saferalia, Luay Mohd Faizal, Ab Razak New formula to calculate the number of designs in RADG cryptosystem |
| title | New formula to calculate the number of designs in RADG cryptosystem |
| title_full | New formula to calculate the number of designs in RADG cryptosystem |
| title_fullStr | New formula to calculate the number of designs in RADG cryptosystem |
| title_full_unstemmed | New formula to calculate the number of designs in RADG cryptosystem |
| title_short | New formula to calculate the number of designs in RADG cryptosystem |
| title_sort | new formula to calculate the number of designs in radg cryptosystem |
| topic | QA76 Computer software |
| url | http://umpir.ump.edu.my/id/eprint/34007/1/New%20formula%20to%20calculate%20the%20number%20of%20designs%20in%20RADG.pdf |
| work_keys_str_mv | AT kadhumlaithm newformulatocalculatethenumberofdesignsinradgcryptosystem AT ahmadfirdauszainalabidin newformulatocalculatethenumberofdesignsinradgcryptosystem AT mohamadfadlizolkipli newformulatocalculatethenumberofdesignsinradgcryptosystem AT saferalialuay newformulatocalculatethenumberofdesignsinradgcryptosystem AT mohdfaizalabrazak newformulatocalculatethenumberofdesignsinradgcryptosystem |