Pseudo-prime number simulation and its application for security purpose

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.

[1]  Nuning Kurniasih,et al.  Combination Vigenere Cipher and One Time Pad for Data Security , 2018 .

[2]  Robbi Rahim,et al.  Cryptography Technique with Modular Multiplication Block Cipher and Playfair Cipher , 2016 .

[3]  Joe Hurd,et al.  Verification of the Miller-Rabin probabilistic primality test , 2003, J. Log. Algebraic Methods Program..

[4]  Shefali Sonavane,et al.  Cryptanalytic Attacks on IDEA Block Cipher , 2016 .

[5]  S Sriadhi,et al.  Combination Base64 Algorithm and EOF Technique for Steganography , 2018 .

[6]  Heri Nurdiyanto,et al.  Enhanced pixel value differencing steganography with government standard algorithm , 2017, 2017 3rd International Conference on Science in Information Technology (ICSITech).

[7]  Bruce Schneier,et al.  Applied cryptography : protocols, algorithms, and source codein C , 1996 .

[8]  Gebhard Böckle.  The Miller–Rabin test with randomized exponents , 2009, J. Math. Cryptol..

[9]  P. V. Lakshmi,et al.  Advanced Homomorphic Encryption for Cloud Data Security , 2017 .

[10]  Sarjon Defit,et al.  A New Image Encryption Technique Combining Hill Cipher Method, Morse Code and Least Significant Bit Algorithm , 2018 .

[11]  Robbi Rahim.  128 Bit Hash of Variable Length in Short Message Service Security , 2017 .

[12]  Gary L. Miller,et al.  Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields , 1986, CRYPTO.

[13]  Dahlan Abdullah,et al.  Prime Numbers Comparison using Sieve of Eratosthenes and Sieve of Sundaram Algorithm , 2018 .

[14]  Iskandar Zulkarnain,et al.  Prime Number: an Experiment Rabin-Miller and Fast Exponentiation , 2017 .

[15]  Robbi Rahim,et al.  An Android mobile RC4 simulation for education , 2018 .

[16]  Trent Jaeger,et al.  Pitfalls in the automated strengthening of passwords , 2013, ACSAC.

[17]  Matt Blumenthal,et al.  Encryption: Strengths and Weaknesses of Public-key Cryptography , 2007 .

[18]  염흥렬,et al.  [서평]「Applied Cryptography」 , 1997 .

[19]  Bruce Schneier,et al.  Applied cryptography, second edition : protocols, algorithms,and source code in C , 2015 .

[20]  Domagoj Jakobovic,et al.  Parallelized Rabin-Karp method for exact string matching , 2011, Proceedings of the ITI 2011, 33rd International Conference on Information Technology Interfaces.

[21]  Shefali Sonavane,et al.  Cryptanalytic Attacks on International Data Encryption Algorithm Block Cipher , 2016 .

[22]  Heri Nurdiyanto,et al.  Symmetric Stream Cipher using Triple Transposition Key Method and Base64 Algorithm for Security Improvement , 2017 .