toward a more efficient gröbner-based algebraic cryptanalysis

In this paper, we propose a new method to launch a more efficient algebraic cryptanalysis. algebraic cryptanalysis aims at finding the secret key of a cipher by solving a collection of polynomial equations that describe the internal structure of the cipher. chosen correlated plaintexts, as what appears in higher order differential cryptanalysis and its derivatives such as cube attack or integral cryptanalysis, forces many linear relations between intermediate state bits in the cipher. in this paper, we take these polynomial relations into account, so it becomes possible to simplify the equation system arising from algebraic cryptanalysis, and consequently, solve the polynomial system more efficiently.we take advantage of the universal proning technique to provide an efficient method to recover such linear polynomials. another important parameter in the algebraic cryptanalysis of ciphers is to effectively describe the cipher. we employ the socalled forwardbackward representation of sboxes together with universal proning to help provide a more powerful algebraic cryptanalysis based on gröbnerbasis computation. we show our method is more efficient than doing algebraic cryptanalysis with mq representation, and also than employing mq together with universal proning. to show the effectiveness of our approach, we applied it for the cryptanalysis of several lightweight block ciphers. by this approach, we managed to mount algebraic attack on 12round lblock, 6round mibs, 7round present and 9round skinny lightweight block ciphers, so far.