Studi Kasus Penggunaan Algoritma RSA Sebagai Algoritma Kriptografi yang Aman
DOI:
https://doi.org/10.30872/jim.v4i3.43Abstract
RSA mendasarkan proses enkripsi dan dekripsinya pada konsep bilangan prima dan aritmetika modulo. Baik kunci enkripsi maupun dekripsi keduanya merupakan bilangan bulat. Kunci enkripsi tidak dirahasiakan dan diberikan kepada umum (sehingga disebut dengan kunci publik), namun kunci untuk dekripsi bersifat rahasia (kunci privat). Kunci privat dibangkitkan dari beberapa buah bilangan prima bersama-sama dengan kunci enkripsi. Untuk menemukan kunci dekripsi, orang harus memfaktorkan suatu bilangan non prima menjadi faktor primanya. Kenyataannya, memfaktorkan bilangan non prima menjadi faktor primanya bukanlah pekerjaan yang mudah. Belum ada algoritma yang mangkus (efisien) yang ditemukan untuk pemfaktoran itu. Semakin besar bilangan non primanya, tentu semakin sulit pula pemfaktorannya. Semakin sulit
pemfaktorannya, semakin kuat pula algoritma RSA. Sistem RSA sekarang digunakan oleh berbagai macam jenis produk, platform, dan industri di seluruh bagian dunia. Algoritma RSA digunakan dalam banyak perangkat lunak yang dijual secara komersial dan direncanakan akan digunakan pada banyak perangkat lunak lainnya. Algoritma RSA terpasang dalam sistem operasi pada hari ini oleh Microsoft, Apple, Sun, dan Novell. Tentang perangkat keras, algoritma RSA juga dapat ditemukan pemanfaatannya dalam telefon yang aman, dalam kartu-kartu jaringan Ethernet, dan dalam kartu-kartu cerdas
(smart cards). Sebagai tambahan, algoritma RSA tergabung ke dalam semua protokol-protokol utama untuk komunikasi internet yang kokoh, termasuk S/MIME, SSL, dan S/WAN. Algoritma RSA juga dimanfaatkan secara internal oleh banyak lembaga, termasuk cabang-cabang dari Pemerintah Amerika Serikat (AS), badan-badan hukum utama, perpustakaan-perpustakaan nasional dan universitas-universitas.
References
Cheswick , Bill, 1991. An Evening with Berferd: in which a cracker is lured, endured, and studied,” ebook online.
Carol, John, 1979. Computer Security, California Security World Publishing co. inc.
CERT, 2000. CERT Advisory, CA-99-01-Trojan-TCP-Wrappers,
http://www.cert.org/advisories/CA-99-01-Trojan-TCP-Wrappers.html
Fausett, J. A. , 1994. Fundamentals of Neural Network, Architecture, Algorithm and Applications, Prentince-Hall Inc, New Jersey.
RSA - Wikipedia Indonesia, ensiklopedia bebas berbahasa Indonesia. (2006).
http://id.wikipedia.org/wiki/RSA
RSA Security - 3_1 RSA. 2006. RSA Algoritm http://www.rsasecurity.com/rsalabs/node.asp?id=2213.
Munir, Rinaldi. 2006. Bahan Kuliah IF2153 Matematika Diskrit. Departemen Teknik Informatika, Institut Teknologi Bandung
Nikita Borisov, Ian Goldberg, and David Wagner, Intercepting Mobile Communications: The Insecurity of 802.11. Juga dapat diperoleh dari
www.isaac.cs.berkeley.edu/isaac/mobicom.pdf
Richard H. Baker, 1995. Network Security: how to plan for it and achieve it, McGraw-Hill International.
Steinke, Steve., 2002. Security and 802.11 Wireless Networks, Network Computing Asia, Aug, 2002. pp. 46-47.
Steven M. Bellovin, “Security Problems in TCP/IP Protocol Suite,” Computer Communication Review, Vol. 19, No. 2, pp. 32-48, 1989.
Downloads
Published
Issue
Section
License
Copyright Transfer StatementThe copyright of this article is transferred to Informatika Mulawarman : Jurnal Ilmiah Ilmu Komputer and when the article is accepted for publication. the authors transfer all and all rights into and to paper including but not limited to all copyrights in the Informatika Mulawarman. The author represents and warrants that the original is the original and that he/she is the author of this paper unless the material is clearly identified as the original source, with notification of the permission of the copyright owner if necessary. The author states that he has the authority and authority to make and carry out this task.
The author states that:
- This paper has not been published in the same form elsewhere.
- This will not be submitted elsewhere for publication prior to acceptance/rejection by this Journal.
A Copyright permission is obtained for material published elsewhere and who require permission for this reproduction. Furthermore, I / We hereby transfer the unlimited publication rights of the above paper to Informatika Mulawarman : Jurnal Ilmiah Ilmu Komputer. Copyright transfer includes exclusive rights to reproduce and distribute articles, including reprints, translations, photographic reproductions, microforms, electronic forms (offline, online), or other similar reproductions.
The author's mark is appropriate for and accepts responsibility for releasing this material on behalf of any and all coauthor. This Agreement shall be signed by at least one author who has obtained the consent of the co-author (s) if applicable. After the submission of this agreement is signed by the author concerned, the amendment of the author or in the order of the author listed shall not be accepted.
Rights / Terms and Conditions Saved
- The author keeps all proprietary rights in every process, procedure, or article creation described in Work.
- The author may reproduce or permit others to reproduce the work or derivative works for the author's personal use or for the use of the company, provided that the source and the Informatika Mulawarman copyright notice are indicated, the copy is not used in any way implying the Journal of Informatika Mulawarman (JIM) approval of the product or service from any company, and the copy itself is not offered for sale.
- Although authors are permitted to reuse all or part of the Works in other works, this does not include granting third-party requests to reprint, republish, or other types of reuse.
Informatika Mulawarman by http://e-journals.unmul.ac.id/index.php/JIM/index is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
under the CC BY-SA license, authors and other users are able to reprint, distribute or use the material for commercial purposes so long as they give attribution to the journal Informatika Mulawarman and license the republished material under the same license.
