PRINCE密码算法的差分−线性分析

PRINCE是一个低时延轻量级分组密码算法,广泛应用于各种资源受限设备。PRINCE使用FX结构,其核心部件是PRINCE_(core)。差分−线性分析是一种经典分析方法,它将差分分析和线性分析结合起来,使用短的高概率差分特征和线性特征来攻击密码算法。研究了PRINCE_(core)的差分−线性分析,使用2轮差分−线性区分器攻击4轮PRINCE_(core),需要2^(6)个选择明文,时间复杂度为2^(14.58)次4轮加密。对于6轮和7轮PRINCE_(core)的差分−线性分析,数据复杂度分别为2^(12.84)和2^(29.02)个选择明文,时间复杂度分别为2^(25.58)和2^(41.53)。

New Ansaetze for Obtaining Exact Solutions of Nonlinear Schroedinger-Type Equation

We propose two simple ansaetze that allow us to obtain different analytical solutions for two generalizeal versions of the nonlinear Schrodinger equation, such as the averaged dispersive-managed fiber system equation and the extended nonlinear Schrodinger equation which describe the femtosecond pulse propagation in monomode optical fiber. Among these solutions we can find solitary wave and periodic wave solutions representing the propagation of different waveforms in nonlinear media.

The Stability Research of the Finite Difference Scheme for a Nonlinear Partial Differential Equation

The main purpose of this paper is to set up the finite difference scheme with incremental unknowns for the nonlinear differential equation by means of introducing incremental unknowns method and discuss the stability of the scheme.Through the stability analyzing for the scheme,it was shown that the stability of the finite difference scheme with the incremental unknowns is improved when compared with the stability of the corresponding classic difference scheme.