Comparison of Solving Techniques for Non-linear Sparse Equations over Finite Fields with Application in Cryptanalysis

[1]  David A. McAllester,et al.  A Rearrangement Search Strategy for Determining Propositional Satisfiability , 1988, AAAI.

[2]  Igor A. Semaev,et al.  Solving MRHS linear equations , 2007, IACR Cryptol. ePrint Arch..

[3]  Niklas Srensson,et al.  An Extensible SAT-solver [ver 1.2] , 2003 .

[4]  Kazuo Iwama,et al.  Worst-Case Upper Bounds for kSAT (Column: Algorithmics) , 2004, Bull. EATCS.

[5]  Jean Charles Faugère,et al.  A new efficient algorithm for computing Gröbner bases without reduction to zero (F5) , 2002, ISSAC '02.

[6]  Donald E. Knuth,et al.  Big Omicron and big Omega and big Theta , 1976, SIGA.

[7]  Bo-Yin Yang,et al.  On Asymptotic Security Estimates in XL and Gröbner Bases-Related Algebraic Cryptanalysis , 2004, ICICS.

[8]  David R. Musser,et al.  STL tutorial and reference guide - C++ programming with the standard template library , 1996, Addison-Wesley professional computing series.

[9]  Rakesh Krishnaiyer,et al.  An Overview of the Intel® IA-64 Compiler , 1999 .

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

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

[12]  Matthew L. Ginsberg,et al.  Dynamic Backtracking , 1993, J. Artif. Intell. Res..

[13]  Igor A. Semaev,et al.  New Technique for Solving Sparse Equation Systems , 2006, IACR Cryptology ePrint Archive.

[14]  Björn Karlsson,et al.  Beyond the C++ Standard Library: An Introduction to Boost , 2005 .

[15]  J. Meigs,et al.  WHO Technical Report , 1954, The Yale Journal of Biology and Medicine.

[16]  Ming Ouyang.  How Good Are Branching Rules in DPLL? , 1998, Discret. Appl. Math..

[17]  Daniel Singer.  Parallel Resolution of the Satisfiability Problem: A Survey , 2006 .

[18]  Alain Vagner,et al.  Parallel Resolution of the Satisfiability Problem (SAT) with OpenMP and MPI , 2005, PPAM.

[19]  Daniele Pretolani,et al.  Efficiency and stability of hypergraph SAT algorithms , 1993, Cliques, Coloring, and Satisfiability.

[20]  Joao Marques-Silva,et al.  The Impact of Branching Heuristics in Propositional Satisfiability Algorithms , 1999, EPIA.

[21]  Mark Allen Weiss,et al.  Data structures and algorithm analysis in C , 1991 .

[22]  Armando Tacchella,et al.  Theory and Applications of Satisfiability Testing , 2003, Lecture Notes in Computer Science.

[23]  Communism,et al.  University of Pennsylvania , 1847, Medical History.

[24]  Jinchang Wang,et al.  Solving propositional satisfiability problems , 1990, Annals of Mathematics and Artificial Intelligence.

[25]  Mark Allen Weiss,et al.  Data structures and algorithm analysis in Ada , 1993 .

[26]  Jacques Carlier,et al.  SAT versus UNSAT , 1993, Cliques, Coloring, and Satisfiability.