Prime Number: an Experiment Rabin-Miller and Fast Exponentiation

Rahim, Robbi; Winata, Hendryan; Zulkarnain, Iskandar; Jaya, Hendra

doi:10.1088/1742-6596/930/1/012032

Cited by 6 publications

(7 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Security in a cryptographic protocol is very important [12], this is because many attacks on the protocol due to the selection of wrong algorithms in cryptographic protocol. Modular arithmetic [17], greatest common divisor [13], [17], euclidean algorithm, prime number [11] and inverse modulo [18] are used on the application of Pohlig-hellman algorithm and three-pass protocol.…”

Section: Methodsmentioning

confidence: 99%

Applied Pohlig-Hellman algorithm in three-pass protocol communication

Rahim¹

2018

J Appl Eng Science

Self Cite

View full text Add to dashboard Cite

424Three-pass Protocol is a method or technique that can be used by 2 (two) sender and recipient of the message to communicate with each other using XOR function, the problem that occurs is when the communication process there is parties who can know the messages sent from the sender to the recipient. To solve the problem we need an algorithm in this case Pohlig-Hellman algorithm, the use of Pohlig-Hellman algorithm on Three-pass Protocol ensures the security of messages sent by the sender to the receiver because each sender and receiver uses keys p, e, and d which is a number random and d is the inverse modulo of p and e of the sender and receiver, the results of this research suggest that it is impossible for the attacker or cryptanalyst to know the correct message quickly despite having adequate computer resources.

show abstract

Section: Methodsmentioning

confidence: 99%

Applied Pohlig-Hellman algorithm in three-pass protocol communication

Rahim¹

2018

J Appl Eng Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…The prime number is a positive integer a, where a ≥ 2 can only be divided by 1 and the number itself. The nature of division of integers gives birth to the concepts of prime numbers and modulo arithmetic [1,15,[17][18][19]. Most public-key algorithms use prime numbers as one of their parameter values [20,21].…”

Section: Prime Numbersmentioning

confidence: 99%

“…The problem that arises is that the prime number is infinite. Not only that, many numbers are glimpsed like primes, but in reality they are not [1,15]. This problem causes the search for prime numbers takes longer time for using as key in cryptography algorithms.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Pseudo-prime number simulation and its application for security purpose

et al. 2018

Self Cite

View full text Add to dashboard Cite

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.

show abstract

“…Cryptography method is one of the methods used to improve data security because it can perform the process of encryption and decryption. There are several encryption algorithms that are already open for study such as DES, AES, TwoFish, BlowFish, RC2, RC4, RC5, RSA [23], [24] (Rivest, Shamir, Adleman) and others. This study discusses the implementation of one time encryption algorithm pad and vigenere cipher to secure text messages [25], [26].…”

Section: Introductionmentioning

confidence: 99%

Combination Vigenere Cipher and One Time Pad for Data Security

Rahim¹,

Kurniasih²,

Mustamam³

et al. 2018

IJET

Self Cite

View full text Add to dashboard Cite

Data security can be done with many techniques such as steganography and cryptography, the use of cryptographic algorithms such as Vigenere Cipher and One Time Pad to secure the data is expected to make the data difficult to be known by irresponsible parties, the test obtained results that the ciphertext results of different combinations and strong enough because the key used must match the length of the plaintext.

show abstract

Prime Number: an Experiment Rabin-Miller and Fast Exponentiation

Cited by 6 publications

References 6 publications

Applied Pohlig-Hellman algorithm in three-pass protocol communication

Applied Pohlig-Hellman algorithm in three-pass protocol communication

Pseudo-prime number simulation and its application for security purpose

Combination Vigenere Cipher and One Time Pad for Data Security

Contact Info

Product

Resources

About