Show simple item record

dc.contributor.advisorMawengkang, Herman
dc.contributor.advisorNasution, Benny Benyamin
dc.contributor.authorRahim, Robbi
dc.date.accessioned2022-11-11T04:04:43Z
dc.date.available2022-11-11T04:04:43Z
dc.date.issued2016
dc.identifier.urihttps://repositori.usu.ac.id/handle/123456789/58044
dc.description.abstractThree 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.isoiden_US
dc.publisherUniversitas Sumatera Utaraen_US
dc.subjectThree Pass Protocolen_US
dc.subjectPohlig-Hellmanen_US
dc.subjectRandom Numbersen_US
dc.subjectModulo Inversen_US
dc.titleAlgoritma Pohlig-Hellman pada Skema Three Pass Protocolen_US
dc.typeThesisen_US
dc.identifier.nimNIM137038043
dc.identifier.nidnNIDN 8859540017
dc.identifier.kodeprodiKODEPRODI55101#TeknikInformatika
dc.description.pages80 Halamanen_US
dc.description.typeTesis Magisteren_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record