Politeknik Siber dan Sandi Negara

Knowledge Center of Cybersecurity and Cryptography

  • Home
  • Information
  • News
  • Help
  • Librarian
  • Member Area
  • Select Language :
    Arabic Bengali Brazilian Portuguese English Espanol German Indonesian Japanese Malay Persian Russian Thai Turkish Urdu

Search by :

ALL Author Subject ISBN/ISSN Advanced Search

Last search:

{{tmpObj[k].text}}
Image of Pencarian karakteristik truncated differential pada 8 iterasi algoritme design 32 bit Lightweight Block Cipher Algorithm (DLBCA)
Bookmark Share

Teks

Pencarian karakteristik truncated differential pada 8 iterasi algoritme design 32 bit Lightweight Block Cipher Algorithm (DLBCA)

Muhamad Anis - Personal Name; Nadia Paramita Retno Adiati - Personal Name;

Indonesia
Algoritme DLBCA merupakan algoritme block cipher dengan struktur feistel yang memiliki plaintext sepanjang 32 bit dan kunci sepanjang 80 bit. Algoritme ini memiliki 15 iterasi. Salah satu pembuktian keamanan dari algoritme block cipher yaitu dengan melakukan serangan. Serangan diferensial telah diterapkan pada algoritme DLBCA dengan hasil jumlah s-box aktif cenderung lebih sedikit ketika dibandingkan dengan beberapa algoritme lainnya. Serangan diferensial dapat dikembangkan menjadi serangan truncated differential dengan menggabungkan n buah karakteristik truncated. Pada penelitian ini dilakukan pencarian karakteristik truncated untuk delapan iterasi algoritme DLBCA. Langkah yang dilakukan dalam pencarian karakteristik truncated diawali dengan menganalisis pengaruh komponen algoritme DLBCA terhadap nilai difference sampai dengan menemukan karakteristik truncated terbaik. Penentuan karakteristik truncated terbaik ini didasarkan pada probabilitas diferensial dari masing-masing karakteristik truncated. Adapun input pada karakteristik truncated yang dipilih adalah A_0={2,8,a} dan A_1={1,4,5}, serta banyak nibble aktif pada input difference adalah dua nibble. Pada penelitian ini terdapat dua karakteristik truncated terbaik untuk delapan iterasi algoritme DLBCA dengan probabilitas 2^(-67,0922814695). Probabilitas terbaik untuk empat iterasi adalah 2^(-33,9744694257) dan telah melibihi kompleksitas brute force attack yaitu 2^32. Berdasarkan hal tersebut maka algoritme ini tahan terhadap serangan truncated mulai dari empat iterasi. Serangan truncated dapat diterapkan pada empat iterasi algoritme DLBCA menggunakan distinguisher tiga iterasi. Pasangan plaintext dan ciphertext yang dibutuhkan untuk menerapkan serangan truncated differential pada empat iterasi algoritme DLBCA yaitu c.2^22,4682840384. Serangan ini mengembalikan subkunci sebanyak 16 bit.

English
The DLBCA algorithm is a block cipher algorithm with a Feistel structure published by AlDabbagh, which has 32 bits plaintext and 80 bits key. This algorithm has 15 iterations. One way to proof the security of a block cipher algorithm is applied attack to the algorithms. There is previous research about differential attacks applied to the DLBCA algorithm, which result the number of active S-boxes tend to be less when compered to some other block cipher algorithm. Truncated differential attack is an improvement from differential attack that combine n truncated characteristics. In this research aims to find truncated differential characteristic for eight rounds of DLBCA algorithm. The research begin with analyzing each component of the DLBCA algorithm, to find out which of these component that has impact for the difference value. The result of this step is best truncated characteristic. The determination of the best truncated characteristics is based on the differential probability of each truncated characteristic..The inputs for the selected characteristics truncated are A_0={2,8,a} and A_1={1,4,5}, and active nibbles on input difference are two nibbles. Two best truncated characteristics for eight round of DLBCA algorithm was found has probability 2^(-67.0922814695) for each of the characteristic. The best probability for four iterations is 2^(-33.9744694257)and has exceeded complexicity of brute force attack is 2^32. Based on probability found, DLBCA algorithm resistant to truncated attack with minimum iteration of the algorithm is four. Truncated attack can be applied to four rounds of DLBCA algorithm using three rounds distinguisher. At least c.2^22,4682840384 pairs of plaintext and ciphertext is needed to carried out the attack. From this attack 16 bit subkeys can be recovered.


Availability
#
Location name is not set Location name is not set
TA20200201148
Available
#
Location name is not set Location name is not set
TA20200201149
Available
Detail Information
Series Title
--
Call Number
2020 MUH p
Publisher
Bogor : Politeknik Siber dan Sandi Negara., 2020
Collation
xv, 63 halaman
Language
Indonesia
ISBN/ISSN
--
Classification
--
Content Type
-
Media Type
-
Carrier Type
-
Edition
--
Subject(s)
--
Specific Detail Info
-
Statement of Responsibility
Muhamad Anis
Other version/related

No other version available

File Attachment
No Data
Comments

You must be logged in to post a comment

Politeknik Siber dan Sandi Negara
  • Information
  • Services
  • Librarian
  • Member Area

About Us

Perpustakaan Politeknik Siber dan Sandi Negara menyediakan berbagai macam koleksi seperti Buku, Jurnal, Majalah, Koran, Referensi dan Konten Lokal.

Search

start it by typing one or more keywords for title, author or subject

Keep SLiMS Alive Want to Contribute?

© 2025 — Senayan Developer Community

Powered by SLiMS
Select the topic you are interested in
  • Computer Science, Information & General Works
  • Philosophy & Psychology
  • Religion
  • Social Sciences
  • Language
  • Pure Science
  • Applied Sciences
  • Art & Recreation
  • Literature
  • History & Geography
Icons made by Freepik from www.flaticon.com
Advanced Search
Where do you want to share?