Plaintext Recovery in DES-like Cryptosystems Based on S-boxes with Embedded Parity Check
Serdica Journal of Computing, Tome 7 (2013) no. 3, pp. 257-270
Voir la notice de l'article provenant de la source Bulgarian Digital Mathematics Library
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.
Keywords:
DES-like cryptosystem, S-box, affine subspace, plaintext recovery, backtracking search, language model
@article{SJC_2013_7_3_a4,
author = {Angelova, Vesela and Borissov, Yuri},
title = {Plaintext {Recovery} in {DES-like} {Cryptosystems} {Based} on {S-boxes} with {Embedded} {Parity} {Check}},
journal = {Serdica Journal of Computing},
pages = {257--270},
publisher = {mathdoc},
volume = {7},
number = {3},
year = {2013},
language = {en},
url = {http://geodesic.mathdoc.fr/item/SJC_2013_7_3_a4/}
}
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 SP - 257 EP - 270 VL - 7 IS - 3 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/SJC_2013_7_3_a4/ LA - en ID - SJC_2013_7_3_a4 ER -
Angelova, Vesela; Borissov, Yuri. Plaintext Recovery in DES-like Cryptosystems Based on S-boxes with Embedded Parity Check. Serdica Journal of Computing, Tome 7 (2013) no. 3, pp. 257-270. http://geodesic.mathdoc.fr/item/SJC_2013_7_3_a4/