Abstract
Polyalphabetic cipher cryptosystem is the study of mathematical techniques that related to aspects of information security such as confidentiality, data integrity, authentication and authentication of data origin. With the internet, long distance communication can be done quickly and cheaply. However, the internet is not very secure because it is a public communication medium that can be used by anyone so it is very vulnerable to information tapping. Cryptography has been widely used in life for example banking atm ATMs, account numbers sacrificed, sending secret military messages. By applying polyalphabetic cipher cryptosystems, pins, account numbers and secret messages sent will be more secure and the information will not be easily known. Keywords: polyalphabetic cipher cryptosystem, banking, pin
Highlights
Polyalphabetic cipher cryptosystem is the study of mathematical techniques that related to aspects of information security such as confidentiality, data integrity, authentication and authentication of data origin
The internet is not very secure because it is a public communication medium that can be used by anyone so it is very vulnerable to information tapping
Cryptography has been widely used in life for example banking atm ATMs, account numbers sacrificed, sending secret military messages
Summary
Kriptosistem polyalphabetic cipher merupakan studi tentang teknik-teknik matematika yang berhubungan dengan aspek-aspek pengamanan informasi seperti kerahasiaan, keutuhan data, otentikasi dan otentikasi asal data. Namun internet tidak terlalu aman karena merupakan media komunikasi umum yang dapat digunakan oleh siapapun sehingga sangat rawan terhadap penyadapan informasi. Dalam kaitannya dengan keamanan salah satu topik yang menarik pada teori graf yang dapat digunaka adalah kriptositem polyalphabetic cipher. Dalam teori graf kriptosistem polyalphabetic cipher (kriptografi) merupakan studi tentang teknik-teknik matematika yang berhubungan dengan aspek-aspek pengamanan informasi seperti kerahasiaan (confidentiality), keutuhan data (data integrity), otentikasi entitas (enity authentication) dan otentikasi asal data (data origin authenrication). Untuk d = 0 kita telah membuktikan bahwa graf H memiliki pelabelan titik (4,1)-sisi antimagic pada teorema 4.1.4. Untuk d = 2 kita juga telah membuktikan bahwa graf H memiliki pelabelan titik (4,1)-sisi antimagic pada teorema 5.1. Jika didefinisikan sebagai bobot sisi pelabelan total graf H berdasarkan penjumlahan bobot sisi dengan label sisinya maka maka dapat dikatakan bahwa membentuk barisan aritmatika dengan suku awal yang ada pada fungsi dan beda 2 (dua), sehingga kita dapat menentukan bobot sisi terbesar berada pada fungsi dengan mensubstitusikan nilai awal dan nilai ke persamaan dan didapatkan
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Jurnal Axioma : Jurnal Matematika dan Pembelajaran
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
