Non-Monomial Permutations with Differential Uniformity Six

In this paper, a family of non-monomial permutations over the finite field \({F_{{2^n}}}\) with differential uniformity at most 6 is proposed, where n is a positive integer. The algebraic degree of these functions is also determined.     

非线性微分-代数系统稳定性的几个判据

研究非线性微分－代数系统的稳定性问题，给出利用非线性函数的偏导数矩阵判别非线性微分－代数系统平衡态稳定和不稳定的几个判据，所得结果形式简洁，易于应用．最后利用例子说明所得判据的有效性     

On algebraic immunity of trace inverse functions on finite fields of characteristic two

The trace inverse functions Tr(λx~(-1)) over the finite field F_(2~n) are a class of very important Boolean functions and are used in many stream ciphers such as SFINKS,RAKAPOSHI,the simple counter stream cipher(SCSC) presented by Si W and Ding C(2012),etc.In order to evaluate the security of those ciphers in resistance to(fast) algebraic attacks,the authors need to characterize algebraic properties of Tr(λx~(-1)).However,currently only some bounds on algebraic immunity of Tr(λx~(-1)) are given in the public literature,for example,the NGG upper bound and the Bayev lower bound,etc.This paper gives the exact value of the algebraic immunity of Tr(λx~(-1)) over F_(2~n),that is,AI(Tr(λx~(-1))) =[2n~(1/2)]- 2,where n ≥ 2,A ∈ F_(2~n) and λ≠ 0,which shows that Dalai's conjecture on the algebraic immunity of Tr(λx~(-1)) is correct.What is more,the authors demonstrate some weak properties of Tr(λx~(-1)) against fast algebraic attacks.     

Recent Results on Constructing Boolean Functions with (Potentially) Optimal Algebraic Immunity Based on Decompositions of Finite Fields

Boolean functions with optimal algebraic immunity (OAI functions) are important cryptographic primitives in the design of stream ciphers. During the past decade, a lot of work has been done on constructing such functions, among which mathematics, especially finite fields, play an important role. Notably, the approach based on decompositions of additive or multiplicative groups of finite fields turns out to be a very successful one in constructing OAI functions, where some original ideas are contributed by Tu and Deng (2012), Tang, et al. (2017), and Lou, et al. (2015). Motivated by their pioneering work, the authors and their collaborators have done a series of work, obtaining some more general constructions of OAI functions based on decompositions of finite fields. In this survey article, the authors review our work in this field in the past few years, illustrating the ideas for the step-by-step generalizations of previous constructions and recalling several new observations on a combinatorial conjecture on binary strings known as the Tu-Deng conjecture. In fact, the authors have obtained some variants or more general forms of Tu-Deng conjecture, and the optimal algebraic immunity of certain classes of functions we constructed is based on these conjectures.

     

One AES S-box to increase complexity and its cryptanalysis

It is well known that the algebraic expression of ASS S-box is very simple and only 9 terms are involved. Hence, AES security is suspected although there is no vulnerability on it so far. To eliminate the weakness of extremely small terms in the algebraic expression of AES S-box, one improved AES S-box is proposed, which preserves the algebraic degree invariable but significantly increases the number of its algebraic expression terms from 9 to 255. At the same time, Boolean function has good characters in balance and strict avalanche criterion (SAC), etc. Finally, it is proved that the improved AES S-box scheme is secure gainst the powerful known differential and linear cryptanalysis.     

A Combinatorial Condition and Boolean Functions with Optimal Algebraic Immunity

This paper first proposes an infinite class of 2k-variable Boolean functions with high nonlinearity and high algebraic degree. Then an infinite class of balanced Boolean functions are proposed by modifying the above Boolean functions. This class of balanced Boolean functions have optimal algebraic degree and high nonlinearity. Both classes have optimal algebraic immunity based on a general combinatorial conjecture.     

A note on two classes of Boolean functions with optimal algebraic immunity

