Text

Serangan integral pada algoritme TS-2

---

Abstrak:
TS-2 merupakan algoritme block cipher yang dipublikasikan oleh Putra. Putra mengklaim bahwa TS-2 aman terhadap serangan differential dan serangan linear pada lima round ke-1 algoritme. Hingga saat ini tidak ditemukan penelitian terkait serangan yang dilakukan terhadap algoritme TS-2 selain serangan differential dan linear sehingga perlu dilakukan penelitian kembali untuk membuktikan bahwa algoritme TS-2 tahan terhadap semua serangan. Suatu block cipher dikatakan aman jika tahan terhadap semua jenis serangan yang diketahui saat ini. Salah satu serangan tersebut yaitu serangan integral. Berdasarkan hal tersebut, dalam penelitian ini dilakukan serangan integral pada algoritme TS-2 dengan mengaktifkan maksimum tiga bytes pada semua kemungkinan posisinya serta menganalisis ketahanan TS-2 terhadap serangan integral.
Pada penelitian ini, pencarian integral distinguisher menggunakan himpunan teks terang dengan mengaktifkan satu hingga tiga bytes. Dari pencarian integral distinguisher, ditemukan 808 hasil terbaik. Untuk 5 round, terdapat 311 dua bytes aktif dan 431 tiga bytes aktif. Sedangkan untuk 5,5 round, terdapat 32 satu bytes aktif dan 34 dua bytes aktif. Integral distinguisher 5 dan 5,5 round digunakan untuk mendesain skenario perluasan serangan hingga round ke-11. Skenario serangan integral pada algoritme TS-2 dapat mengekstraksi sembilan input bytes kunci dengan membutuhkan kompleksitas data sebesar 2^8, kompleksitas memori sebesar 2^8, dan kompleksitas waktu sebesar 2^38. Kompleksitas waktu total untuk mengekstraksi seluruh input bytes kunci yaitu sebesar 2^38+2^18. Skenario serangan tersebut menyerang 11 round algoritme TS-2 menggunakan integral distinguisher 5,5 round terbaik dengan satu bytes aktif.

Abstract:
TS-2 is a block cipher algorithm that was published by Putra (2021). Putra claimed that TS-2 is secure against differential and linear attacks on the first five rounds of the algorithm. However, no research has been conducted on attacks against the TS-2 algorithm other than differential and linear attacks, so further research is needed to prove that the TS-2 algorithm is resistant to all attacks. A block cipher is considered secure if it is resistant to all known types of plaintext/ciphertext attacks. One of the attacks that needs to be conducted is an integral attack. Based on this, this study conducts an integral attack on the TS-2 algorithm by activating a maximum of three bytes in all possible positions and analyzing the resistance of TS-2 to integral attacks.
In this research, the search for integral distinguishers is conducted using a set of plaintexts with one to three active bytes. From the integral distinguisher search, 808 best results were found. For 5 rounds, there are 311 active two bytes and 431 active three bytes. Meanwhile, for 5.5 rounds, there are 32 active one-byte and 34 active two-byte cases. The integral distinguishers for 5 and 5.5 rounds are then utilized to design attack scenarios up to the 11th round. The integral attack scenario on the TS-2 algorithm allows the extraction of nine key input bytes with a data complexity of 2^8, a memory complexity of 2^8, and a time complexity of 2^38. The total time complexity for extracting all key input bytes is 2^38+2^18. This attack scenario targets the 11 rounds of the TS-2 algorithm using the best 5.5-round integral distinguisher with one active byte.

---

Availability

Detail Information

Series Title

--

Call Number

2023 DIA s

Publisher

Bogor : Politeknik Siber dan Sandi Negara., 2023

Collation

xiv, 62 halaman

Language

Indonesia

ISBN/ISSN

--

Classification

Rekayasa Sistem Kriptografi

Content Type

-

Media Type

-

Carrier Type

-

Edition

--

Subject(s)

Algoritme TS-2
Integral Distinguisher
Serangan Integral

Specific Detail Info

--

Statement of Responsibility

Dian Dwi Karlina

Other version/related

File Attachment

Comments

---

You must be logged in to post a comment