Linear cryptanalysis on second round simplified AES
S.D. Mansoori, Hossein Khaleghi Bizaki
Abstract
S.D. Mansoori, Hossein Khaleghi Bizaki
Abstract
Linear attack, at the first, introduced for DES encryption system, by Matsui. That cryptanalysis was based on linear approximation of nonlinear S-boxes of algorithm. Then this kind of attack deployed for other kinds of block ciphers. This paper describes linear attack on second round SAES. By using this cryptanalysis, it is possible to attack on full round of SAES algorithm. Undoubtly, one of important results of this cryptanalysis is that, it is possible to better understanding linear attack on Rijndael
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Linear attack, at the first, introduced for DES encryption system, by Matsui. That cryptanalysis was based on linear approximation of nonlinear S-boxes of algorithm. Then this kind of attack deployed for other kinds of block ciphers. This paper describes linear attack on second round SAES. By using this cryptanalysis, it is possible to attack on full round of SAES algorithm. Undoubtly, one of important results of this cryptanalysis is that, it is possible to better understanding linear attack on Rijndael
Key concepts: Linear cryptanalysis, Impossible differential cryptanalysis, Cryptanalysis, Block cipher, Advanced Encryption Standard, Boomerang attack, Higher-order differential cryptanalysis, Computer science