Mohammad Andri Budiman, Mohammad Andri
Unknown Affiliation

Published : 6 Documents
Articles

Found 4 Documents
Search

Penggunaan Algoritma RSA dengan Metode The Sieve of Eratosthenes dalam Enkripsi dan Deskripsi Pengiriman Email

Seminar Nasional Aplikasi Teknologi Informasi (SNATI) 2013
Publisher : Jurusan Teknik Informatika, Fakultas Teknologi Industri, Universitas Islam Indonesia

Show Abstract | Original Source | Check in Google Scholar

Abstract

Dewasa ini sistem informasi semakin berkembang. Hal ini dapat dilihat dari kemajuan teknologi dalam proses komunikasi yang dapat dilakukan secara jarak jauh dari dua tempat yang berbeda. Perkembangan teknologi telekomunikasi dengan menggunakan komputer menyebabkan mobilitas masyarakat semakin baik karena komunikasi bisa dilakukan tanpa perlu interaksi langsung satu sama lain. Berbagai jenis layanan komunikasi tersedia di internet seperti pengiriman pesan melalui email yang semakin diminati oleh masyarakat. Meningkatnya pemanfaatan layanan e-mail melalui internet menyebabkanpermasalahan juga bermunculan selain permasalahan adanya hacker dan cracker. Hal tersebut sangat memungkinkan pesan yang dikirim dapat disadap dan diubah oleh pihak lain. Salah satu bentuk pencegahan kejahatan di internet adalah dengan menggunakan algoritma kunci publik RSA, yaitu dengan cara mengenkripsi pesan yang akan dikirim menggunakan kunci publik yang telah dibangkitkan oleh pihak pengirim. Cara ini akan memperkuat tingkat keamanan pesan yang dikirim dalam suatu jaringan internet selama kunci privat terjaga kerahasiaannya. Oleh karena itu, algoritma RSA akan diterapkan pada suatu perangkat lunak yang dirancang dan dibuat mengunakan bahasa pemrograman Visual Basic .NET 2008 sebagai sarana untuk meningkatkan keamanan pengiriman pesan.

On Factoring The RSA Modulus Using Tabu Search

Data Science: Journal of Computing and Applied Informatics Vol 1 No 1 (2017): Data Science: Journal of Computing and Applied Informatics (JoCAI)
Publisher : Talenta Publisher

Show Abstract | Original Source | Check in Google Scholar

Abstract

It is intuitively clear that the security of RSA cryptosystem depends on the hardness of factoring a very large integer into its two prime factors. Numerous studies about integer factorization in the field of number theory have been carried out, and as a result, lots of exact factorization algorithms, such as Fermat’s factorization algorithm, quadratic sieve method, and Pollard’s rho algorithm have been found. The factorization problem is in the class of NP (non-deterministic polynomial time). Tabu search is a metaheuristic in the field of artificial intelligence which is often used to solve NP and NP-hard problems; the result of this method is expected to be close-to-optimal (suboptimal). This study aims to factorize the RSA modulus into its two prime factors using tabu search by conducting experiments in Python programming language and to compare its time performance with an exact factorization algorithm, i.e. Pollard’s algorithm. The primality test is done with Lehmann’s algorithm.

Implementation and comparison of Berry-Ravindran and Zhu- Takaoka exact string matching algorithms in Indonesian-Batak Toba dictionary

Data Science: Journal of Computing and Applied Informatics Vol 1 No 1 (2017): Data Science: Journal of Computing and Applied Informatics (JoCAI)
Publisher : Talenta Publisher

Show Abstract | Original Source | Check in Google Scholar

Abstract

Indonesia has a variety of local languages, which is the Batak Toba language. This time, there are still some Batak Toba people who do not know speak Batak Toba language fluently. Nowadays, desktop based dictionary is one of reference that very efficiently used to learn a language and also to increase vocabulary. In making the dictionary application, string matching can be implemented for word-searching process. String matching have some algorithm, which is Berry – Ravindran algorithm and Zhu-Takaoka algorithm and will be implemented on the dictionary application. Zhu-Takaoka algorithm and Berry – Ravindran algorithm have two phases, which are the preprocessing phase and the searching phase. Preprocessing phase is a process to make the shifting values according to in pattern that input by user. To know the shifting value with Zhu-Takaoka algorithm, it’s need Zhu-Takaoka Bad Character (Ztbc) and Boyer-Moore Good Suffix (Bmgs). Then, Ztbc will be compared to Bmgs to get the maximum value of them that will be set as shifting value. While Berry-Ravindran algorithm, to know the shifting value is needed Berry-Ravindran Bad Character, which the two characters right of the text at the position m + 1 and m+ 2, is needed to determine the shifting value, where m is length of the pattern.

Using random search and brute force algorithm in factoring the RSA modulus

Data Science: Journal of Computing and Applied Informatics Vol 2 No 1 (2018): Data Science: Journal of Computing and Applied Informatics (JoCAI)
Publisher : Talenta Publisher

Show Abstract | Original Source | Check in Google Scholar

Abstract

Abstract. The security of the RSA cryptosystem is directly proportional to the size of its modulus, n. The modulus n is a multiplication of two very large prime numbers, notated as p and q. Since modulus n is public, a cryptanalyst can use factorization algorithms such as Euler’s and Pollard’s algorithms to derive the private keys, p and q. Brute force is an algorithm that searches a solution to a problem by generating all the possible candidate solutions and testing those candidates one by one in order to get the most relevant solution. Random search is a numerical optimization algorithm that starts its search by generating one candidate solution randomly and iteratively compares it with other random candidate solution in order to get the most suitable solution. This work aims to compare the performance of brute force algorithm and random search in factoring the RSA modulus into its two prime factors by experimental means in Python programming language. The primality test is done by Fermat algorithm and the sieve of Eratosthenes.