Solving equation systems by agreeing and learning

Authors:
Thorsten Ernst Schilling;Håvard Raddum
Affiliations:
Selmer Center, University of Bergen;Selmer Center, University of Bergen
Venue:
WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
Year:
2010

Citing 9
Cited 1

A machine program for theorem-proving

Communications of the ACM
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Logical Cryptanalysis as a SAT Problem

Journal of Automated Reasoning
Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization

CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Cryptanalysis of Block Ciphers with Overdefined Systems of Equations

ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Solving Multiple Right Hand Sides linear equations

Designs, Codes and Cryptography
Sparse Algebraic Equations over Finite Fields

SIAM Journal on Computing
About the XL algorithm over GF(2)

CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
MRHS equation systems

SAC'07 Proceedings of the 14th international conference on Selected areas in cryptography

Solving compressed right hand side equation systems with linear absorption

SETA'12 Proceedings of the 7th international conference on Sequences and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.