Rahim, Robbi and Kurniasih, Nuning and Pohan, Nurmaliana and Listyorini, Tri and Nanuru, Ricardo Freedom and Manurung, Rosida Tiurma and Najmurrrokhman, Asep and Hasibuan, Abdurrozzaq and Abdullah, Dahlan and Napitupulu, Darmawan (2018) Pseudo-prime number simulation and its application for security purpose. In: The 3 rd Annual Applied Science and Engineering Conference (AASEC 2018), April 18, 2018, Bandung.
|
Text
1.4 Pseudo-prime number simulation and its application for security purpose.pdf Download (3575Kb) | Preview |
|
|
Text
1.4 Peer Review_Pseudo-prime number simulation and its application for security purpose.pdf Download (1824Kb) | Preview |
|
|
Text
3.4 Turnitin_Pseudo-prime number simulation and its application for security purpose.pdf Download (1373Kb) | Preview |
Abstract
Abstract. Many public cryptography schemes rely on the use of prime numbers like for encryption and decryption. A prime number is one number that is widely used and large and consists of hundreds of digits, so it takes time to test whether the numbers are prime or not. Miller-Rabin is one algorithm that could be used to test prime number. Simulation to show how to test non-prime number elimination process can be used to determine the workings of the Miller-Rabin algorithm and also could be used as a media learning for students and lecturers to know how prime number test and generation.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Subjects: | T Technology > T Technology (General) |
| Depositing User: | Perpustakaan Maranatha |
| Date Deposited: | 17 Sep 2021 03:48 |
| Last Modified: | 21 Sep 2021 09:16 |
| URI: | http://repository.maranatha.edu/id/eprint/27837 |
Actions (login required)
 |
View Item |
