Biclique Cryptanalysis

Biclique Cryptanalysis

Author Name : D. Swetha, Savitri

ABSTRACT

Biclique is a complete bipartite graph, connecting each in a set of starting states S with each in a set of ending states C. In the context of cryptanalysis, every path in such a graph represents the encryption under a unique key over some steps of a primitive. A biclique attack is a meet-in-middle variant, which utilizes a biclique structure to extend the number of possibly attacked rounds by the MITM attack. Since biclique cryptanalysis is based on MITM attacks, it is applicable to both block ciphers and (iterated) hash-functions. The user secures the data using cryptography in the first place AND generates XOR data based on the data to be transmitted and a polynomial. MITM will attack by making the data readable and recover text from XOR.