Article Per Year (5 Year)
p-Index From 2019 - 2024
1.383
P-Index
This Author published in this journals
All Journal Indonesian Journal on Computing (Indo-JC) International Journal of Computing Science and Applied Mathematics Charity : Jurnal Pengabdian Masyarakat I-Com : Indonesian Community Journal eProceedings of Engineering Community Service Seminar and Community Engagement (COSECANT)
Muhammad Arzaki
Universitas Telkom, Indonesia
Agriculture, Biological Sciences & Forestry Arts Humanities Computer Science & IT Control & Systems Engineering Economics, Econometrics & Finance Education Electrical & Electronics Engineering Engineering Environmental Science Industrial & Manufacturing Engineering Mathematics Public Health Social Sciences Other

Published : 11 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 11 Documents
Search

 1   2 
Elementary Algorithms Analysis of Megrelishvili Protocol Muhammad Arzaki
Indonesia Journal on Computing (Indo-JC) Vol. 1 No. 1 (2016): March, 2016
Publisher : School of Computing, Telkom University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21108/INDOJC.2016.1.1.52

Abstract

This article presents an investigation of asymptotic time complexities of several algorithms related to Megrelishvili protocol. The analysis are carried out for the private keys computations and public exchange of values, public key constructions, as well as an elementary exhaustive search attack algorithm. We show that the complexities of these algorithms are higher than the complexities of elementary algorithms involved in the conventional Diffie - Hellman protocol (DHP) or its variant on elliptic curves (ECDHP). This condition also implies that Megrelishvili protocol is more secure than DHP and ECDHP against exhaustive search attack.
On the Generalizations of Megrelishvili Protocol for Group Key Distribution Muhammad Arzaki
Indonesia Journal on Computing (Indo-JC) Vol. 2 No. 2 (2017): September, 2017
Publisher : School of Computing, Telkom University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21108/INDOJC.2017.2.2.179

Abstract

This article presents an extension of our previous research in <cite>AW17</cite> where we propose two variants of Megrelishvili key distribution schemes and investigate some of their elementary theoretical security analysis. We briefly discuss the two protocols in <cite>AW17</cite> and propose another two schemes which are more efficient than the preceding ones. Additionally, we also devise efficient procedures for constructing a new mutual key if the group membership is altered. Furthermore, we discuss the security of the protocols rigorously and we provide a sufficient condition for breaking the protocols by way of solving several instances of Megrelishvili vector-matrix problems (MVMP). We prove that the secret group key can be recovered easily if an attacker can express the sum of the secret exponents of the participants as a linear combination of the secret exponents excerpted from the transmission. Based on this result, we reason that our Megrelishvili key distribution schemes are theoretically at least as secure as the standard two-party Megrelishvili key exchange procedure.
Elementary Analysis of the Communication Complexity of Divide-and-Conquer Diffie-Hellman Key Agreement Protocol Muhammad Arzaki
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol 8, No 2 (2022)
Publisher : Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/j24775401.v8i2.13414

Abstract

We present a rigorous elementary analysis of the communication complexity of the Divide-and-Conquer Diffie-Hellman Key Agreement Protocol (DC-DHKA). The analysis is conducted by first determining the number of transmissions in DC-DHKA and then comparing the resulting communication complexity of this protocol with other variants of Diffie-Hellman key agreement protocols that utilize regular Diffie-Hellman key, namely the ING, GDH.1, GDH.2, and GDH.3 protocols. The mathematical and numerical analyses show that the total number of bits transmitted in the DC-DHKA protocol is always fewer than those of ING, GDH.1, and GDH.2 protocols for a group of N >= 19 participants. In addition, we also prove that the total number of bits required for the entire messages’ transmissions in DC-DHKA protocol for N participants that uses the multiplicative group Fq* is log2(q) 2^(log2(N)) (log2(N) + 1) - 2.
Solving Yin-Yang Puzzles Using Exhaustive Search and Prune-and-Search Algorithms Made Indrayana Putra; Muhammad Arzaki; Gia Septiana Wulandari
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol 8, No 2 (2022)
Publisher : Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/j24775401.v8i2.13720

