Text

Serangan diferensial pada algoritme lightweight block cipher HISEC

---

Algoritme lightweight block cipher HISEC diusulkan pada tahun 2014 oleh AlDabbagh et al. Satu blok pesan pada algoritme HISEC menggunakan 64 bit plaintext dan 80 bit kunci yang dioperasikan sebanyak 15 round. Setiap round terdiri atas substitution box (s-box), permutasi, XOR, rotasi, dan key update. Algoritme HISEC diklaim memiliki tingkat keamanan yang lebih baik dibandingkan algoritme lain seperti PRESENT, Lblock, TWINE, dan KLEIN terhadap serangan diferensial karena mengaktifkan lebih sedikit s-box. Akan tetapi, dalam klaim tersebut tidak disebutkan karakteristik terbaik dan kompleksitas serangan yang dibutuhkan. Pada penelitian ini dilakukan serangan diferensial pada 8 round algoritme lightweight block cipher HISEC. Pembatasan masalah pada penelitian ini yaitu menggunakan maksimal 2 s-box aktif pada round pertama dan maksimal 4 s-box aktif pada round selanjutnya, dengan output hamming weight 1 dan 2, dan tanpa dilakukan ekstraksi kunci. Hasil dari penelitian ini adalah jumlah minimal s-box aktif yaitu 27 buah dengan probabilitas karakteristik diferensial terbaik sebesar 2^(-67) dan kompleksitas c.2^67. --

The HISEC lightweight block cipher algorithm was proposed in 2014 by AlDabbagh et al. One message block in the HISEC algorithm uses 64 bits of plaintext and 80 bits of key that are operated for 15 rounds. Each round consists of a substitution box (s-box), permutation, XOR, rotation, and key update. The HISEC algorithm was claimed to have a better level of security than other algorithms such as PRESENT, Lblock, TWINE, and KLEIN against differential attacks because it activates fewer s-boxes. However, the claim did not mention the best characteristics and the complexity of the attack required. Therefore, in this final project, a differential attack will be carried out on 8 rounds of the HISEC lightweight block cipher algorithm. The problem limitation in this research is to use a maximum of 2 active s-boxes in the first round and a maximum of 4 active s-boxes with hamming weights 1 and 2, and without key extraction. The result of this research is the minimum number of active s-boxes is 27 with the best probability of differential characteristics is 2^(-67) with the complexity is c.2^67.

---

Availability

No copy data

Detail Information

Series Title

-

Call Number

2022 DEW s

Publisher

Bogor : Poltek SSN., 2022

Collation

xv, 32 hlm.

Language

Indonesia

ISBN/ISSN

--

Classification

--

Content Type

-

Media Type

-

Carrier Type

-

Edition

--

Subject(s)

Serangan Diferensial
HISEC
Karakteritik Diferensial

Specific Detail Info

-

Statement of Responsibility

Dewi Kartika Prasasti

Other version/related

File Attachment

Comments

---

You must be logged in to post a comment