Robbi Rahim, Nuning Kurniasih, Nurmaliana Pohan, S. Sriadhi, Tri Listyorini, Ricardo Freedom Nanuru, Rosida Tiurma Manurung, Asep Najmurrokhman, Abdurrozzaq Hasibuan, Dahlan Abdullah, Darmawan Napitupulu
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. © The Authors, published by EDP Sciences, 2018.
Universiti Malaysia Perlis, School of Computer and Communication Engineering, Kubang Gajah, Malaysia; Universitas Padjadjaran, Faculty of Communication Science, Library and Information Science Program, Bandung, Indonesia; Indonesian Publications Collaboration Community, Indonesia; Universitas Negeri Medan, Department Education of Information Technology and Computers, Medan, Indonesia; Universitas Muria Kudus, Department of Informatics, Kudus, Indonesia; Universitas Halmahera, Maluku Utara, Indonesia; Universitas Kristen Maranatha, Bandung, Indonesia; Universitas Jenderal Achmad Yani, Department of Electrical Engineering, Cimahi, Indonesia; Universitas Islam Sumatera Utara, Department of Industry Engineering, Medan, Indonesia; Universitas Malikussaleh, Department of Informatics, Lhokseumawe, Indonesia; Indonesian Institute of Sciences, Research Center for Quality System and Testing Technology, Jakarta, Indonesia
