Cube 攻击的几篇文章,Cube Attack由Itai Dinur 和Adi Shamir于2008年提出。这种攻击并不是全新的，但是它把以前多种启发式攻击的技巧综合起来，仔细分析了攻击未知的、随机的主多项式成功的复杂度和成功概率。-Some papers of Cube attack,Cube attacks work well for random polynomials of small degree. Real-world ciphers, when viewed as polynomials, don t have small degree. Every real-world cipher has about half of the possible monomials of degree 0, about half of the possible monomials of degree 1, about half of the possible monomials of degree 2, about half of the possible monomials of degree 3, ..., about half of the possible monomials of degree 30, about half of the possible monomials of degree 31, about half of the possible monomials of degree 32, ..., about half of the possible monomials of degree 40, ..., about half of the possible monomials of degree 50, etc., continuing far beyond the degrees that cube attacks could possibly reach.