Determinan Matriks Segitiga Atas Bentuk Khusus Ordo 3×3 Berpangkat Bilangan Bulat Positif Menggunakan Kofaktor

Rahma, Ade Novia; Rahmawati, Rahmawati; Vitho, Ricken Husnudzan

doi:10.24014/jsms.v6i2.10524

Cited by 2 publications

(3 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…While the cofactor of which is symbolized by is . The determinant of the matrix A, can be calculated by multiplying the entries in any row or column by their cofactors and adding up the product where and (Rahma, Rahmawati, & Vitho, 2020) If A and B are square matrices and if matrix B can be found such that AB = BA = I, then A is said to be invertible and B is called the inverse of A and can be written . And the inverse of matrix A can be calculated by (Rahma et al, 2022).…”

Section: Matrixmentioning

confidence: 99%

Key analysis of the hill cipher algorithm (Study of literature)

Sujarwo

2024

Mandiri

View full text Add to dashboard Cite

The security of the data (message) sent is very important in maintaining the confidentiality of the message. Many algorithms can be used to secure messages. Among them is the Hill Cipher algorithm. The Hill Cipher algorithm is a classic cryptographic algorithm. This algorithm uses a square matrix key. In connection with the Hill Cipher algorithm key, this literature aims to examine the matrix that can be used as a key in the encryption and decryption process in the Hill Cipher algorithm. In this literature, we take a square matrix of order 3x3 and use 36 characters (A-Z, 0-9). To produce cipher text, the method used is to carry out an encryption process based on the Hill Cipher algorithm. The encryption process is carried out by multiplying the key matrix by the plaintext. The decryption process to get the plain text back is done by multiplying the ciphertext by the inverse modulo matrix of the key matrix. The encryption process can always be carried out, but not all decryption processes can be carried out. Because not all matrices can be used as key matrices. The results of this literature show that the key matrix must be a matrix of order mxm. A matrix with determinant value = 0 cannot be used as a key. Likewise, a matrix whose determinant value is not relatively prime with the number of characters to be encrypted or decrypted cannot be used as a key matrix

show abstract

Section: Matrixmentioning

confidence: 99%

Key analysis of the hill cipher algorithm (Study of literature)

Sujarwo

2024

Mandiri

View full text Add to dashboard Cite

show abstract

“…1 = 1 = 1 2 1 + 3 = 4 = 2 2 1 + 3 + 5 = 9 = 3 2 1 + 3 + 5 + 7 = 16 = 4 2 ⋮ 1 + 3 + 5 + ⋯ + (2𝑛 − 1) = 𝑛 2 Secara aljabar rumus jumlah yang dinyatakan pada (1) dapat dibuktikan sebagai berikut:…”

Section: Aunclassified

“…Berdasarkan kepustakaan dari Aryani dan Marzuki [2], Induksi Matematika adalah salah satu metode pembuktian dari banyak teorema dalam teori bilangan maupun dalam bidang Matematika lainnya dan argumentasi pembuktian suatu teorema Matematika yang semesta pembicaraannya adalah himpunan bilangan asli. Metode ini sering digunakan dalam menunjukkan kebenaran dari suatu pernyataan yang diberikan dengan menyangkut bilangan asli.…”

Section: Aunclassified

Penerapan Logika Matematika dalam Menyelidiki Validitas Induksi Matematik untuk Pembuktian yang Melibatkan Proposisi Bilangan Asli dengan Berbagai Kasus

Anugerah¹,

Gunawan²,

Respitawulan³

2023

BCSM

View full text Add to dashboard Cite

Abstract. Problems involving natural number propositions can not only be proved algebraically, but can also be proved using mathematical induction. Mathematical Induction is a method of proving many theorems, both in number theory and in other fields of mathematics. The problems are how the logical arguments of mathematical induction are arranged, how the validity of the logical arguments of the principle of mathematical induction, and what examples of cases are natural number propositions and can be proven by the principle of mathematical induction. In this article, we will show how the construction of a logical argument from mathematical induction will be shown, and its validity will also be shown with various examples. Abstrak. Permasalahan yang melibatkan proposisi bilangan asli tidak hanya dapat dibuktikan secara aljabar, namun dapat juga dibuktikan dengan menggunakan induksi matematika. Induksi Matematika merupakan salah satu metode pembuktian dari banyak teorema, baik dalam teori bilangan maupun dalam bidang matematika lainnya. Adapun permasalahannya adalah bagaimana susunan logika argumen dari induksi matematika, bagaimana validitas dari logika argumen prinsip induksi matematika, dan contoh kasus apa saja yang merupakan proposisi bilangan asli dan dapat dibuktikan dengan prinsip induksi matematika. Dalam artikel ini akan diperlihatkan bagaimana konstruksi susunan logika argumen dari induksi matematika, juga diperlihatkan validitas berikut berbagai contohnya.

show abstract

Determinan Matriks Segitiga Atas Bentuk Khusus Ordo 3×3 Berpangkat Bilangan Bulat Positif Menggunakan Kofaktor

Cited by 2 publications

References 1 publication

Key analysis of the hill cipher algorithm (Study of literature)

Key analysis of the hill cipher algorithm (Study of literature)

Penerapan Logika Matematika dalam Menyelidiki Validitas Induksi Matematik untuk Pembuktian yang Melibatkan Proposisi Bilangan Asli dengan Berbagai Kasus

Contact Info

Product

Resources

About