IMI-BAS BAS
 

BulDML at Institute of Mathematics and Informatics >
IMI >
IMI Periodicals >
Serdica Journal of Computing >
2013 >
Volume 7 Number 3 >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10525/2341

Title: Plaintext Recovery in DES-like Cryptosystems Based on S-boxes with Embedded Parity Check
Authors: Angelova, Vesela
Borissov, Yuri
Keywords: DES-like cryptosystem
S-box
affine subspace
plaintext recovery
backtracking search
language model
Issue Date: 2013
Publisher: Institute of Mathematics and Informatics Bulgarian Academy of Sciences
Citation: Serdica Journal of Computing, Vol. 7, No 3, (2013), 257p-270p
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.
URI: http://hdl.handle.net/10525/2341
ISSN: 1312-6555
Appears in Collections:Volume 7 Number 3

Files in This Item:

File Description SizeFormat
sjc-vol7-num3-2013-p257-p270.pdf199.6 kBAdobe PDFView/Open

 



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0!   Creative Commons License DSpace Software Copyright © 2002-2009  The DSpace Foundation - Feedback