Phase transition in a system of random sparse Boolean equations

[1] GOERDT, A.: A threshold for unsatisfiability, J. Comput. System Sci. 53 (1996), 469-486.10.1006/jcss.1996.0081Search in Google Scholar

[2] RADDUM, H.-SEMAEV, I.: New technique for solving sparse equation systems, Cryptology ePrint Archive: Report 2006/475, http://eprint.iacr.org/2006/475.Search in Google Scholar

[3] RADDUM, H.-SEMAEV, I.: Solving multiple right hand sides linear equations, Des. Codes Cryptogr. 49 (2008), 147-160.10.1007/s10623-008-9180-zSearch in Google Scholar

[4] SCHILLING, T.-RADDUM, H.: Solving equation systems by Agreeing and Learning, in: Arithmetics of Finite Fields, WAIFI 2010 (M.A. Hasan and T. Helleseth, eds.), Lecture Notes in Comput. Sci., Vol. 6087, Springer-Verlag, Berlin, 2010, pp. 151-16510.1007/978-3-642-13797-6_11Search in Google Scholar

[5] SEMAEV, I.: Improved Agreeing-Gluing Algorithm, Cryptology ePrint Archive: Report 2010/140, http://eprint.iacr.org/2010/140.Search in Google Scholar

[6] WARSHALL, S.: A theorem on Boolean matrices, J. Assoc. Comput. Mach. 9 (1962), 11-12.10.1145/321105.321107Search in Google Scholar

[7] ZAJAC, P.: Solving SPN-based system of equations with syllogisms, in: 1st Plenary Conference of the NIL-I-004, Bergen, 2009 (A. Kholosha, K. Nemoga, M. Sýs, eds.), STU Bratislava, 2009, pp. 21-30.Search in Google Scholar

[8] ZAJAC, P.: Implementation of the method of syllogisms, (preprint).Search in Google Scholar

[9] ZAKREVSKIJ, A.-VASILKOVA, I.: Reducing large systems of Boolean equations, in: 4th International Workshop on Boolean Problems, Freiberg University of Mining and Technology, Freiberg, 2000, pp. 21-28.Search in Google Scholar