Algoritma Pohlig-Hellman pada Skema Three Pass Protocol
dc.contributor.advisor | Mawengkang, Herman | |
dc.contributor.advisor | Nasution, Benny Benyamin | |
dc.contributor.author | Rahim, Robbi | |
dc.date.accessioned | 2022-11-11T04:04:43Z | |
dc.date.available | 2022-11-11T04:04:43Z | |
dc.date.issued | 2016 | |
dc.identifier.uri | https://repositori.usu.ac.id/handle/123456789/58044 | |
dc.description.abstract | Three Pass Protocol is a method or technique that can be used by 2 (two) the sender and receiver of the message to communicate with each other using XOR function, problems that occur is when the communication process there are those who can find the message that is sent from the sender to the receiver. To resolve these problems required an algorithm in this case the algorithm pohlig-Hellman, the use of algorithms Pohlig-Hellman in Three Pass Protocol ensure the security of messages sent sender to receiver because each sender and receiver use the key p, e, and d is the number random and d is the inverse of a modulo p and e of the sender and recipient, the results of this penelitian declare it impossible for the attackers or kripanalis know the correct message quickly despite having adequate computer resources. | en_US |
dc.language.iso | id | en_US |
dc.publisher | Universitas Sumatera Utara | en_US |
dc.subject | Three Pass Protocol | en_US |
dc.subject | Pohlig-Hellman | en_US |
dc.subject | Random Numbers | en_US |
dc.subject | Modulo Invers | en_US |
dc.title | Algoritma Pohlig-Hellman pada Skema Three Pass Protocol | en_US |
dc.type | Thesis | en_US |
dc.identifier.nim | NIM137038043 | |
dc.identifier.nidn | NIDN 8859540017 | |
dc.identifier.kodeprodi | KODEPRODI55101#TeknikInformatika | |
dc.description.pages | 80 Halaman | en_US |
dc.description.type | Tesis Magister | en_US |
Files in this item
This item appears in the following Collection(s)
-
Master Theses [620]
Tesis Magister