Solving Equation Systems by Agreeing and Learning

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 new knowledge about the system when a guess-and-verify technique is used for solving. Experiments are then presented, showing that our solving algorithm compares favorably to MiniSAT in many instances.

[1]  Fabio Massacci,et al.  Logical Cryptanalysis as a SAT Problem , 2000, Journal of Automated Reasoning.

[2]  Igor A. Semaev,et al.  Solving Multiple Right Hand Sides linear equations , 2008, Des. Codes Cryptogr..

[3]  Michael Wiener,et al.  Advances in Cryptology — CRYPTO’ 99 , 1999 .

[4]  Niklas Sörensson,et al.  Translating Pseudo-Boolean Constraints into SAT , 2006, J. Satisf. Boolean Model. Comput..

[5]  Håvard Raddum.  MRHS Equation Systems , 2007, Selected Areas in Cryptography.

[6]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[7]  Josef Pieprzyk,et al.  Cryptanalysis of Block Ciphers with Overdefined Systems of Equations , 2002, ASIACRYPT.

[8]  Yuliang Zheng,et al.  Advances in Cryptology — ASIACRYPT 2002 , 2002, Lecture Notes in Computer Science.

[9]  Adi Shamir,et al.  Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization , 1999, CRYPTO.

[10]  Marc Joye,et al.  Topics in Cryptology — CT-RSA 2003 , 2003 .

[11]  Igor A. Semaev.  Sparse Algebraic Equations over Finite Fields , 2009, SIAM J. Comput..

[12]  Jacques Patarin,et al.  About the XL Algorithm over GF(2) , 2003, CT-RSA.

[13]  J. Faugère.  A new efficient algorithm for computing Gröbner bases (F4) , 1999 .

[14]  Aggelos Kiayias,et al.  Polynomial Reconstruction Based Cryptography , 2001, Selected Areas in Cryptography.

[15]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).