基于RoboCup3D仿真平台的双足机器人大脚球进攻策略设计

RoboCup3D仿真系统融合了人工智能、传感器、通信、智能控制等多门学科的相关技术.针对RoboCup3D仿真中双足机器人的踢球动作设计问题(如:踢球力度弱、摔倒等)提出了一种基于大脚球的进攻策略.采用大脚球的进攻策略可以有效的促使足球快速的踢进对方半场后方,在仿真比赛中极具攻击性.仿真结果验证了它的有效性和实用性.     

基于扩频的数字音频水印技术研究

论述了时域、频域的扩频数字音频水印嵌入方案。通过分析相关检测的统计特性,得出伪随机序列的长度与音频载体本身的高度相关性直接影响检测的虚警和漏警概率,且通过实验仿真验证了上述结论的正确性,并归纳了目前常用的白化滤波器。讨论了扩频数字音频水印的同步问题,最后总结了当前存在的问题并对其发展进行了展望。     

分组密码算法CTC的立方分析

立方攻击是在2009年欧洲密码年会上由Dinur和Shamir提出的一种新型密码分析方法,该方法旨在寻找密钥比特之间的线性关系。CTC(Courtois Toy Cipher)是N.Courtois设计的一种用于密码分析研究的分组密码算法,该算法的密钥长度、明文长度和迭代轮数都是可变的。文中利用立方攻击方法针对密钥长度为60bit的4轮CTC进行了分析,在选择明文攻击条件下,结合二次测试可恢复全部密钥,密钥恢复阶段仅需要不到2~10次加密算法。     

基于脆弱性变换的网络动态防御有效性分析方法

有效性分析对合理制订最优网络动态防御策略至关重要.首先利用随机抽样模型从脆弱性变换角度给出入侵成功概率计算公式,用于刻画变换空间、变换周期及脆弱性数量对网络入侵过程的影响;然后针对单、多脆弱性变换两种情况,分别给出相应的入侵成功概率极限定理并予以证明,同时给出两种情况下的最优变换空间计算方法;仿真结果表明,增大单条入侵路径上依次攻击的脆弱性数量、减小变换周期可持续提高网络动态防御有效性,而增大变换空间初始可以提升网络动态防御有效性,但是由于入侵成功概率会随变换空间的持续增大而逐渐收敛,在入侵成功概率收敛时,有效性无法持续提高.     

航空相机扫描像移片上补偿技术

查打一体化是当前航空相机的一个主要发展方向,其中一项关键技术为扫描像移的动态、高精度补偿.基于面阵探测器的时间延迟积分(TDI)扫描像移补偿方式相比于光机式的像移补偿方式具有天然的优势,然而当前的面阵探测器TDI像移补偿精度是像素级的,进一步提高查打一体化相机分辨率遇到了瓶颈.针对于此本文首先介绍了查打一体化航空相机工作原理,然后针对帧转移CCD的特性建立了电荷行间转移的数学模型与电荷转移像移的调制传递函数模型,在此基础上提出了一种查打一体化航空相机扫描像移的片上补偿方法,采用该方法可将西相位面阵TDI CCD的像移补偿精度提高至1/2φ像元.最后搭建了实验平台并给出了二、三、四相位面阵TDI CCD电荷转移像移对遥感图像质量的影响,同时也证明了提出的方法能够显著提高图像质量.     

基于攻击图的多源告警关联分析方法

现有基于攻击图(attack graph)的告警关联分析方法难以全面处理告警关联关系,同时,漏报推断和告警预测带来大量冗余路径误报。针对以上问题提出了基于攻击图的多源告警关联分析算法,能够综合应用图关系和阈值限制进行联动推断和预测,达到更为全面解决攻击图中的告警漏报和减少误报数量的目的。同时,将告警处理算法并行化,提出了AG-PAP告警并行处理引擎。实验表明,该方法能够提升关联分析的有效性和性能表现。     

基于 K 均值多重主成分分析的 App-DDoS 检测方法

针对应用层分布式拒绝服务攻击,利用Web日志的数据挖掘方法提出一种K均值多重主成分分析算法和基于该算法的App-DDoS检测方法。首先,通过分析正常用户和攻击者的访问行为区别,给出提取统计属性特征的方法;其次,根据主成分分析法的数据降维特性并利用最大距离划分法,提出一种K均值多重主成分分析算法,构建基于该算法的检测模型。最后,采用CTI-DATA数据集及模拟攻击获取的数据集,进行与模糊综合评判、隐半马尔科夫模型、D-S证据理论3种检测方法的App-DDoS攻击检测对比实验,实验结果证明 KMPCAA检测算法具有较好的检测性能。     

基于碰撞的选择明文简单功耗聚类攻击算法(英文)

Chosen-message pair Simple Power Analysis (SPA) attacks were proposed by Boer, Yen and Homma, and are attack methods based on searches for collisions of modular multiplication. However, searching for collisions is difficult in real environments. To circumvent this problem, we propose the Simple Power Clustering Attack (SPCA), which can automatically identify the modular multiplication collision. The insignificant effects of collision attacks were validated in an Application Specific Integrated Circuit (ASIC) environment. After treatment with SPCA, the automatic secret key recognition rate increased to 99%.     

The Full Cost of Cryptanalytic Attacks

An open question about the asymptotic cost of connecting many processors to a large memory using three dimensions for wiring is answered, and this result is used to find the full cost of several cryptanalytic attacks. In many cases this full cost is higher than the accepted complexity of a given algorithm based on the number of processor steps. The full costs of several cryptanalytic attacks are determined, including Shanks method for computing discrete logarithms in cyclic groups of prime order n, which requires n^1/2+o(1) processor steps, but, when all factors are taken into account, has full cost n^2/3+o(1). Other attacks analyzed are factoring with the number field sieve, generic attacks on block ciphers, attacks on double and triple encryption, and finding hash collisions. In many cases parallel collision search gives a significant asymptotic advantage over well-known generic attacks.     

Attacks and improvements on the RFID authentication protocols based on matrix

Most of the Radio Frequency IDentification (RFID) authentication protocols, proposed to preserve security and privacy, are analysed to show that they can not provide security against some passive or active attacks. In this paper, the security of two matrix-based protocols, proposed by Karthikeyan and Nesterenko (KN protocol) and Ramachandra et al. (RRS protocol) that conform to Electronic Product Code Class-1 Generation-2 (EPC Class-1 Gen-2) standard, are investigated. Using the linear relationship of multiplication of matrix and vector, we point out that both protocols can not provide scalability, and they are vulnerable to passive impersonation attack. In addition, both protocols are totally insecure if the adversary can compromise one tag to extract the secrets. A modified lightweight matrix-based authentication protocol is presented, which can resist mainly common attacks on an RFID authentication system including eavesdropping, relay attack, desynchronization attack, impersonation attack and tag tracking attack. The new protocol also has the desirable scalability property and can keep secure under compromising attack.