Text

Pencarian karakteristik diferensial pada 8 round struktur SPN algoritme block cipher SFN

---

Algoritme SFN merupakan salah satu algoritme block cipher yang menggunakan struktur SPN dan struktur Feistel Network untuk proses ekspansi kunci atau proses enkripsi dan dekripsi. 8 round algoritme SFN diklaim aman terhadap serangan diferensial namun belum ada pembuktian secara teoritis mengenai ketahanan algoritme SFN terhadap serangan diferensial. Serangan diferensial dilakukan dengan memanfaatkan nilai difference tertentu antara pasangan teks terang dan teks sandi. Nilai difference dari setiap komponen pembangun algoritme akan membentuk karakteristik diferensial dengan probabilitas tertentu. Karakteristik diferensial dengan probabilitas terbaik dapat digunakan untuk melakukan serangan diferensial. Metode yang digunakan untuk mencari karakteristik diferensial 8 round struktur SPN algoritme SFN yaitu dengan mencari skema nilai difference yang memiliki jumlah s-box aktif paling sedikit dan mencari nilai difference yang memiliki probabilitas tertinggi. Hasil penelitian menunjukkan terdapat nilai difference yang dapat menghasilkan karakteristik diferensial 8 round dengan probabilitas 2^(-128). Berdasarkan probabilitas tersebut diperoleh kompleksitas data sebesar 2^128. Dengan demikian secara teoritis, 8 round struktur SPN algoritme SFN dibuktikan tahan terhadap serangan diferensial --

The SFN algorithm is a block cipher algorithm that uses the SP Network structure and the Feistel Network structure for the key expansion process or the encryption and decryption process. The 8 round SFN algorithm was claimed to be safe against differential attacks if the complexity of the differential attack obtained is greater than the 2^128 brute-force complexity. Differential attacks are carried out by taking advantage of a certain difference value between the plaintext and ciphertext pairs. The difference value of each component that builds the algorithm will form a differential characteristic with a certain probability. The differential characteristic with the best probability can be used to perform a differential attack. The method used to find the 8 round differential characteristics of the SPN structure with the SFN algorithm is to look for the difference value scheme which has the least number of active s-boxes and look for the difference value which has the highest probability. The results showed that there were difference values that could produce 8 round differential characteristics with a probability of 2^(-128). Based on this probability, the data complexity is 2^128. Thus theoretically, the SFN algorithm is proven to be resistant to differential attack

---

Availability

Detail Information

Series Title

-

Call Number

2022 DHE p

Publisher

Bogor : Politeknik Siber dan Sandi Negara., 2022

Collation

xvii, 67 hlm.

Language

Indonesia

ISBN/ISSN

--

Classification

--

Content Type

-

Media Type

-

Carrier Type

-

Edition

--

Subject(s)

Karakteristik diferensial
Serangan Diferensial
SFN
SPN

Specific Detail Info

-

Statement of Responsibility

Dhea Septi Kurnia Dati

Other version/related

File Attachment

Comments

---

You must be logged in to post a comment