ID	原文	译文
3923	基于差分代数方法，利用猜测确定技术给出了 Nonce 重用两次情况下 ACORN v3 的状态恢复攻击，攻击所需的计算复杂度为 2 122.5 c，数据复杂度和存储复杂度可忽略不计，其中 c 是求解线性方程组的复杂度。	Based on differential-algebraic method and guess-and-determine technique, the state recovery attack ofACORN v3 was presented when one pair of key and Nonce was used to encrypt two messages. The time complexity of the attack was 2 122.5 c, where c was the time complexity of solving linear equations. The data complexity and the storagecomplexity were negligible.
3924	针对 Nonce多次重用时的情形进行了分析，发现 ACORN v3 较复杂的滤波函数，使由密钥流直接提取关于内部状态线性方程的方法变得不可行，从而有效规避了通过增加 Nonce 重用次数来显著降低攻击复杂度的安全风险。	Furthermore, according to the analysis on the sense of multiple nonce reuse, it is found that relatively complicated filter function of ACORN v3 makes it infeasible to extract the linear equations about the internalstate directly from key streams. Thus, the risk of significantly reducing the attack complexity by increasing the times ofnonce reuse can be effectively avoided.
3925	针对大规模离散工程优化问题，提出一种改进的离散量子粒子群优化算法（IDQPSO-SA）。	To address the large-scale discrete optimization problem, a cooperative optimization algorithm calledIDQPSO-SA was proposed.
3926	首先，提出一种适应度的二次选择更新平均最优位置策略，使 QPSO 能够适用离散空间的优化问题。	First, a strategy by applying two selections on the averaging fitness values to update the meanbest position was presented, which could overcome the deficiency that QPSO was not applicable for discrete problems.
3927	其次，引入二次切割与连接（DCJ）排序策略加速搜索进程。	Second, the double cut joining (DCJ) sorting strategy was incorporated into IDQPSO-SA, since the DCJ sorting strategycould considerably reduce the search space.
3928	最后，在 QPSO 并行搜索基础上，引进模拟退火（SA）的概率突跳性，协同进行全局搜索。	Finally, the probability jumping ability of simulated annealing (SA) wascombined with the parallel search of QPSO, and the global search was carried out collaboratively.
3929	在大规模、高维离散工程优化问题上进行了测试，并同已有算法进行比较，结果表明，IDQPSO-SA进一步提高了面向大规模离散优化问题时的搜索效率，并有效提升了算法的性能。	By comparing with ex-isting algorithms, the experimental results show that IDQPSO-SA further improves the search efficiency and has a com-parable performance when faced with large-scale discrete optimization problems.
3930	针对网络攻击者需要依赖探测到的信息决定下一步动作这一特点，将非合作信号博弈理论应用于网络攻防分析。	In view of the characteristic that attacker depended on the detected information to decide the next actions,the non-cooperative signal game theory was applied to analyze cyber attack and defense.
3931	通过构建多阶段网络欺骗博弈模型，对网络攻防过程中存在的信号欺骗机制进行深入研究，充分考虑网络欺骗信号衰减作用，实现多阶段网络攻防对抗的动态分析推演。	The signal deception mechanism in the process of cyber attack and defense was considered deeply by constructing a multi-stage cyberdeception game model, and the dynamic analysis and deduction of the multi-stage cyber attack and defense was realized by considering the attenuation of cyber deception signals.
3932	基于攻防分析改进了多阶段网络欺骗博弈均衡求解方法，并设计出最优网络欺骗防御策略选取算法。	A solution for multi-stage cyber deception gameequilibrium was improved based on analysis of cyber attack and defense, and an optimal algorithm for selecting cyberdeception defense strategies was designed.