摘要
创新点
本文给出了布尔方程组求解问题近似算法复杂度的最新结果, 说明了随机赋值是近似求解布尔方程组的最佳多项式时间算法。 介绍了求解布尔方程组的特征列算法以及其计算复杂度的最新进展, 通过实验结果说明了该算法能够高效求解若干密码分析中出现的布尔方程组。
This is a preview of subscription content, log in via an institution to check access.
References
Håstad J. Some optimal inapproximability results. J ACM, 2001; 48: 798–859
Zhao S, Gao X S. Minimal achievable approximation ratio for MAX-MQ in finite fields. Theor Comput Sci, 2009; 410: 2285–2290
Faugère J C. A new efficient algorithm for computing Gr¨oner bases without reduction to zero (F5). In: Proceedings of International Symposium on Symbolic & Algebraic Computation (ISSAC), Lille, 2002. 75–83
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
Mcdonald C, Chernes C, Pieprzyk J. Attacking Bivium With MiniSat. Cryptology ePrint Archive Report 2007/040. 2007
Bouillaguet C, Chen H C, Cheng C M, et al. Fast exhaustive search for polynomial systems in F2. In: Cryptographic Hardware and Embedded Systems. Berlin: Springer, 2010. 203–218
Bardet M, Faugére J C, Salvy B, et al. On the complexity of solving quadratic boolean systems. J Complex, 2013; 29: 53–75
Gao X S, Huang Z. Characteristic set algorithms for equation solving in finite fields. J Symb Comput, 2012; 47: 655–679
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
Huang Z Y, Lin D D. A new method for solving polynomial systems with noise over F2 and its applications in cold boot key recovery. In: Selected Areas in Cryptography. Berlin: Springer, 2012. 16–33
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
