TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover

Journal of Discrete Mathematical Sciences and Cryptography

(Since 1998)
Open Access ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

CiteScore 2025: 2.7 (Q1)

Powered by:Powered by

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Taru Online First Current IssueSpecial IssuesBrowse all Issues
Journal of Discrete Mathematical Sciences and Cryptography
Open Access Research Article

Comparative analysis of Kyber-512, RSA, ECC and AES-128 for secure communication in resource-constrained systems

*

* Corresponding author · click or hover a name for details

pp. 1799–1821Vol. 29Issue 4April 2026DOI: 10.47974/JDMSC-2591 Crossmark XML
Received:
15 Apr 2025
Published Online:
24 Nov 2025
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-2591
Pages:
1799–1821

Abstract

Kyber is one of post quantum cryptography techniques that has been formally standardized by NIST. In fact, Kyber-512 exhibits the lowest security but achieves the fastest speed relative to other algorithms within the same family. Hence, this algorithm is appropriate to be implemented on resource-constrained devices regularly seen in IoT applications. The design of this research is divided into two main sections. The first part is a comparison about the process to exchange the secret key across Kyber-512, RSA (2048 bits), and ECC over a prime field (224 bits), using a 256-bit secret key as the secret message. Experimental results indicate that although Kyber-512 requires more processing time than RSA and ECC, it achieves average encryption and decryption periods only 8.3 milliseconds and 2.5 milliseconds, respectively, simulated on a general-purpose computer. However, the primary benefit of Kyber-512 is the resilience against quantum computer attacks. The second part evaluates the performance of Kyber-512 and AES-128, both of which provide analogous security levels. This study exploits two forms of data: a structured dataset and grayscale digital images. The results demonstrate that Kyber-512 requires a significantly greater processing time than AES-128 in both contexts. Therefore, the recommendation is that Kyber-512 should only be used for exchanging the secret key, whereas AES-128 should be employed for encryption and decryption processes.

Keywords

Kyber-512AES-128RSAECC over prime filed

Subject Classifications

94A6000A6968R01

References

