Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 3

ALGORITHM DESIGN OF ELGAMAL MAX-PLUS ALGEBRA FOR LETTER AND NUMBER CRYPTOGRAPHY WITH UNI-CUSTOM CIPHERTEXT

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 20 No. 4 (2026) · hlm. 3185–3196

DOI
10.30598/barekengvol20iss4pp3185-3196
ISSN
2615-3017, 1978-7227
Terbit
2026-08-24
Penerbit
PATTIMURA UNIVERSITY
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

This study focuses on the design and implementation of a prototype cryptographic algorithm using the integration of Uni-Custom ciphertext transformation and Max-Plus algebra in the ElGamal scheme. The integration is performed through a sequential process, where the Uni-Custom ciphertext transformation converts plaintext into a dynamic numeric form, and then we use the ElGamal max plus-based algorithm in the encryption process through a public-key mechanism. The primary objective of this research is to explore the feasibility and functional correctness of the proposed hybrid framework rather than to provide a complete cryptographic performance evaluation. The implementation results show that the system exhibits high computational and structural complexity. The security of the proposed system is associated with the hardness of the discrete logarithm problem in the ElGamal scheme, while additional transformation layers enhance variability and reduce pattern predictability. Experimental results show consistent reconstruction of the original message without data loss, indicating promising potential for the development of alternative cryptographic methods based on non-conventional mathematical structures.

Jaringan kolaborasi para penulis

3 penulis · 3 tautan kepenulisan bersama

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

  • Universitas Billfath
  • 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

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">ALGORITHM DESIGN OF ELGAMAL MAX-PLUS ALGEBRA FOR LETTER AND NUMBER CRYPTOGRAPHY WITH UNI-CUSTOM CIPHERTEXT</dc:title>
	<dc:creator>Sya'diyah, Zumrotus</dc:creator>
	<dc:creator>Salamah, Nur</dc:creator>
	<dc:creator>Alfiani, Faradilla</dc:creator>
	<dc:description xml:lang="en-US">This study focuses on the design and implementation of a prototype cryptographic algorithm using the integration of Uni-Custom ciphertext transformation and Max-Plus algebra in the ElGamal scheme. The integration is performed through a sequential process, where the Uni-Custom ciphertext transformation converts plaintext into a dynamic numeric form, and then we use the ElGamal max plus-based algorithm in the encryption process through a public-key mechanism. The primary objective of this research is to explore the feasibility and functional correctness of the proposed hybrid framework rather than to provide a complete cryptographic performance evaluation. The implementation results show that the system exhibits high computational and structural complexity. The security of the proposed system is associated with the hardness of the discrete logarithm problem in the ElGamal scheme, while additional transformation layers enhance variability and reduce pattern predictability. Experimental results show consistent reconstruction of the original message without data loss, indicating promising potential for the development of alternative cryptographic methods based on non-conventional mathematical structures.</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2026-08-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/22135</dc:identifier>
	<dc:identifier>10.30598/barekengvol20iss4pp3185-3196</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 20 No 4 (2026): BAREKENG: Journal of Mathematics and Its Application; 3185-3196</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol20iss4year2026</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/22135/13165</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2026 Zumrotus Sya'diyah, Nur Salamah, Faradilla Alfiani</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>