Abstract

We investigate some algorithmic and mathematical aspects of Yin-Yang/Shiromaru-Kuromaru puzzles. Specifically, we discuss two algorithms for solving arbitrary Yin-Yang puzzles, namely the exhaustive search approach and the prune-and-search technique. We show that both algorithms have an identical asymptotic running time of O(max{mn, 2^(mn−h)}) for finding all solutions of a Yin-Yang instance with h hints of size m x n. Nevertheless, our experiments show that the practical running time of the prune-and-search technique outperforms the conventional exhaustive search approach.
Korelasi antara Nilai Latihan Soal Berpikir Komputasional dan Hasil Tantangan Bebras pada Siswa sebagai Bagian dari Peningkatan Kesiapan Guru dalam Gerakan PANDAI Muhammad Arzaki; Ema Rachmawati; Ade Romadhony; Bambang Pudjoatmodjo; Dodi Wisaksono Sudiharto; Putu Harry Gunawan; Agung Toto Wibowo; Selly Meliana; Rimba Whidiana Whidiana Ciptasari; Fazmah Arif Yulianto; Fat’hah Noor Prawira; Bedy Purnama
Charity : Jurnal Pengabdian Masyarakat Vol 5 No 2a (2022): Special Issue
Publisher : PPM Universitas Telkom

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25124/charity.v5i2a.5071

Abstract

Salah satu konsep dasar dalam pembelajaran Informatika adalah Berpikir Komputasional (BK) yang merupakan cara berpikir dan menyelesaikan masalah secara sistematis dan logis. Pada September-Desember 2021, Biro Bebras Universitas Telkom mengadakan rangkaian kegiatan pengabdian kepada masyarakat melalui gerakan PANDAI (Pengajar untuk Era Digital Indonesia) dengan tujuan untuk meningkatkan kompetensi guru dalam mengintegrasikan BK pada mata pelajaran yang diampunya. Untuk mengukur keberhasilan rangkaian lokakarya yang telah dilaksanakan, dilakukan analisis secara kuantitatif terhadap korelasi antara nilai yang diperoleh siswa ketika latihan terbimbing dengan guru dan nilai yang diperoleh siswa pada tantangan Bebras. Dari hasil analisis yang dilakukan terhadap 242 siswa, diperoleh nilai rata-rata latihan terbimbing adalah 73,28 dan nilai rata-rata tantangan Bebras adalah 38,65. Perbedaan nilai yang cukup signifikan ini juga didukung oleh fakta bahwa korelasi antara nilai latihan terbimbing dan nilai tantangan Bebras adalah sebesar 0,189.
Solving Tatamibari Puzzle Using Exhaustive Search Approach Enrico Christopher Reinhard; Muhammad Arzaki; Gia Septiana Wulandari
Indonesia Journal on Computing (Indo-JC) Vol. 7 No. 3 (2022): December, 2022
Publisher : School of Computing, Telkom University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.34818/INDOJC.2022.7.3.675

Abstract

Tatamibari is a puzzle that was first published in 2004 and was proven to be NP-complete in 2020. However, to the best of our knowledge, algorithmic investigation of the Tatamibari puzzle is relatively new and limited. There are discussions about an approach for solving the Tatamibari puzzle using the Z3 SMT solver, but there are no details regarding the steps of the algorithm as well as its explicit asymptotic upper bound. In addition, this solver requires an additional library that cannot be directly executed using standard libraries in an arbitrary imperative programming language. Hence, this paper discusses an exhaustive search approach for solving an arbitrary Tatamibari puzzle. We show that this algorithm can find all solutions to an \(m \times n\) Tatamibari instance with \(h\) hints in \(O(\max\{m^2 n^2, h^{mn-h} \cdot hmn\})\) time. We also use this algorithm to find the number of possible Tatamibari solutions in an \(m \times n\) grid for some small values of \(m\) and \(n\).
Secure and Space Efficient Accounts Storage System Using Three-Dimensional Bloom Filter Muhammad Arzaki; Raissa Henardianti Hanifa; Farah Afianti
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol 9, No 1 (2023)
Publisher : Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/j24775401.v9i1.12978

