ANALISA KEAMANAN ALGORITME RSA MENGGUNAKAN METODE ALGORITME FERMAT’S FAKTORISASI DAN POLLARD’S RHO
| Main Author: | Fitriyansyah, Ilham |
|---|---|
| Format: | Thesis NonPeerReviewed Book |
| Bahasa: | eng |
| Terbitan: |
, 2018
|
| Subjects: | |
| Online Access: |
http://eprints.umm.ac.id/39595/1/PENDAHULUAN.pdf http://eprints.umm.ac.id/39595/2/BAB%20I.pdf http://eprints.umm.ac.id/39595/3/BAB%20II.pdf http://eprints.umm.ac.id/39595/4/BAB%20III.pdf http://eprints.umm.ac.id/39595/5/BAB%20IV.pdf http://eprints.umm.ac.id/39595/6/BAB%20V.pdf http://eprints.umm.ac.id/39595/7/LAMPIRAN.pdf http://eprints.umm.ac.id/39595/ |
Daftar Isi:
- This study aims to analyze security rsa algorithm standard by means of the key factor public n uses the method fermats faktorisasi and pollards rho .Cryptanalysis by a factor of or faktorization used the key public n = p * q who do not kept secret for in break all the public key , because if the public n can be in factors and the prime factors p and q found so very large private key can be counted and found .If the key factors public n managed to be p and q so ( n ) = ( p-1 ) ( q-1 ) can be counted and used the key in public e , will be able to private key is solved .A method of fermats faktorization and pollards rho is the algorithms that included in the attack faktorization algorithm .Rsa algorithm having many security gap faktorization one of which is the attack .The results of the study shows the raising of a key that in get up with meet n=p<q<2p can strengthen prime factors . This is further strengthened of all testing uses the method fermats faktorization and pollards rho not all a factor of public key n can were found dumped in easily.