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

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.

A Cauchy Integral Related to a Robot-safety Device System

We introduce a robot-safety device system attended by two different repairmen. The twin system is characterized by the natural feature of cold standby and by an admissible “risky” state. In order to analyse the random behaviour of the entire system (robot, safety device, repair facility) we employ a stochastic process endowed with probability measures satisfying general Hokstad-type differential equations. The solution procedure is based on the theory of sectionally holomorphic functions, characterized by a Cauchy-type integral defined as a Cauchy principal value in double sense. An application of the Sokhotski-Plemelj formulae determines the long-run availability of the robot-safety device. Finally, we consider the particular but important case of deterministic repair.