Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 3

A NOVEL PUBLIC-KEY CRYPTOGRAPHY SCHEME UTILIZING SKEW CIRCULANT MATRICES WITH GENERALIZED ALTERNATING FIBONACCI

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 20 No. 1 (2025) · hlm. 0657–0672

DOI
10.30598/barekengvol20iss1pp0657-0672
ISSN
2615-3017, 1978-7227
Terbit
2025-11-24
Penerbit
PATTIMURA UNIVERSITY
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

Circulant and skew circulant matrices play a significant role in various applications, especially in cryptography. Their determinants and inverses can be used in the decryption process. In classical cryptography, the Hill cipher is known to be susceptible to known-plaintext attacks and requires matrix-based key transmission. This study introduces a new public-key cryptography scheme that combines the Hill cipher with the ElGamal technique, utilizing skew circulant matrices with generalized alternating Fibonacci numbers. These numbers provide a pattern that simplifies the explicit formulas of the determinant and inverse of the matrices. The proposed scheme is the first of its kind to use these matrices and numbers for public-key cryptography. Explicit formulas for the determinant and inverse of these matrices are derived using elementary row and column operations. The proposed scheme is resistant to the discrete logarithm problem, known-plaintext, and brute-force attacks and requires only the transmission of key parameters. The implementation of the scheme has been tested using Wolfram Mathematica. In practice, the computational time of the scheme is significantly faster than three other related schemes, with up to 500 times faster in encryption and 17 times faster in decryption.

Jaringan kolaborasi para penulis

14 penulis · 21 tautan kepenulisan bersama · 1 lintas organisasi

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • IPB University
  • Universitas Pamulang
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Azhar Janjang DarmawanIPB University2
Dhea EkaputriIPB University2
Euis ApriantiUniversitas Pamulang1
Bib Paruhum SilalahiIPB University1
Ulil Albab Mu'minIPB University1
Toni BakhtiarIPB University1
Farida HanumIPB University1
Afdhal AhkrizalIPB University1
E. H. NUGRAHANIIPB University1
Endar Hasafah NugrahaniIPB University1
Trianty Putri BlanteIPB University1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) https://ojs3.unpatti.ac.id/index.php/barekeng/oai, pertama di-harvest 5 Nov 2026, terakhir terlihat 15 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">A NOVEL PUBLIC-KEY CRYPTOGRAPHY SCHEME UTILIZING SKEW CIRCULANT MATRICES WITH GENERALIZED ALTERNATING FIBONACCI</dc:title>
	<dc:creator>Handoyo, Sapto Mukti</dc:creator>
	<dc:creator>Guritman, Sugi</dc:creator>
	<dc:creator>Jaharuddin, Jaharuddin</dc:creator>
	<dc:description xml:lang="en-US">Circulant and skew circulant matrices play a significant role in various applications, especially in cryptography. Their determinants and inverses can be used in the decryption process. In classical cryptography, the Hill cipher is known to be susceptible to known-plaintext attacks and requires matrix-based key transmission. This study introduces a new public-key cryptography scheme that combines the Hill cipher with the ElGamal technique, utilizing skew circulant matrices with generalized alternating Fibonacci numbers. These numbers provide a pattern that simplifies the explicit formulas of the determinant and inverse of the matrices. The proposed scheme is the first of its kind to use these matrices and numbers for public-key cryptography. Explicit formulas for the determinant and inverse of these matrices are derived using elementary row and column operations. The proposed scheme is resistant to the discrete logarithm problem, known-plaintext, and brute-force attacks and requires only the transmission of key parameters. The implementation of the scheme has been tested using Wolfram Mathematica. In practice, the computational time of the scheme is significantly faster than three other related schemes, with up to 500 times faster in encryption and 17 times faster in decryption.</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2025-11-24</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/18790</dc:identifier>
	<dc:identifier>10.30598/barekengvol20iss1pp0657-0672</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 20 No 1 (2026): BAREKENG: Journal of Mathematics and Its Application; 0657-0672</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol20iss1year2026</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/18790/11805</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2025 Sapto Mukti Handoyo, Sugi Guritman, Jaharuddin Jaharuddin</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>