Articles
<![CDATA[Penerapan Metode Simple Additive Weighting Pada Penentuan Tingkat Kesejahteraan Penduduk Provinsi Nusa Tenggara Timur ]]>
<![CDATA[Kaho, Monica Louisa Ratu]]>;
<![CDATA[Tanaamah, Andeka Rocky]]>;
<![CDATA[Wowor, Alz Danny]]>
<![CDATA[ Proceedings of KNASTIK 2013 ]]>
Publisher : <![CDATA[Duta Wacana Christian University ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
<![CDATA[The importance of a system not only helping the work done quickly and easy but also could result accurate information. Recently many government's program especially related with society walfare those are not touch the right target because the inaccurate information about society welfare. Answering this problem, we need a system that resulting the accurate information about people welfare. To determine the level of people walfare use many criteria and alternative, to easing the determination of welfare level we need to applying Simple Additive Weighting method on the system because Simple Additive Weighting is one of completion method that involve many criteria and alternative. Through the information that result by the system that is level of people welfare in each regency of East Nusa Tenggara, hopefully could help the authority to determine which region to be priority for the implementation of the welfare developing program.]]>
<![CDATA[Domain Examination of Chaos Logistics Function As A Key Generator in Cryptography ]]>
<![CDATA[Alz Danny Wowor]]>;
<![CDATA[Vania Beatrice Liwandouw]]>
<![CDATA[ International Journal of Electrical and Computer Engineering (IJECE) Vol 8, No 6: December 2018 ]]>
Publisher : <![CDATA[Institute of Advanced Engineering and Science ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (1314.485 KB)
|
DOI: 10.11591/ijece.v8i6.pp4577-4583
<![CDATA[The use of logistics functions as a random number generator in a cryptography algorithm is capable of accommodating the diffusion properties of the Shannon principle. The problem that occurs is initialization x was static and was not affected by changes in the key, so that the algorithm will generate a random number that is always the same. This study design three schemes that can providing the flexibility of the input keys in conducting the examination of the value of the domain logistics function. The results of each schemes do not show a pattern that is directly proportional or inverse with the value of x0 and relative error x and successfully fulfill the properties of the butterfly effect. Thus, the existence of logistics functions in generating chaos numbers can be accommodated based on key inputs. In addition, the resulting random numbers are distributed evenly over the chaos range, thus reinforcing the algorithm when used as a key in cryptography.]]>
<![CDATA[Square transposition: an approach to the transposition process in block cipher ]]>
<![CDATA[Magdalena A. Ineke Pekereng]]>;
<![CDATA[Alz Danny Wowor]]>
<![CDATA[ Bulletin of Electrical Engineering and Informatics Vol 10, No 6: December 2021 ]]>
Publisher : <![CDATA[Institute of Advanced Engineering and Science ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.11591/eei.v10i6.3129
<![CDATA[The transposition process is needed in cryptography to create a diffusion effect on data encryption standard (DES) and advanced encryption standard (AES) algorithms as standard information security algorithms by the National Institute of Standards and Technology. The problem with DES and AES algorithms is that their transposition index values form patterns and do not form random values. This condition will certainly make it easier for a cryptanalyst to look for a relationship between ciphertexts because some processes are predictable. This research designs a transposition algorithm called square transposition. Each process uses square 8 × 8 as a place to insert and retrieve 64-bits. The determination of the pairing of the input scheme and the retrieval scheme that have unequal flow is an important factor in producing a good transposition. The square transposition can generate random and non-pattern indices so that transposition can be done better than DES and AES.]]>
<![CDATA[The Implementation of f(x) = 3(x 3 − x 2 − x) + 2 as CSPRNG Chaos-Based Random Number Generator ]]>
<![CDATA[Maria Rosalina Yopeng]]>;
<![CDATA[Alz Danny Wowor]]>
<![CDATA[ Indonesia Journal on Computing (Indo-JC) Vol. 6 No. 1 (2021): April, 2021 ]]>
Publisher : <![CDATA[School of Computing, Telkom University ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.34818/INDOJC.2021.6.1.546
<![CDATA[This research implemented the cubic function f(x) = 3(x^3 − x^2 − x) + 2 using a FixedPoint Iteration to produce several iteration functions that can be used as random number generator. The test results obtain six iteration functions, and based on graphic visualizationwith Scatter plot and randomness test with mono bit test, bit block, and run test, the results only obtain two iteration functions namely x2 − 1 + 2/(3x) and f(x) = 1 + 1/x − 2/(3x^2)which can produce CSPRNG Chaos-based random number. Encryption testing shows that both functions can generate keys that make plaintext and ciphertext statistically unrelated, so the f(x) = 1 + 1/x − 2/(3x^2) function can be used as a CSPNRG chaos-based random number generator function.]]>
<![CDATA[Regenerasi Fungsi Polinomial Dalam Rancangan Algoritma Berbasis CSPNRG Chaos Sebagai Pembangkit Kunci Pada Kriptografi Block Cipher ]]>
<![CDATA[Alz Danny Wowor]]>
<![CDATA[ Limits: Journal of Mathematics and Its Applications Vol 14, No 1 (2017) ]]>
Publisher : <![CDATA[Institut Teknologi Sepuluh Nopember ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (3286.665 KB)
|
DOI: 10.12962/limits.v14i1.2169
<![CDATA[Penelitian ini mencari model baru dari fungsi polinomial yang dapat digunakan sebagai pembangkit bilangan acak berbasis CSPNRG chaos, kemudian dijadikan sebagai kunci pada kriptografi block cipher. Proses dilakukan dengan meregenerasi polinomial menggunakan fixed point iteration menjadi fungsi iteratif, dan pengambilan integer pada mantissa untuk memperoleh bilangan acak dari setiap iterasi. Setiap fungsi polinomial derajat-1, derajat-2, dan derajat-3 dapat digunakan sebagai fungsi pembangkit, tetapi diperlukan pemilihan koefisien dan konstanta yang tepat dan juga ketangkasan dalam proses manipulasi aljabar pada fixed point iteration. Secara spesifik, algoritma yang dirancang merupakan proses yang ampuh karena dapat menghasilkan bilangan acak walaupun secara fungsi iterasi tidak dapat menghasilkan bilangan acak. Pengujian korelasi pada block cipher menggunakan kunci dari bilangan acak berada pada kategori ‘rendah’, sehingga secara kriptografi kunci tersebut dapat membuat plainteks dan cipherteks tidak berhubungan secara statistik, kondisi ini akan mempersulit kriptanalis untuk melakukan kriptanalisis. Fungsi polinomial yang menjadi pembangkit dan menghasilkan bilangan acak dapat menjadi embrio dalam membangun konsep unbreakble cipher.]]>
<![CDATA[Regenerasi Fungsi x2-9x-99 Dalam Pembangkit Bilangan Acak Berbasis CSRPNG Chaos ]]>
<![CDATA[David Lihananto]]>;
<![CDATA[Alz Danny Wowor]]>
<![CDATA[ AITI Vol 16 No 2 (2019) ]]>
Publisher : <![CDATA[Fakultas Teknologi Informasi Universitas Kristen Satya Wacana ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (459.151 KB)
|
DOI: 10.24246/aiti.v16i2.125-134
<![CDATA[Penelitian ini menguji apakah fungsi f(x)=x2-9x-99 dapat digunakan sebagai pembangkit kunci dalam kriptografi. Fungsi kuadrat diregenerasi menggunakan metode iterasi titik tetap menjadi fungsi iterasi. Dilakukan pembagian digit angka untuk hasil keluaran fungsi iterasi untuk menghasilkan bilangan chaos. Pengujian pengacakan menggunakan pengujian run test dan monobit. Dilanjutan dengan pengujian kriptografi untuk dapatkan hasil korelasi antara chiperteks dan kunci yang akan dijadikan sebagai keputusan apakah kunci yang dihasilkan sudah acak atau tidak. Berdasarkan penelitian yang telah dilakukan fungsi iterasi xi = (xi-12-9xi-1-99)/9 dapat menghasilkan bilangan acak CSRPNG Chaos dengan tingkat korelasi yang paling mendekati nilai 0.]]>
<![CDATA[Desain S-Box Fleksibel: Regenerasi Konstanta dan Koefisien Fungsi Linier Berbasis CSPRNG Chaos ]]>
<![CDATA[Bambang Susanto]]>;
<![CDATA[Alz Danny Wowor]]>;
<![CDATA[Vania Beatrice Liwandouw]]>
<![CDATA[ Jurnal Nasional Teknik Elektro dan Teknologi Informasi Vol 8 No 1: Februari 2019 ]]>
Publisher : <![CDATA[Departemen Teknik Elektro dan Teknologi Informasi, Fakultas Teknik, Universitas Gadjah Mada ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (1281.002 KB)
<![CDATA[The substitution process in block ciphers usually uses static s-boxes, where the value of each s-box entry is always fixed and the functions are one-to-one. Visually, the dataset pattern in the input is also seen in the output. This will make it easier for cryptanalysts to look at patterns and can predict behavior based on the input. This study designs a flexible s-box where each entry contains a linear function, with constants and coefficients generated by CSPRNG chaos from the key input. The strength of a flexible s-box can be seen when changing key inputs (although 1 bit different) will produce different s-boxes. In addition, the same input dataset values will produce different outputs, so flexible s-boxes are one-to-many. Statistical tests show that the average correlation is in a low category. Tests on the cipher block also fulfill the Shannon Principle. The principle of Iterated Cipher with n-round is filled with n > 5 and 46n random numbers. The Avalanche Effect test on the algorithm gives better results than Two fish even though it is still below the DES.]]>
<![CDATA[DESAIN PEMBANGKIT KUNCI BLOCK CIPHER BERBASIS CSPRNG CHAOS MENGGUNAKAN FUNGSI TRIGONOMETRI ]]>
<![CDATA[Kuniarti Paraditasari]]>;
<![CDATA[Alz Danny Wowor]]>
<![CDATA[ JIPI (Jurnal Ilmiah Penelitian dan Pembelajaran Informatika) Vol 6, No 2 (2021) ]]>
Publisher : <![CDATA[STKIP PGRI Tulungagung ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.29100/jipi.v6i2.2115
<![CDATA[Penelitian ini meregenerasi fungsi trigonometri dan dijadikan sebagai pembangkit bilangan acak berbasis CSPNRG chaos . Setiap fungsi trigonometri dapat digunakan sebagai fungsi pembangkit, walaupun untuk cos x dan csc x memerlukan sedikit modifikasi. Pengujian enkripsi menunjukkan setiap kunci yang dihasilkan dari setiap fungsi pembangkit, dapat membuat plainteks dan cipherteks tidak berhubungan secara statistik. Kondisi ini akan mempersulit kriptanalis untuk melakukan serangan pada algoritma. Secara spesifik, rancangan merupakan proses yang baik, karena dapat menghasilkan bilangan acak berbasis CSPRNG chaos . Sehingga fungsi trigonometri dapat digunakan sebagai pembangkit dalam menghasilkan kunci pada kriptografisandi blok .]]>
<![CDATA[Desain Pembangkit Kunci LFSR dengan Skema A5/1 Menggunakan empat Blok Bit Fungsi XOR ]]>
<![CDATA[Teguh Septianto Nahading]]>;
<![CDATA[Alz Danny Wowor]]>
<![CDATA[ Kesatria : Jurnal Penerapan Sistem Informasi (Komputer dan Manajemen) Vol 4, No 2 (2023): Edisi April ]]>
Publisher : <![CDATA[LPPM STIKOM Tunas Bangsa ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.30645/kesatria.v4i2.177
<![CDATA[This research designs the Random Number Generator by using the LFSR with an A5/1 scheme and also four feedback for the Random Number Generator. Every feedback functions use the XOR operation to determine the new bit value in the next literation. Random results of the Run Test, Mono Bit, and Block bit shows that the algorithm is consistently able to generate random output even with various input variant. Comparison examination using previous research algorithms shows that four selected feedback functions generate random numbers. The encryption test shows that plaintext and ciphertext have “very low” and “low” correlation rates where the average correlation for every plaintext test is close to 0. The LFSR key generator with an A5/1 algorithm scheme using four XOR functions can generate very good random output for use in Stream Cipher.]]>
<![CDATA[IMPLEMENTASI VARIASI FUNGSI XOR DALAM PEMBANGKITAN KUNCI LFSR PADA SKEMA A5/1 DENGAN TIGA BLOK BIT ]]>
<![CDATA[Ahmad Ramadhani]]>;
<![CDATA[Alz Danny Wowor]]>
<![CDATA[ JURNAL INFORMATIKA DAN KOMPUTER Vol 8, No 1 (2024): Februari 2024 ]]>
Publisher : <![CDATA[Lembaga Penelitian dan Pengabdian Masyarakat - Universitas Teknologi Digital Indonesia ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.26798/jiko.v8i1.1116
<![CDATA[Penelitian ini mengimplementasikan variasi fungsi XOR dalam pembangkit kunci LFSR (Linear Feedback Shift Register) dengan skema A5/1 dan tiga fungsi umpan balik untuk proses pembangkit bilangan acak. Untuk menentukan nilai bit yang baru pada iterasi berikutnya digunakan operasi XOR pada setiap fungsi umpan balik. Dilakukan pengujian keacakan dengan metode Run Test, Mono Bit, dan Block Bit untuk memperoleh hasil pengujian bahwa algoritma secara konsisten mampu mengasilkan luaran yang acak dengan berbagai variasi input. Dalam uji enkripsi didapat hasil korelasi antara plainteks dan cipherteks memiliki nilai yang sangat rendah karena setiap pengujian memiliki nilai mendekati 0. Perbandingan dengan penelitian terdahulu menyatakan kelima fungsi yang digunakan dapat menghasilkan luaran acak. Pembangkit kunci LFSR dengan skema A5/1dengan tiga fungsi XOR dapat menghasilkan keluaran bilangan acak yang sangat baik untuk digunakan dalam kriptografi.]]>
