Displaying similar documents to “Satisfiability and computing van der Waerden numbers.”

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

Angelova, Vesela, Borissov, Yuri (2013)

Serdica Journal of Computing

Similarity:

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...

Decomposition-based logic synthesis for PAL-based CPLDs

Adam Opara, Dariusz Kania (2010)

International Journal of Applied Mathematics and Computer Science

Similarity:

The paper presents one concept of decomposition methods dedicated to PAL-based CPLDs. The proposed approach is an alternative to the classical one, which is based on two-level minimization of separate single-output functions. The key idea of the algorithm is to search for free blocks that could be implemented in PAL-based logic blocks containing a limited number of product terms. In order to better exploit the number of product terms, two-stage decomposition and BDD-based decomposition...