Please use this identifier to cite or link to this item: https://repository.unej.ac.id/xmlui/handle/123456789/111252
Full metadata record
DC FieldValueLanguage
dc.contributor.authorASTUTI, Lestari Fidi-
dc.contributor.authorSANTOSO, Kiswara Agung-
dc.contributor.authorKAMSYAKAWUNI, Ahmad-
dc.date.accessioned2022-12-21T15:49:23Z-
dc.date.available2022-12-21T15:49:23Z-
dc.date.issued2019-
dc.identifier.urihttps://repository.unej.ac.id/xmlui/handle/123456789/111252-
dc.description.abstractAffine cipher is a classic cryptographic algorithm substitution technique. Substitution technique is the encryption process for every character in the plaintext will be subtituted by another character. Affine cipher uses two types of keys. Each character of plaintext to be encrypted substituted by the same key. This research discusses about modify one of the key affine cipher, to produce a different key that will be substituted with each plaintext character. Key modifications are made by the Fibonacci sequence rules. This study also compares affine cipher and key modification affine cipher by finding corelation coeffiecient values. The results obtained from the comparison of the two algorithms, encryption that uses affine cipher key modification is better than affine cipher.en_US
dc.language.isoenen_US
dc.publisherMajalah Ilmiah Matematika dan Statistikaen_US
dc.subjectCryptographyen_US
dc.subjectAffine Cipheren_US
dc.subjectFibonaccien_US
dc.subjectCorrelation Valueen_US
dc.titlePengamanan Polyalphabetic dengan Affine Cipher Berdasarkan Barisan Fibonaccien_US
dc.typeArticleen_US
Appears in Collections:LSP-Jurnal Ilmiah Dosen

Files in This Item:
File Description SizeFormat 
Pengamanan Polyalphabetic Dengan Affine Cipher Berdasarkan Barisan Fibonacci.pdf3.08 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.