The computing-complexity (in terms of XOR, non-linear multiplication over GF(2ⁿ), and LUT access) is reduced by approximately 62.5% compared with the existing schemes. Therefore, the proposed scheme has the lowest complexity compared to existing higher-order masking schemes. Furthermore, the proposed algorithm is a general method to evaluate the inverse over GF(2ⁿ), and thus it is suitable for every block cipher constructed with inverse functions and affine transformations, e.g., SM4 and Camellia.

中文翻译：

---

块密码的快速替换框评估算法及其有效掩码方案

与现有方案相比，计算复杂度（在 XOR、GF(2 ⁿ ) 上的非线性乘法和 LUT 访问方面）降低了大约 62.5%。因此，与现有的高阶掩蔽方案相比，所提出的方案具有最低的复杂度。此外，所提出的算法是在GF(2 ⁿ )上评估逆的通用方法，因此它适用于用逆函数和仿射变换构造的每个分组密码，例如SM4和Camellia。