Methods to solve algebraic equations in cryptanalysis
- 1 December 2010
- journal article
- Published by Walter de Gruyter GmbH in Tatra Mountains Mathematical Publications
- Vol. 45 (1) , 107-136
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.Keywords
This publication has 6 references indexed in Scilit:
- An improved exponential-time algorithm for k-SAT2002
- A Probabilistic Algorithm for k -SAT Based on Limited Local Search and RestartAlgorithmica, 2002
- GRASP: a search algorithm for propositional satisfiabilityIEEE Transactions on Computers, 1999
- Solving sparse linear equations over finite fieldsIEEE Transactions on Information Theory, 1986
- A machine program for theorem-provingCommunications of the ACM, 1962
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960