多攻击模式下有向复杂网络可控鲁棒性研究

基于有向复杂网络理论,针对军事网络易受攻击的现状,对多重同余网络、无标度网络、q-回路网络、随机矩形网络等不同网络进行了6种不同模式的攻击,并研究了多攻击模式下不同网络的可控鲁棒性。仿真分析了在不同节点移除比率和边移除比率下,观察不同网络在不同攻击下的可控鲁棒性的表现。实验结果表明,随机矩形网络的可控鲁棒性在各种攻击模式下整体优于其他网络,说明具有多环状结构的有向复杂网络可控鲁棒性更强。

多保护对象,多攻击目标攻击的目标威胁评估

随着信息化快速发展,空中指挥控制成为预警机发展的一种必然趋势。由此引出多保护对象,多攻击目标的排序问题。本文分析了目标、预警机与被保护对象之间的态势关系,利用坐标转换获取影响目标威胁评估的因素值,然后根据迭代原理,利用多重灰色关联分析法,计算得出多目标对于多对象整体而言的综合威胁评估值。最后,通过案例仿真验证,表明本文所提算法与实际情况相符,且易于工程实现。

基于博弈论的多攻击者假数据注入攻击分析

为了研究多攻击者情况下的信息物理系统网络安全问题,假设攻击者可以向数据传输通道注入假数据而不被检测到。考虑两种不同的攻击情形:第一,所有攻击者同时发起成功攻击的概率为1;第二,每个攻击者都以一定的概率注入假数据。假设不同的攻击者可以攻击不同的传输通道,采用Stackelberg博弈框架来描述攻防双方的决策过程,并考虑了双方的成本限制。设计了博弈双方的最优策略,该策略构成了博弈的Stackelberg均衡点。最后,通过数值算例验证了所设计攻防双方最优策略的有效性。

一种自适应多攻击角约束末制导方法

针对四代火力打击体系对导弹在终端以特定纵、侧向攻击角命中目标以发挥最大毁伤效能的需求,研究了一种实现终端位置及纵、侧向多攻击角约束的自适应非线性末制导方法。建立弹道坐标系中的三自由度运动模型,给出了比例导引形式下可实现期望约束的导引系数选取原则及计算模型,并设计了导弹纵、侧向协同末制导逻辑,最后考虑到非理想跟踪等不确定因素,推导给出了可提高终端攻击角精确性的纵、侧向导引系数闭环非线性自适应方法。多初始状态标称仿真及不确定性蒙特卡洛仿真结果表明,所提出末制导方法在命中目标的前提下可有效实现终端纵、侧向多攻击角约束。

HEURISTIC PARTICLE SWARM OPTIMIZATION ALGORITHM FOR AIR COMBAT DECISION-MAKING ON CMTA

Combining the heuristic algorithm （HA） developed based on the specific knowledge of the cooperative multiple target attack （CMTA） tactics and the particle swarm optimization （PSO）, a heuristic particle swarm optimization （HPSO） algorithm is proposed to solve the decision-making （DM） problem. HA facilitates to search the local optimum in the neighborhood of a solution, while the PSO algorithm tends to explore the search space for possible solutions. Combining the advantages of HA and PSO, HPSO algorithms can find out the global optimum quickly and efficiently. It obtains the DM solution by seeking for the optimal assignment of missiles of friendly fighter aircrafts （FAs） to hostile FAs. Simulation results show that the proposed algorithm is superior to the general PSO algorithm and two GA based algorithms in searching for the best solution to the DM problem.

MULTI-FIGHTER COORDINATED MULTI-TARGET ATTACK SYSTEM

A definition of self-determined priority is used in airfight decision firstly. A scheme of grouping the whole fighters is introduced, and the principle of target assignment and fire control is designed. Based on the neutral network, the decision algorithm is derived and the whole coordinated decision system is simulated. Secondly an algorithm for missile-attacking area is described and its calculational result is obtained under initial conditions. Then the attacking of missile is realized by the proportion guidance. Finally, a multi-target attack system. The system includes airfight decision, estimation of missile attack area and calculation of missile attack procedure. A digital simulation demonstrates that the airfight decision algorithm is correct. The methods have important reference values for the study of fire control system of the fourth generation fighter.

Quantum Polynomial-Time Fixed-Point Attack for RSA