[1] G. Brassard, “Relativized cryptography”, IEEE Transactions on Information Theory, vol.29, no. 6, pp. 877-894 (1983).
[2] C.H. Meyer, “Cryptography-a state of the art review”, in Proc. of VLSI and Computer Peripherals. COMPEURO 89, IEEE, West Germany, pp. 4/150-4/154 (1989). 
[3] A. Braeken, “Public key versus symmetric key cryptography in client–server authentication protocols”, International Journal of Information Security, vol.21, no. 1 pp. 103-104 (2022).
[4] A.J. Elbirt and C. Paar, “An instruction-level distributed processor for symmetric-key cryptography”, IEEE Transactions on Parallel and distributed Systems, vol.16, no. 5, pp. 468-480 (2005).
[5] W. Diffie and M.E. Hellman, “New directions in cryptography”, IEEE Trans. Inf. Theory, vol. 22, pp. 644–654 (1976).
[6] F. Thabit, O. Can, A.O. Aljahdali, G.H. Al-Gaphari, and H.A. Alkhzaimi, “Cryptography algorithms for enhancing IoT security”, Internet of Things, vol. 22, pp. 100759 (2023).
[7] K. Somsuk and C. Sanemueang, “Increasing security to public key cryptography for point-to-point communication”, Journal of Discrete Mathematical Sciences & Cryptography, vol.26, no. 1, pp. 215-229 (2023).
[8] P.W. Shor, “Algorithms for quantum computation: Discrete logarithms and factoring”, In Proc. of Annual Symposium on Foundations of Computer Science, Santa Fe, NM, USA, pp. 124–134 (1994).
[9] R.L. Rivest, A. Shamir and L. Adleman, “A method for obtaining digital signatures and public key cryptosystems”, Commun. ACM, vol. 21, pp. 120–126 (1978).
[10] D.T. Dam, T.H. Tran, V.P. Hoang, C.K. Pham and T.T. Hoang, “A survey of post-quantum cryptography: Start of a new race”, Cryptography, vol. 7, no. 3, pp. 40 (2023).
[11] F. Borges, P.R. Reis and D. Pereira, “A comparison of security and its performance for key agreements in post-quantum cryptography”, IEEE Access, vol. 8, pp. 142413-142422 (2020).
[12]     D. C. Lawo, R. Frantz, A. Cano Aguilera, X. Arnal I Clemente, M. P. Podleś, J.L. Imaña, I. Tafur Monroy and J.J. Vegas Olmos, “Falcon/Kyber and Dilithium/Kyber Network Stack on Nvidia’s Data Processing Unit Platform”, IEEE Access, vol.12, pp. 38048-38056 (2024).
[13]     H. Kim, H. Jung, A. Satriawan and H. Lee, “A Configurable ML-KEM/Kyber Key-Encapsulation Hardware Accelerator Architecture”, IEEE Transactions on Circuits and Systems II: Express Briefs, vol. 71, no. 11, pp. 4678-4682 (2024).
[14]     K.L. Tsai, Y.L. Huang, F.Y., Leu, I. You, Y.L. Huang and C.H. Tsai, “AES-128 based secure low power communication for LoRaWAN IoT environments”, IEEE Access, vol.6, pp. 45325-45334 (2018).
[15]     R. Zhang, J. Bi, L. Li and H. Peng, “An optimal bound for factoring unbalanced RSA moduli by solving Generalized Implicit Factorization Problem”, The Journal of Supercomputing, vol.81, no. 1, pp. 1-24 (2025).
[16] M. Wiener, “Cryptanalysis of short RSA secret exponents”, IEEE Transactions on Information Theory, vol. 36, pp. 553-558 (1990).
[17] J.M. Pollard, “Monte Carlo methods for index computation (𝑚𝑜𝑑𝑝)”, Mathematics of computation, vol. 32, no. 143, pp. 918- 924 (1978).
[18] V. Dossou-Yovo, A. Nitaj and A. Togbé, “Improved cryptanalysis of RSA”, Journal of Discrete Mathematical Sciences & Cryptography, vol.27, no. 3, pp. 945-961 (2024).
[19] D.S. Abdul-Zahra and H.R. Yassein, “Proposed development of RSA via new multidimensional algebra”, Journal of Discrete Mathematical Sciences & Cryptography, vol.28, no. 2, pp. 375 - 380 (2025).
[20] K. Song, H. Hu, L. Yan, X. Hou and J. Wei, “Parallel RSA encryption algorithm based on a ternary optical computer”, Applied Optics, vol.63, no. 25, pp. 6636-6645 (2024).
[21] D. Singh and S. Kumar, “Image authentication and encryption algorithm based on RSA cryptosystem and chaotic maps”, Expert Systems with Applications, vol.274, no. 2, pp. 126883 (2025).
[22] K. Somsuk, “The special algorithm based on RSA cryptography for signing and verifying digital signature”, Heliyon, vol.11, pp. e42481 (2025).
[23] K. Somsuk, “The development of signing and verification methods for high speed digital signatures on electronic official documents by using RSA cryptography”, Cogent Engineering, vol.11, no. 1, pp. 2432513 (2024).
[24] R.S. Durge and V.M. Deshmukh, “Securing Cloud Data: A hybrid encryption approach with RSA and AES for enhanced security and performance”, Journal of Integrated Science and Technology, vol.13, no. 3, pp. 1060-1060 (2025).
[25] R. Acheampong, D.M. Popovici, T. Balan, A. Rekeraho and M.S. Ramos, “Enhancing Security and Authenticity in Immersive Environments”, Information, vol.16, no. 3, pp. 191 (2025).
[26] N. Koblitz, “Elliptic Curve Cryptosystems”, Mathematics of Computation, vol. 48, pp. 203–209 (1987).
[27] V.S. Miller, “Uses of elliptic curves in cryptography”, Lecture Notes in Computer Science, vol. 218, pp. 417–428 (1986).
[28] K. Jang, V. Vikas, A. Baksi, S. Sarkar and H. Seo, “New Quantum Cryptanalysis of Binary Elliptic Curves”, IACR Transactions on Cryptographic Hardware and Embedded Systems, vol. 2025, no. 2, pp. 781-804 (2025).
[29] H. Junru, “The improved elliptic curve digital signature algorithm”, In Proc. of International Conference on Electronic & Mechanical Engineering and Information Technology, IEEE, Harbin, China, pp. 257-259 (2011). 
[30] M.I. Reddy, M. P. Reddy, R. O. Reddy and A. Praveen, “Improved elliptical curve cryptography and chaotic mapping with fruitfly optimization algorithm for secure data transmission”, Wireless Networks, vol. 30, no. 3, pp. 1151-1164 (2024).
[31] H. W. Lenstra Jr., “Factoring integers with elliptic curves”, Annals of Mathematics, vol.126, no. 3, pp. 649–673 (1987).
[32] A. Hafsa, A. Sghaier, J. Malek and M. Machhout, “Image encryption method based on improved ECC and modified AES algorithm”, Multimedia Tools and Applications, vol. 80, pp.19769-19801 (2021).
[33] M.Y. Shakor, M. I. Khaleel, M. Safran, S. Alfarhood and M. Zhu, “Dynamic AES encryption and blockchain key management: a novel solution for cloud data security”, IEEE Access, vol.12, pp. 26334-26343 (2024).
[34] H.M. Mohammad and A.A. Abdullah, “Enhancement process of AES: a lightweight cryptography algorithm-AES for constrained devices”, TELKOMNIKA (Telecommunication Computing Electronics and Control), vol. 20, no. 3, pp. 551-560 (2022).

Views: 105Downloads: 11Citations: 0