SCIENCE CHINA Information Sciences, Volume 59 , Issue 5 : 050104(2016) https://doi.org/10.1007/s11432-016-5548-2

Solving Boolean equation systems and applications in cryptanalysis

More info
  • ReceivedNov 9, 2015
  • AcceptedDec 30, 2015
  • PublishedApr 8, 2016



[1] Håstad J. J ACM, 2001, 48798-859 Google Scholar

[2] Zhao S, Gao X S. Theor Comput Sci, 2009, 4102285-2290 Google Scholar

[3] Faugère J C. A new efficient algorithm for computing Gröner bases without reduction to zero (F5). In: Proceedings of International Symposium on Symbolic & Algebraic Computation (ISSAC), Lille, 2002. 75-83. Google Scholar

[4] Courtois N, Klimov A, Patarin J, et al. Efficient algorithms for solving over-determined systems of multivariate polynomial equations. In: Advances in Cryptology- EUROCRYPT. Berlin: Springer, 2000. 392-407. Google Scholar

[5] Mcdonald C, Chernes C, Pieprzyk J. Attacking Bivium With MiniSat. Cryptology ePrint Archive Report 2007/040. 2007. Google Scholar

[6] Bouillaguet C, Chen H C, Cheng C M, et al. Fast exhaustive search for polynomial systems in $\F_2$. In: Cryptographic Hardware and Embedded Systems. Berlin: Springer, 2010. 203-218. Google Scholar

[7] Bardet M, Faugére J C, Salvy B, et al. J Complex, 2013, 2953-75 Google Scholar

[8] Gao X S, Huang Z. J Symb Comput, 2012, 47655-679 Google Scholar

[9] Huang Z Y, Sun Y, Lin D D. On the efficiency of solving boolean polynomial systems with the characteristic set method. ArXiv:1405.4596, 2014. Google Scholar

[10] Huang Z Y, Lin D D. A new method for solving polynomial systems with noise over $\F_2$ and its applications in cold boot key recovery. In: Selected Areas in Cryptography. Berlin: Springer, 2012. 16-33. Google Scholar

[11] Albrecht M, Cid C. Cold boot key recovery by solving polynomial systems with noise. In: Applied Cryptography and Network Security. Berlin: Springer, 2011. 57-72. Google Scholar


Contact and support