Tu and Deng proposed a class of bent functions which are of optimal algebraic immunity under the assumption of a combinatorial conjecture.In this paper,the authors compute the dual of the Tu-Deng functions and then show that they are still of optimal algebraic immunity under the assumption of the same conjecture.For another class of Boolean functions constructed by Tang,et al.which are of optimal algebraic immunity with similar forms to Tu-Deng functions,the authors show that they are not bent functions by using some basic properties of binary complete Kloosterman sums.     

非线性时变系统的部分指数稳定性分析

讨论了非线性时变系统平凡解的部分指数稳定性和全局部分指数稳定性。分别利用数量与向量Lyapunov函数并结合数量与向量比较原理,得到了保证系统平凡解部分指数稳定和全局部分指数稳定的一系列充分条件。作为特殊情形,对于一类定常拟线性系统,在一定的条件下,若其对应的线性系统的平凡解是部分渐近稳定的,利用二次型Lyapunov函数得到了保证拟线性系统的平凡解是全局部分指数稳定的一个代数判据,这些结果在实际应用中具有一定的指导意义。最后用两个数值例子对所得主要结果加以阐明。     

A Construction of 1-Resilient Boolean Functions with Good Cryptographic Properties

This paper proposes a general method to construct 1-resilient Boolean functions by modifying the Tu-Deng and Tang-Carlet-Tang functions. Cryptographic properties such as algebraic degree, nonlinearity and algebraic immunity are also considered. A sufficient condition of the modified functions with optimal algebraic degree in terms of the Siegenthaler bound is proposed. The authors obtain a lower bound on the nonlinearity of the Tang-Carlet-Tang functions, which is slightly better than the known result. If the authors do not break the “continuity” of the support and zero sets, the functions constructed in this paper have suboptimal algebraic immunity. Finally, four specific classes of 1-resilient Boolean functions constructed from this construction and with the mentioned good cryptographic properties are proposed. Experimental results show that there are many 1-resilient Boolean functions have higher nonlinearities than known 1-resilient functions modified by Tu-Deng and Tang-Carlet-Tang functions.     

系统辨识中支持向量机核函数及其参数的研究

具有不同核函数和参数的支持向量机（SVM）的性能存在很大差异，核函数及其参数的选择是SVM应用和理论研究中的一个重要问题。在简要介绍非线性系统辨识的支持向量机方法后，重点对常用的核函数及其参数的选择进行了研究，并采用具有不同核函数的SVM进行非线性系境辩识。大量实验结果表明，采用SVM方法进行系统辨识时，径向基核函数（RBKF）比其它核函数的辨识效果好，且RBKF的参数选择较容易，当参数在有效范围内改变时，空间复杂度变化小，易于实现。因此，RBKF是系统辨识SVM的较好选择。     

Quadrature Kalman particle fitler

In order to resolve the state estimation problem of nonlinear/non-Gaussian systems,a new kind of quadrature Kalman particle filter (QKPF) is proposed.In this new algorithm,quadrature Kalman filter (QKF) is used for generating the importance density function.It linearizes the nonlinear functions using statistical linear regression method through a set of GaussianHermite quadrature points.It need not compute the Jacobian matrix and is easy to be implemented.Moreover,the importantce density function integrates the latest measurements into system state transition density,so the approximation to the system posterior density is improved.The theoretical analysis and experimental results show that,compared with the unscented partcle filter (UPF),the estimation accuracy of the new particle filter is improved almost by 18%,and its calculation cost is decreased a little.So,QKPF is an effective nonlinear filtering algorithm.     

Kohonen自组织网络在混沌时间序列预测中的应用

研究Ｋｏｈｏｎｅｎ自组织神经网络在构造径向基函数预测模型时的应用，并通过例子研究了混沌时间序列的短期预测和长期预测问题.     

求解非线性方程组的异步并行 拟牛顿迭代算法的收敛性分析

本文给出了MIMD多处理机上的求解非线性方程组的异步并行拟牛顿迭代算法的收敛性分析,给出了收敛的充分性条件。     

实现高精度二阶有源滤波器的一种新方法

