Article Per Year (5 Year)
p-Index From 2020 - 2025
0.562
P-Index
This Author published in this journals
All Journal Login : Jurnal Teknologi Komputer Journal Majelis Paspama
Stephen Buulolo
Unknown Affiliation
Civil Engineering, Building, Construction & Architecture Computer Science & IT Decision Sciences, Operations Research & Management Engineering Industrial & Manufacturing Engineering Mechanical Engineering

Published : 3 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 3 Documents
Search

 1 
Cryptography with Ring Algorithm – LWE Gaol, Paramita Lumban; Stephen Buulolo; Aritmen Andreas L. Manurung; Yeremia, Yeremia
Login : Jurnal Teknologi Komputer Vol. 18 No. 01 (2024): Jurnal Teknologi Komputer, Edition June 2024
Publisher : Sean Institute

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.58471/login.v18i01.110

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.
Cryptography with Ring Algorithm – LWE Gaol, Paramita Lumban; Stephen Buulolo; Aritmen Andreas L. Manurung; Yeremia, Yeremia
Login : Jurnal Teknologi Komputer Vol. 18 No. 01 (2024): Jurnal Teknologi Komputer, Edition June 2024
Publisher : Sean Institute

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.58471/login.v18i01.110

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.
Cryptography with Ring Algorithm – LWE Paramita Lumban Gaol; Stephen Buulolo; Aritmen Andreas L. Manurung; Yeremia, Yeremia
Journal Majelis Paspama Vol. 2 No. 01 (2024): Journal Majelis Paspama, January 2024
Publisher : Journal Majelis Paspama

Show Abstract | Download Original | Original Source | Check in Google Scholar

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.
Co-Authors Aritmen Andreas L. Manurung Gaol, Paramita Lumban Paramita Lumban Gaol Yeremia, Yeremia