Claim Missing Document
Check
Articles

Found 3 Documents
Search

Kriteria Keamanan Blok Cipher dan Analisis Sandi Diferensial Yusuf Kurniawan; M. Sukrisno Mardiyanto; Iping Supriana Suwardi
Teknoin Vol. 10 No. 1 (2005)
Publisher : Faculty of Industrial Technology Universitas Islam Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20885/.v10i1.693

Abstract

Several criterions used to determine the security measure of ciphers, have been researched for tens years. Shannon recommended two concepts for designing of algorithm encryption: confusion and diffusion. These criterions have been expanded with other criterions addition like avalanche property, Strict Avalanche property, Key-dependence avalanche, sequence complexity, Binary derivatives, and Bit dependencies. This paper will try to discuss if the criterions that have been proposed by researchers have succeeded to counter to cryptanalysis. In this paper, six-round-DES is examined. The result of the research showed that the DES reduced to six rounds has satisfied the criterions, but failed to counter to differential cryptanalysis (DC). Some researchers have proposed to strengthen DES by making all subkeys Ki independent. So, for DES reduced to six rounds with independent subkeys, the number of keys is 6x48 (288 bits). However, DC can break the cipher by analyzing only 256 cipher texts.Keywords: Block cipher, differential cryptanalysis, DES, criterions, subkey.  
Analisis Sandi Diferensial terhadap Full Data Encryption Standard Yusuf Kurniawan; Adang Suwandi; M. Sukrisno Mardiyanto; Iping Supriana S.
Seminar Nasional Aplikasi Teknologi Informasi (SNATI) 2005
Publisher : Jurusan Teknik Informatika, Fakultas Teknologi Industri, Universitas Islam Indonesia

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

Abstract

DES (Data Encryption Standard) merupakan block cipher 16 ronde yang memiliki struktur Feistel danmemiliki masukan/keluaran 64 bit, serta memiliki kunci sepanjang 56 bit. Dengan struktur Feistel, algoritmaenkripsi memiliki struktur yang sama dengan yang untuk dekripsi. Perbedaannya hanya terletak pada urutansubkey yang dimasukkan. DES memiliki fungsi F yang tidak invertible. Analisis Sandi Diferensial (ASD) adalahteknik untuk mendapatkan kunci algoritma enkripsi modern tanpa harus meminta ijin pemilik kunci. ASD dapatditerapkan terhadap bermacam-macam algoritma enkripsi modern, termasuk Data Encryption Standard (DES).ASD berusaha mendapatkan diferensial masukan yang menghasilkan diferensial keluaran dengan memilikipeluang sebesar mungkin. Untuk algoritma DES, diferensial ini berupa XOR. Pada DES, satu-satunyakomponen yang tidak linear adalah kotak subtitusi. Oleh karena itu, ASD dimulai dari Kotak-S ini. Kemudianaliran diferensial ini diperluas ke komponen lainnya hingga mencapai satu ronde. Kemudian, dari satu ronde,diperluas ke ronde-ronde berikutnya hingga mencapai 16 ronde penuh.Dalam makalah ini akan ditunjukkancara memecahkan kunci DES 56 bit 16 ronde dengan ASD. Memecahkan DES berarti bahwa kita dapatmembuktikan bahwa tingkat keamanan full DES 16 ronde lebih rendah daripada yang diklaim pada waktualgoritma diumumkan. Dengan kata lain, DES dapat dipecahkan lebih cepat dari pada brute force attack.Kata kunci: Full DES, Analisis sandi diferensial, Kotak-S.
RELATIONAL DATABASE STRUCTURE AND OPERATIONS ENGINEERING USING CLASS DIAGRAM AND ACTIVITY DIAGRAM Lukman Hakim; M. Sukrisno Mardiyanto
Jurnal Teknik Industri, Sistem Informasi dan Teknik Informatika Vol. 1 No. 1 (2022): Jurnal Teknik Informatika, Sistem Infomasi dan Teknik Industri
Publisher : Universitas Bakti Indonesia

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

Abstract

Software system plays an important role especiallyfor processing large amounts of data. Currently, the operation ofa data is mostly done on the application layer, so the DBMS onlyserves to store data processing results. Data processing on theDBMS layer will make better performance, as it is closer to thephysical data. Application of constraints as well as data accessrights at the DBMS level will apply consistently to the system as awhole so as to maintain data integrity. In this research, UMLbased approach is proposed to map the structure and operationin a domain model into the structure and operation of relationaldatabase. A software will be built using a driven architecturemodel (MDA) to automate the transformation from UML to SQLscript. Class diagrams that describe the domain structure of themodel will be mapped into the table structure on the relationaldatabase, while the Activity diagram that describes thebehavioral aspects of a domain model will be mapped intoprocedure and function. It is expected that this research cansimplify the process of database schema development, increasedata processing speed and maintain data integrity.