We analyze how fast we can solve general systems of multivariate equations of various low
degrees over F_2; this is a well known hard problem which is important both in itself and as …

In this work, we survey the existing research in the area of algebraic cryptanalysis based on
Multiple Right-Hand Sides (MRHS) equations (MRHS cryptanalysis). MRHS equation is a …

This work is devoted to attacking the small scale variants of the Advanced Encryption
Standard (AES) via systems that contain only the initial key variables. To this end, we …

Lightweight cipher designs try to minimize the implementation complexity of the cipher while
maintaining some specified security level. Using only a small number of AND gates lowers …

Multiple right-hand side (MRHS) equations over finite fields are a relatively new tool useful
for algebraic cryptanalysis. The main advantage is in an efficient representation of the …

In this paper we describe an approach for solving complex multivariate equation systems
related to algebraic cryptanalysis. The work uses the newly introduced Compressed Right …

We study a new representation of non-linear multivariate equations for algebraic
cryptanalysis. Using a combination of multiple right hand side equations and binary decision …

The goal of the present paper is a survey of methods to solve equation systems common in
cryptanalysis. The methods depend on the equation representation and fall into three …

In our constribution we explore a combination of local reduction with the method of
syllogisms and the applications of generic guessing strategies in the cryptanalysis of the …

We study sparse non-linear equation systems defined over a finite field. Representing the
equations as symbols and using the Agreeing algorithm we show how to learn and store …