Plaintext Recovery in DES-like Cryptosystems Based on S-boxes with Embedded Parity Check

Angelova, Vesela, and Borissov, Yuri. "Plaintext Recovery in DES-like Cryptosystems Based on S-boxes with Embedded Parity Check." Serdica Journal of Computing 7.3 (2013): 257-270. <http://eudml.org/doc/268674>.

@article{Angelova2013,
abstract = {We describe an approach for recovering the plaintext in block ciphers having a design structure similar to the Data Encryption Standard but with improperly constructed S-boxes. The experiments with a backtracking search algorithm performing this kind of attack against modified DES/Triple-DES in ECB mode show that the unknown plaintext can be recovered with a small amount of uncertainty and this algorithm is highly efficient both in time and memory costs for plaintext sources with relatively low entropy. Our investigations demonstrate once again that modifications resulting to S-boxes which still satisfy some design criteria may lead to very weak ciphers. ACM Computing Classification System (1998): E.3, I.2.7, I.2.8.This work was presented in part at the 1-st International Conference Bulgarian Cryptography Days 2012, Sofia, Bulgaria, 20–21 September 2012.},
author = {Angelova, Vesela, Borissov, Yuri},
journal = {Serdica Journal of Computing},
keywords = {DES-like cryptosystem; S-box; affine subspace; plaintext recovery; backtracking search; language model},
language = {eng},
number = {3},
pages = {257-270},
publisher = {Institute of Mathematics and Informatics Bulgarian Academy of Sciences},
title = {Plaintext Recovery in DES-like Cryptosystems Based on S-boxes with Embedded Parity Check},
url = {http://eudml.org/doc/268674},
volume = {7},
year = {2013},
}

TY - JOUR
AU - Angelova, Vesela
AU - Borissov, Yuri
TI - Plaintext Recovery in DES-like Cryptosystems Based on S-boxes with Embedded Parity Check
JO - Serdica Journal of Computing
PY - 2013
PB - Institute of Mathematics and Informatics Bulgarian Academy of Sciences
VL - 7
IS - 3
SP - 257
EP - 270
AB - We describe an approach for recovering the plaintext in block ciphers having a design structure similar to the Data Encryption Standard but with improperly constructed S-boxes. The experiments with a backtracking search algorithm performing this kind of attack against modified DES/Triple-DES in ECB mode show that the unknown plaintext can be recovered with a small amount of uncertainty and this algorithm is highly efficient both in time and memory costs for plaintext sources with relatively low entropy. Our investigations demonstrate once again that modifications resulting to S-boxes which still satisfy some design criteria may lead to very weak ciphers. ACM Computing Classification System (1998): E.3, I.2.7, I.2.8.This work was presented in part at the 1-st International Conference Bulgarian Cryptography Days 2012, Sofia, Bulgaria, 20–21 September 2012.
LA - eng
KW - DES-like cryptosystem; S-box; affine subspace; plaintext recovery; backtracking search; language model
UR - http://eudml.org/doc/268674
ER -