Abstract

This paper investigates the application of a three dimensional Bloom Filter (3DBF) to accomplish a secure and efficient accounts storage system by exploiting hashes of usernames and their corresponding passwords. We conducted numerical experiments and mathematical analysis to study the efficiency level of several 3DBF schemes. Our experimental results and analysis show that the level of occupancy for 3DBF is positively correlated to the value of its false positive rate, viz., if the occupancy level increases then so does the value of the false positive rate. Moreover, we also derive a formula for determining the minimum number of bits for storing some data in a 3DBF scheme given the value of its acceptable false positive rate and its occupancy level. We infer that the product of the dimensional parameter of a 3DBF scheme is inversely proportional to the false positive rate and occupancy level used in the scheme.
Model Formal Dan Verifikasi Sistem Layanan Presensi Rfid Dengan Logika Temporal: Studi Kasus Di Universitas Telkom, Indonesia Damar Huda; Yanti Rusmawati; Muhammad Arzaki
eProceedings of Engineering Vol 4, No 3 (2017): Desember, 2017
Publisher : eProceedings of Engineering

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Sistem presensi RFID (Radio Frequency Identification) di Universitas Telkom adalah suatu sistem layanan yang bertujuan untuk meningkatkan efisiensi dalam proses pencatatan kehadiran mahasiswa. Saat ini masalah masih banyak ditemukan sehingga keandalan sistem layanan presensi masih belum optimal. Salah satu masalahnya adalah presensi mahasiswa terkadang tidak terekam pada sistem tersebut. Dalam tugas akhir ini, penulis terlebih dulu membuat dokumen tertulis (diagram aktivitas) dan spesifikasi sistem secara rinci dan jelas berdasarkan hasil observasi di lapangan. Hasil tersebut akan diformalisasikan ke dalam model formal dengan logika temporal tertentu. Selanjutnya penulis menggunakan metode formal untuk melakukan verifikasi spesifikasi keamanan (safety) dan keterjangkauan (liveness) berdasarkan model yang dibentuk. Tugas akhir ini memberikan suatu contoh translasi dari diagram aktivitas ke dalam model formal untuk sistem layanan presensi RFID. Lebih jauh, penulis menunjukkan bahwa metode formal dapat mendukung verifikasi sistem layanan presensi RFID di Universitas Telkom. Kata Kunci: metode formal, RFID, diagram aktivitas, model formal
ANALISIS KORELASI NILAI MICROTEACHING GURU DENGAN KEMAMPUAN PEMBUATAN SOAL YANG MENGINTEGRASIKAN BERPIKIR KOMPUTASIONAL PADA MATA PELAJARAN MELALUI GERAKAN PANDAI Muhammad Arzaki; Ade Romadhony; Putu Harry Gunawan; Rimba Whidiana Ciptasari; Fazmah Arif Yulianto; Selly Meliana; Agung Toto Wibowo; Bambang Pudjoatmodjo; Dodi Wisaksono Sudiharto; Fat’hah Noor Prawita; Ema Rachmawati
Prosiding COSECANT : Community Service and Engagement Seminar Vol 1, No 2 (2021)
Publisher : Universitas telkom

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (432.678 KB) | DOI: 10.25124/cosecant.v1i2.17506

Abstract

