Prime Numbers Comparison using Sieve of Eratosthenes and Sieve of Sundaram Algorithm

Abdullah, Dahlan; Rahim, Robbi; Apdilah, Dicky; Efendi, Syahril; Tulus, T; Suwilo, Saib

doi:10.1088/1742-6596/978/1/012123

Cited by 9 publications

(9 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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

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

Section: Introductionmentioning

confidence: 99%

Combination Vigenere Cipher and One Time Pad for Data Security

Rahim¹,

Kurniasih²,

Mustamam³

et al. 2018

IJET

View full text Add to dashboard Cite

show abstract

“…An asymmetric algorithm is an algorithm where the encryption key used is different from the decryption key [7]- [10]. It is different from symmetric keys that use the same two keys during encryption and decryption process [11][12] [13]. The asymmetric key uses two keys, public and private key.…”

Section: Introductionmentioning

confidence: 99%

Comparative Analysis of RSA and ElGamal Cryptographic Public-key Algorithms

Siahaan¹

2018

Preprint

View full text Add to dashboard Cite

An asymmetric algorithm is an encryption technique that uses different keys on the process of encryption and decryption. This algorithm uses two keys, public key, and private key. The public key is publicly distributed while the private key is kept confidentially by the user and this key is required at the time of the decryption process. RSA and ElGamal are two algorithms that implement a public key cryptosystem. The strength of this algorithm lies in the bit length used. The degree of difficulty in RSA lies in the factorization of large primes while in ElGamal lies in the calculation of discrete logarithms. After testing, it is proven that RSA performs a faster encryption process than ElGamal. However, ElGamal decryption process is faster than RSA. Both of these algorithms are cryptographic public-key algorithms but have functions in different ways. RSA is a deterministic algorithm while ElGamal is a probabilistic algorithm.

show abstract

“…In this study the algorithm presented is based on converting engine problems to 2-machine problems. Based on testing and comparison with other relevant methods [19], [20], the proposed algorithm is offered as a competitive alternative to practical applications when solving n-jobs problems with m-machines. Rajendran and Ziegler (2013) [21] research was conducted to minimize the makepan in the flow shop problem using the ACO algorithm and the M-MMAS algorithm which is an additional version of the ACO algorithm.…”

Section: Introductionmentioning

confidence: 99%

Hybrid Ant Colony Optimization-Genetics Algorithm to Minimize Makespan Flow Shop Scheduling

Panggabean¹

2018

IJET

View full text Add to dashboard Cite

Flow shop scheduling is a scheduling model in which the job to be processed entirely flows in the same product direction / path. In other words, jobs have routing work together. Scheduling problems often arise if there is n jobs to be processed on the machine m, which must be specified which must be done first and how to allocate jobs on the machine to obtain a scheduled production process. In research of Zini, H and ElBernoussi, S. (2016) NEH Heuristic and Stochastic Greedy Heuristic (SG) algorithms. This paper presents modified harmony search (HS) for flow shop scheduling problems with the aim of minimizing the maximum completion time of all jobs (makespan). To validate the proposed algorithm this computational test was performed using a sample dataset of 60 from the Taillard Benchmark. The HS algorithm is compared with two constructive heuristics of the literature namely the NEH heuristic and stochastic greedy heuristic (SG). The experimental results were obtained on average for the dataset size of 20 x 5 to 50 x 10, that the ACO-GA algorithm has a smaller makespan than the other two algorithms, but for large-size datasets the ACO-GA algorithm has a greater makespan of both algorithms with difference of 1.4 units of time.

show abstract

Prime Numbers Comparison using Sieve of Eratosthenes and Sieve of Sundaram Algorithm

Cited by 9 publications

References 4 publications

Combination Vigenere Cipher and One Time Pad for Data Security

Combination Vigenere Cipher and One Time Pad for Data Security

Comparative Analysis of RSA and ElGamal Cryptographic Public-key Algorithms

Hybrid Ant Colony Optimization-Genetics Algorithm to Minimize Makespan Flow Shop Scheduling

Contact Info

Product

Resources

About