| Autor: |
Abdurrozzaq Hasibuan, Nuning Kurniasih, Dahlan Abdullah, Nurmaliana Pohan, Sriadhi Sriadhi, Robbi Rahim, Tri Listyorini, Rosida Tiurma Manurung, Darmawan Napitupulu, Asep Najmurrokhman, Ricardo Freedom Nanuru |
| Jazyk: |
angličtina |
| Rok vydání: |
2018 |
| Předmět: |
|
| Zdroj: |
MATEC Web of Conferences, Vol 197, p 03005 (2018) |
| Popis: |
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. |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