Security analysis of public-key cryptosystems is of fundamental significance for both theoretical research and applications in cryptography. In particular, the security of widely used public-key cryptosystems merits deep research to protect against new types of attacks. It is therefore highly meaningful to research cryptanalysis in the quantum computing environment. Shor proposed a wellknown factoring algorithm by finding the prime factors of a number n =pq, which is exponentially faster than the best known classical algorithm. The idea behind Shor's quantum factoring algorithm is a straightforward programming consequence of the following proposition: to factor n, it suffices to find the order r; once such an r is found, one can compute gcd( a^(r/2) ±1, n)=p or q. For odd values of r it is assumed that the factors of n cannot be found(since a^(r/2) is not generally an integer). That is, the order r must be even. This restriction can be removed, however, by working from another angle. Based on the quantum inverse Fourier transform and phase estimation, this paper presents a new polynomial-time quantum algorithm for breaking RSA, without explicitly factoring the modulus n. The probability of success of the new algorithm is greater than 4φ( r)/π~2 r, exceeding that of the existing quantum algorithm forattacking RSA based on factorization. In constrast to the existing quantum algorithm for attacking RSA, the order r of the fixed point C for RSA does not need to be even. It changed the practices that cryptanalysts try to recover the private-key, directly from recovering the plaintext M to start, a ciphertext-only attack attacking RSA is proposed.

A Digital Evidence Fusion Method in Network Forensics Systems with Dempster-Shafer Theory

Network intrusion forensics is an important extension to present security infrastructure,and is becoming the focus of forensics research field.However,comparison with sophisticated multi-stage attacks and volume of sensor data,current practices in network forensic analysis are to manually examine,an error prone,labor-intensive and time consuming process.To solve these problems,in this paper we propose a digital evidence fusion method for network forensics with Dempster-Shafer theory that can detect efficiently computer crime in networked environments,and fuse digital evidence from different sources such as hosts and sub-networks automatically.In the end,we evaluate the method on well-known KDD Cup1999 dataset.The results prove our method is very effective for real-time network forensics,and can provide comprehensible messages for a forensic investigators.

Construction of Odd-Variable Boolean Function with Maximum Algebraic Immunity Using Univariate Polynomial Representation

To protect against algebraic attacks, a high algebraic immunity is now an important criterion for Boolean functions used in stream ciphers. In this paper, a new method based on a univariate polynomial representation of Boolean functions is proposed. The proposed method is used to constmct Boolean functions with an odd number of variables and with maximum algebraic immunity. We also discuss the nonlinearity of the constructed functions. Moreover, a lower bound is deter- mined for the number of Boolean functions with rmximum algebraic immunity.

Cooperative Guidance Law Design for Simultaneous Attack with Multiple Missiles Against a Maneuvering Target

This paper considers the simultaneous attack problem of multiple missiles against a maneuvering target. Different from most of the existing literature in which the simultaneous attack problem is formulated as a consensus problem of missiles＇ time-to-go estimates, this paper formulates it as the consensus problem of missiles＇ ranges-to-go. Based on this strategy, novel distributed guidance laws are proposed to solve the simultaneous attack problem with the target of unknown maneuverability.Adaptive control method is introduced to estimate the upper bound of the target＇s acceleration. The effectiveness of the proposed guidance laws is verified both theoretically and numerically.

Side-channel attacks and learning-vector quantization

The security of cryptographic systems is a major concern for cryptosystem designers, even though cryptography algorithms have been improved. Side-channel attacks, by taking advantage of physical vulnerabilities of cryptosystems, aim to gain secret information. Several approaches have been proposed to analyze side-channel information, among which machine learning is known as a promising method. Machine learning in terms of neural networks learns the signature （power consumption and electromagnetic emission） of an instruction, and then recognizes it automatically. In this paper, a novel experimental investigation was conducted on field-programmable gate array （FPGA） implementation of elliptic curve cryptography （ECC）, to explore the efficiency of side-channel information characterization based on a learning vector quantization （LVQ） neural network. The main characteristics of LVQ as a multi-class classifier are that it has the ability to learn complex non-linear input-output relationships, use sequential training procedures, and adapt to the data. Experimental results show the performance of multi-class classification based on LVQ as a powerful and promising approach of side-channel data characterization.

As clear as mud： Turbidity induces behavioral changes in the African cichlid Pseudocrenilabrus multicolor

Aquatic biodiversity is being lost at an unprecedented rate. One factor driving this loss is increased turbidity, an en- vironmental stressor that can impose behavioral, morphological, and/or physiological costs on fishes. Here we describe the be- havioral response of a widespread African cichlid, Pseudocrenilabrus multicolor victoriae, to turbidity. We used a split-brood rearing design to test if F1 offspring reared in turbid water, originating from river （turbid） and swamp （clear） populations, behave differently than full-sibs reared in clear water. We examined two facets of behavior： （1） behaviors of fish in full sib groups, in- eluding activity level and social dynamics collected during the rearing period; and （2） male aggressive behavior directed at poten- tial male competitors after fish had reached maturity; this was done in an experimental set-up independent of the rearing aquaria. Regardless of population of origin, fish reared in turbid water were marginally less active and performed fewer social behaviors than those reared in clear water. On the other hand, when tested against a competitor in turbid water, males performed more ag- gressive behaviors, regardless of population of origin or rearing environment, Our results suggest a plastic behavioral response to turbidity that may allow P. multicolor to persist over a range of turbidity levels in nature by decreasing activity and general social behaviors and intensifying reproductive behaviors to ensure reproductive success [Current Zoology 58 （1）： 146-157, 2012].