Cryptography with Ring Algorithm – LWE

##plugins.themes.academic_pro.article.main##

Paramita Lumban Gaol
Stephen Buulolo
Aritmen Andreas L. Manurung
Yeremia Yeremia

Abstract

Ring Learning With Errors (Ring-LWE) is one of the basic schemes used to develop cryptographic algorithms that are resistant to quantum attacks, offering better computational efficiency compared to standard Learning With Errors (LWE). Ring-LWE uses the algebraic characteristics of polynomial rings to create a robust and fast encryption system. This study implements and evaluates the Ring-LWE algorithm in the context of public key exchange and encryption. Simulations are performed with various security parameters, including modulus size and error rate, to test the resistance to brute force attacks and lattice-based attacks. The experimental results show that the Ring-LWE algorithm can achieve a balance between security and computational efficiency, with shorter processing time than conventional LWE while maintaining a high level of security even in the face of quantum computers. From this study, it can be concluded that Ring-LWE is an excellent choice for application in post-quantum security systems, especially in encrypted communication and digital authentication applications. The next step can be directed at optimizing resource utilization and testing against various types of attacks.

##plugins.themes.academic_pro.article.details##

How to Cite
Gaol, P. L., Stephen Buulolo, Aritmen Andreas L. Manurung, & Yeremia, Y. (2024). Cryptography with Ring Algorithm – LWE. Login : Jurnal Teknologi Komputer, 18(01), 30-34. https://doi.org/10.58471/login.v18i01.110

References

Sabani, m. E., savvas, i. K., & garani, g. (2024). Learning with errors: a lattice-based keystone of post-quantum cryptography. Signals, 5(2), 216–243. Https://doi.org/10.3390/signals5020012
Saepulrohman, a., & negara, p. (2021). Implementasi algoritma tanda tangan digital berbasis kriptografi kurva eliptik diffie-hellman. 18(1), 22–28. Https://asecuritysite.com/encryption/js08.
Sholeh, n. (2024). Implementasi algoritma learning with error atas ring dalam mengamankan pesan (doctoral dissertation, universitas islam negeri maulana malik ibrahim).
Kalkar, m. A., savas, a., & san, i. Ring-lwe sifrelemesinin hls ile hizlandirilmasi accelerating ring-lwe encryption with hls.
Ariyus, d. (2008). Pengantar ilmu kriptografi: teori analisis & implementasi. Penerbit andi.
De fretes, a. V. C., aritonang, m. A. S., thamrin, m., masril, m. A., jufri, j., andaria, a. C., ... & mursalim, m. (2024). Pengantar ilmu komputer. Yayasan tri edukasi ilmiah.
Kusmayadi, d., & nurhayati, i. Apa itu cryptocurrency.

Sazoğlu, s. (2023). Hatalarla öğrenme tabanli torus tam homomorfik şifreleme şemasinin kalan sayilar sistemi varyanti= residue number system variant of learning with errors based torus fully homomorphic encryption scheme (master's thesis, sakarya üniversitesi).
Novak, l. (2022). Opis finalista nist-ovog natjecanja post-kvantne standardizacije kriptografije (doctoral dissertation, university of rijeka. Faculty of engineering. Department of computer engineering).
Balbás, d. (2021). The hardness of lwe and ring-lwe: a survey. Cryptology eprint archive.
Masuda, m., & kameyama, y. (2021, august). Fft program generation for ring lwe-based cryptography. In international workshop on security (pp. 151-171). Cham: springer international publishing.
He, p., bao, t., xie, j., & amin, m. (2023). Fpga implementation of compact hardware accelerators for ring-binary-lwe-based post-quantum cryptography. Acm transactions on reconfigurable technology and systems, 16(3), 1-23.