ID	原文	译文
1473	本文引入显示当前子载波质量的信道状态矩阵，以系统总功耗、单个子载波上的功耗、总时延、干扰温度限和单个子载波上的次用户数等为约束条件，以能效为目标函数，建立多约束条件下的分式规划机制。	A kind of novel sub-carrier dispatching approach based on game strategy for EEO (named EESA-EG)hasbeen put forward. In this approach, we adopted the channel state matrix to show the quality of sub-carriers under the bannerof relative constraint factors with the height of secondary user, the total data transmission rate limit, total power consumptionconstraint and power consumption constraint on a single sub-carrier. At the same time, the nonlinear fractional programming mechanism is designed to pursue the maximum of energy efficiency, which is used as the objective function.
1474	设计演化博弈算子，为每个次用户建立效用函数，	The utility func-tion for each secondary user is set up when the game operator is developed.
1475	当每个次用户的效用函数达到最优时，演化博弈达到 Nash 均衡点，此时的策略组合认为是能效相对最优的资源分配状态。	If the utility function reaches the optimization, the evolutionary game process will become Nash equilibrium, which is regarded as the relatively optimal energy efficient re-source dispatching status.
1476	通过实验仿真对比，本文给出的 EESA-EG(Energy Efficient Subcarrier Allo-cation withEvolutionary Game)算法的能效相对最优，且给出了相对最为合理的子载波分配方案，为信道状态更优的子载波分配了更多的子载波。	Based on our experimental tests, our proposed approach gives the relatively reasonable sub-carrierdispatching effect, which can dispatch more sub-carriers with relatively better channel state.
1477	ARX(Addition，Rotation，Xor)算法基于模整数加，异或加和循环移位三种运算，便于软硬件的快速实现。	ARX(Addition, Rotation, Xor)algorithms are based on three operations:modular addition, exclusive-ORand bitwise rotation, which execute very fast in both software and hardware.
1478	不可能差分分析和零相关分析是攻击 ARX 的有效方法，攻击的关键是搜索更长轮数、更多数量的不可能差分和零相关区分器。	Impossible differential cryptanalysis and zero-correlation linear cryptanalysis are among the most powerful attacks for ARX ciphers. The key problem for the attacks is searching more and longer impossible differentials and zero-correlation linear approximations.
1479	目前很多的搜索方法都没有充分考虑非线性组件的性质，往往不能搜索得到更好、更准确的区分器。	Although there are many au-tomatic search algorithms, these approaches do not fully utilize the non-linear component properties, which cannot reachtheir potential.
1480	本文提出了基于 SAT(Satisfiability)的 ARX 不可能差分和零相关区分器的自动化搜索算法。	A SAT(Satisfiability)-based model to automatic search for impossible differentials and zero-correlation lin-ear approximations in ARX is proposed.
1481	通过分析 ARX 算法组件的性质，特别是常规模加和密钥模加这两种非线性运算差分和线性传播的特性，给出了高效简单的 SAT 约束式。在此基础上，建立 SAT 模型进行区分器的搜索。	By exploiting behaviors of every component, especially the differential and linearpropagation properties through general modular addition and key modular addition operations, we generate computable andeasily implementable constraints and establish the SAT-based model.
1482	作为应用，本文首次给出了 Chaskey 算法 13 条 4 轮不可能差分和 1 条 4 轮零相关区分器;	As applications, we apply our model to Chaskey, SPECK and HIGHT. For Chaskey, we are able to find 13 4-round impossible differentials and 1 4-round zero-correlationlinear approximation for the first time.