<abstract xmlns="http://www.w3.org/1999/xhtml"><p>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 categories: Gröbner basis algorithms, SAT-solving methods and Agreeing-Gluing algorithms.</p></abstract>

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 categories: Gröbner basis algorithms, SAT-solving methods and Agreeing-Gluing algorithms.

Methods to solve algebraic equations in cryptanalysis

Department of Informatics, University of Bergen, N–5020 Bergen, NORWAY

Department of Applied Informatics and Computing Technologies, Faculty of Electrical Engineering, Slovak Technical University, Ilkoviˇcova 3, SK–812-19 Bratislava, SLOVAKIA

Tatra Mountains Mathematical Publications

{"article-title":"Methods to solve algebraic equations in cryptanalysis"}

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

Methods to solve algebraic equations in cryptanalysis

Data publikacji: 12 lis 2012

Zakres stron: 107 - 136

DOI: https://doi.org/10.2478/v10127-010-0009-6

Słowa kluczowe
equation systems, finite fields, Gröbner basis, k-SAT, agreeing, gluing, MRHS, cryptanalysis.

This content is open access.

Methods to solve algebraic equations in cryptanalysis

Data publikacji: 12 lis 2012

Zakres stron: 107 - 136

DOI: https://doi.org/10.2478/v10127-010-0009-6

Słowa kluczoweequation systems, finite fields, Gröbner basis, k-SAT, agreeing, gluing, MRHS, cryptanalysis.

This content is open access.

Słowa kluczowe
equation systems, finite fields, Gröbner basis, k-SAT, agreeing, gluing, MRHS, cryptanalysis.