Article Per Year (5 Year)
p-Index From 2020 - 2025
2.147
P-Index
This Author published in this journals
All Journal Jurnal Ilmu Komputer dan Informasi Indonesian Journal on Computing (Indo-JC) JOIV : International Journal on Informatics Visualization International Journal of Computing Science and Applied Mathematics Charity : Jurnal Pengabdian Masyarakat Indonesian Community Journal Journal of Fundamental Mathematics and Applications (JFMA) eProceedings of Engineering Community Service Seminar and Community Engagement (COSECANT)
Muhammad Arzaki
Telkom University
Agriculture, Biological Sciences & Forestry Arts Humanities Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Electrical & Electronics Engineering Engineering Environmental Science Industrial & Manufacturing Engineering Mathematics Public Health Social Sciences Other

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

Found 4 Documents
Search
Journal : International Journal of Computing Science and Applied Mathematics

 1 
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.
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.
Elementary Algorithmic Methods for Solving Suguru Puzzles Butrahandisya Butrahandisya; Muhammad Arzaki; Gia Septiana Wulandari
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol 10, No 1 (2024)
Publisher : Institut Teknologi Sepuluh Nopember

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

Abstract

We discuss elementary algorithmic aspects of the Suguru puzzle---a single-player paper-and-pencil puzzle introduced in 2001 and confirmed NP-complete in 2022. We propose a backtracking algorithm with pruning optimizations for solving an $m \times n$ Suguru puzzles containing $R$ regions and $H$ hint cells in $O(R \cdot (mn-H+2)!)$ time. Despite this factorial asymptotic upper bound, a C++ implementation of our proposed algorithm successfully solved all Suguru instances with no more than $100$ cells using a personal computer in less than $0.5$ second. We also prove that any Suguru instance of size $m \times n$ with either $m = 1$ or $n = 1$ can be solved in linear time in terms of the puzzle size. Finally, we provide an upper bound for the number of solutions to such tractable instances.
Co-Authors Ade Romadhony Agung Toto Wibowo Bambang Pudjoatmodjo Bambang Pudjotatmodjo Bedy Purnama Butrahandisya Butrahandisya Damar Huda Dodi Wisaksono Sudiharto Ema Rachmawati Ema Rachmawati Enrico Christopher Reinhard Farah Afianti Fat'hah Noor Prawira Fat’hah Noor Prawira Fat’hah Noor Prawira Fazmah Arif Yulianto Ganjar Gingin Tahyudin Gia Septiana Wulandari Made Indrayana Putra Mahmud Dwi Sulistiyo Muhammad Tsaqif Ammar Prawita, Fat’hah Noor Putu Harry Gunawan Raissa Henardianti Hanifa Rimba Whidiana Ciptasari Sakti, Joshua Erlangga Selly Meliana Vincentius Arnold Fridolin Yanti Rusmawati