Berpikir Komputasional (BK) merupakan metode berpikir secara sistematis dan logis dalam menyelesaikan suatu masalah. Biro Bebras Universitas Telkom menyelenggarakan lokakarya dengan tujuan melatih guru untuk mengintegrasikan BK ke dalam mata pelajaran pada rumpun STEM maupun non-STEM untuk tingkat SD, SMP dan SMA. Pada lokakarya ini, terdapat 146 peserta guru yang setengahnya merupakan guru SMA atau sederajat dan lebih dari seperempatnya adalah guru SD atau sederajat. Dalam kegiatan lokakarya, guru-guru diberikan pelatihan BK, membuat rencana pembelajaran (RP), membuat deskripsi soal (DS) dan melaksanakan microteaching (MT) sebagai penerapan dari kegiatan lokakarya. Dari hasil analisis data yang dilakukan, nilai korelasi antara nilai pembuatan DS dan aktivitas MT secara keseluruhan adalah 0,08151 dari total 33 peserta yang mengikuti serangkaian tugas DS dan MT. Sehingga, secara statistik dapat disimpulkan bahwa tidak ada pengaruh signifikan antara aktivitas pembuatan DS dengan aktivitas MT pada kegiatan lokakarya ini.
Pelatihan Berpikir Komputasional untuk Peningkatan Kompetensi Guru Telkom Schools sebagai Bagian dari Gerakan PANDAI Muhammad Arzaki; Selly Meliana; Ema Rachmawati; Ade Romadhony; Agung Toto Wibowo; Bambang Pudjoatmodjo; Bedy Purnama; Dodi Wisaksono Sudiharto; Fat'hah Noor Prawira; Fazmah Arif Yulianto; Putu Harry Gunawan; Rimba Whidiana Ciptasari
I-Com: Indonesian Community Journal Vol 3 No 3 (2023): I-Com: Indonesian Community Journal (September 2023)
Publisher : Fakultas Sains Dan Teknologi, Universitas Raden Rahmat Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33379/icom.v3i3.2988

Abstract

Berpikir komputasional (BK) atau computational thinking (CT) merupakan salah satu keahlian esensial yang diperlukan sumber daya manusia Indonesia dalam rangka menghadapi revolusi industri 4.0 dan masyarakat 5.0. Gerakan PANDAI (Pengajar Era Digital Indonesia) merupakan suatu gerakan nasional yang merupakan kolaborasi nirlaba antara komunitas Bebras Indonesia, Kementerian Pendidikan dan Kebudayaan Indonesia, dan Google Indonesia dalam rangka meningkatkan kompetensi BK yang dimiliki oleh guru sekolah dasar dan menengah. Pada tahun 2022, Biro Bebras Universitas Telkom mengadakan pelatihan BK kepada lebih dari 60 guru Telkom Schools sebagai bagian dari gerakan ini. Pelatihan ini terdiri dari lima tahapan besar yang meliputi lokakarya luring, pembelajaran mandiri, lokakarya daring, dan dua kegiatan microteaching. Hasil analisis kuantitatif menunjukkan peningkatan kemampuan konseptual peserta terkait BK, meskipun masih banyak hal yang perlu dibenahi dari sisi kemampuan teknis dalam pengerjaan soal-soal BK.
Co-Authors Ade Romadhony Ade Romadhony Agung Toto Wibowo Agung Toto Wibowo Bambang Pudjoatmodjo Bedy Purnama Damar Huda Dodi Wisaksono Sudiharto Dodi Wisaksono Sudiharto Ema Rachmawati Ema Rachmawati Enrico Christopher Reinhard Farah Afianti Fat'hah Noor Prawira Fat’hah Noor Prawira Fazmah Arif Yulianto Fazmah Arif Yulianto Gia Septiana Wulandari Made Indrayana Putra Prawita, Fat’hah Noor Putu Harry Gunawan Raissa Henardianti Hanifa Rimba Whidiana Ciptasari Rimba Whidiana Ciptasari Selly Meliana Vincentius Arnold Fridolin Yanti Rusmawati