S盒是很多分组密码算法唯一的非线性部件,它的密码学性质对分组密码的安全性至关重要。该文主要研究与有限域上逆变换仿射等价S盒的代数复杂度问题,利用有限域上的线性化多项式给出了两类S盒的最大代数复杂度,并得到了Camellia类S盒退化为AES类S盒的一个充分必要条件。 S-boxes are the only non-linear component of many block ciphers and their cryptographic properties are crucial for the security of block ciphers. In this paper, the algebraic complexity of affine equivalent S-boxes with inverse transformation in finite fields is studied. The maximum algebraic complexity of two kinds of S-boxes is given by the linearized polynomials over the finite field, and the Camellia-like S-boxes A Sufficient and Necessary Condition to Degenerate into AES S - box.