推导出了滤波器的“积分-求和”代数表达式,给出了PAC块的传递函数,介绍了利用在系统可编程模拟器件ispPAC10实现二阶有源滤波器的方法步骤。该滤波器具有工作稳定可靠、特性参数调整方便、设计成本低廉、保密性强等特点。     

采用非固定多段映射罚函数的非线性约束优化差分进化算法

采用非固定多段映射罚函数法处理问题的约束条件,提出了一种用改进差分进化算法求解非线性约束优化问题的新方法.结合差分进化算法两种不同变异方式的特点,引入模拟退火策略,使算法在搜索的初始阶段有较强的全局搜索能力,而在后阶段有较强的局部搜索能力,以提高算法的全局收敛性和收敛速率.用几个典型Benchmarks函数进行了测试,实验结果表明,该方法全局搜索能力强,鲁棒性好,精度高,收敛速度快,是一种求解非线性约束优化问题的有效方法.     

Robust H∞ filter design for uncertain nonlinear discrete systems with state delay

In this paper, we address the problem of robust H∞ filter design for a class of nonlinear discrete-time systems with norm-bounded parameter uncertainty, unknown state delay, and unknown nonlinear disturbance. Firstly, the sufficient condition of the existence of the robust filter is analyzed by the modified Riccati inequalities, such that the filtering process remains robustly stable and a prescribed H∞ performance lever is achieved. Then the filter is characterized in the terms of positive solutions of two algebraic Riccati-like equations, irrespective of the uncertainties, time delays and nonlinearities. The simulation example further shows the validity and the applicability of the proposed approach.     

基于非参数回归的金融传染检验

本文借助特征函数的优良性质,基于非参数回归构造了金融传染的检验统计量.与现有文献相比,该统计量不仅避免了模型设定偏误问题,而且能够同时捕获线性和各种形式的非线性传染效应.在原假设成立时,该统计量渐近服从于标准正态分布.数值模拟结果表明,该统计量具有良好的有限样本性质,能够识别多种形式的非线性金融传染.本文进一步应用该统计量探讨了中国金融市场与东亚、拉丁美洲、新兴市场国家之间的传染效应,捕获了传统基于线性测度方法无法刻画的非线性传染效应,说明我国与这些金融市场之间存在显著的非线性传染效应.     

基于核函数变换的PLS回归的非线性结构分析

基于核函数变换的PLS非线性回归模型既吸取了核函数能够拟合适应任意连续变化曲线的优点，又借鉴了偏最小二乘回归方法能够有效解决自变量集合高度相关的技术。在本文中针对多元加法模型，从理论和仿真试验的角度分别验证了，对于多个独立自变量对单因变量为非线性关系的数据系统，基于核函数变换的PLS回归方法不仅能够有效实现自变量对因变量的整体预测，而且能够提取各雏自变量对因变量的单独非线性作用特征，从而确定数据系统内部的复杂非线性结构关系，增强了模型的可解释性。     

时滞随机线性大系统的指数稳定性

针对一般随机线性时滞微分方程，给出了方程的平凡解的几乎必然指数稳定性的一个充分条件，由此利用时滞随机系统的比较原理建立一般时滞随机线性大系统的二阶矩指数稳定与几乎必然指数稳定新的代数判据．利用恰当的Lyapunov函数结合不等式技巧得到了这些条件．特别是用一个代数方程给出了依赖时滞的Lyapunov指数的估计．并用实例加以验证．     

基于高拉伸度遗传算法的相关干涉仪测向算法

针对相关干涉仪测向中相位差模糊导致的强非线性问题,提出一种基于高拉伸度的改进遗传算法,该算法以遗传算法中择优选取机制为基础,通过定义拉伸度,根据相关干涉仪测向中相关函数及其对自变量的偏导数在目标方向附近均趋近于0的特性,设计新的适应度函数,增大全局最大值附近适应度函数的拉伸度,扩大与其他方向的适应度的差距,从而实现对选取机制的优化。仿真实验表明,该算法复杂度低,当测向精度基本相同时,测向时间约为网格法的1/600,且具有良好的适用性,可以广泛应用于其他求解最大值的问题中。