In this paper, we revisit the famous Davies-Murphy cryptanalysis of DES. First we improve its complexity down to the analysis of 2 chosen plaintexts, by considering 6 distributions instead of 7. The previous improvement of the attack by Biham and Biryukov costed 2 known plaintexts. This new result is better than differential cryptanalysis but slightly worse than linear cryptanalysis. Secondly, ...

This paper describes an effort to attack S-DES using differential cryptanalysis and linear cryptanalysis. S-DES is a reduced version of the Data Encryption Standard (DES). It also includes a discussion on the subject of cryptology and a literature survey of useful papers regarding cryptography and cryptanalysis. This paper is meant as a tutorial on the fundamentals of differential cryptanalysis...

block ciphers have wide applications for hardware and software implementations. in this paper, a new block cipher algorithm with provable security is proposed. the whole structure of the algorithm is novel and has a good encryption and decryption performance. additionally, it has good security with few number of rounds. the structure of the proposed algorithm consists of 4-rounds feistel-like w...

A famous result of Graham and Pollak states that the complete graph with n vertices can be edge partitioned into n − 1, but no fewer, complete bipartite graphs. This result has led to the study of the relationship between the chromatic and biclique partition numbers of graphs. It has become even more exciting with recent connections to the clique versus stable set problem, communication protoco...

Given a bipartite graph G = (S, T, E), the k-clustering Minimum Biclique Completion Problem (k-MinBCP) consists of finding k bipartite subgraphs (clusters), such that each vertex i of S appears in exactly one subgraph, every vertex j in T appears in each cluster in which at least one of its neighbors appears, and the total number of edges that would complete each subgraph into a complete bipart...

Impossible differential cryptanalysis, the extension of differential cryptanalysis, is one of the most efficient attacks against block ciphers. This cryptanalysis method has been applied to most of the block ciphers and has shown significant results. Using structures, key schedule considerations, early abort, and pre-computation are some common methods to reduce complexities of this attack. In ...