带陷门分组密码算法的设计与分析

带陷门的密码算法包含了陷门信息,知道陷门信息可以较容易地获得密码算法的密钥进而解密密文得到明文,对于不知道陷门信息的攻击者则无法有效获得密钥,并且要找到陷门信息在计算上也是很困难的。基于对称密码算法中带陷门信息的混淆部件设计了一种带陷门的分组密码算法,并对该算法进行了安全性分析,证明了在假设陷门信息保密(不公开)的情况下该类算法能够抵抗线性密码分析等攻击方法。基于这样的分组密码算法,讨论了构造公钥加密算法的思路。     

Research on cryptographic properties of a new S-box based on cellular automaton

A new S-box based on cellular automata was found by experiments.The permutation properties of the S-box were analyzed,which proved that the S-box was a permutation only when the size of lattice was 5.Then the relation between the nontrivial difference transition probability of the S-box and the rank of the difference matrix was proved by constructing the difference matrix.And it was proved that the cyclic shift of input differential would not change the corresponding nontrivial differential transition probability,and obtained the sufficient and necessary conditions about the maximum and minimum nontrivial differential transition probabilities when the size of lattice was 5.Then the problem of the difference distribution of the S-box in this situation is completely solved.     

New construction of highly nonlinear resilient S-boxes via linear codes

Highly nonlinear resilient functions play a crucial role in nonlinear combiners which are usual hardware oriented stream ciphers. During the past three decades, the main idea of construction of highly nonlinear resilient functions are benefited from concatenating a large number of affine subfunctions. However, these resilient functions as core component of ciphers usually suffered from the guess and determine attack or algebraic attack since the n-variable nonlinear Boolean functions can be easily given rise to partial linear relations by fixing at most n/2 variables of them. How to design highly nonlinear resilient functions (S-boxes) without concatenating a large number of n/2 variables affine subfunctions appears to be an important task. In this article, a new construction of highly nonlinear resilient functions is proposed. These functions consist of two classes subfunctions. More specially, the first class (nonlinear part) contains both the bent functions with 2 k variables and some affine subfunctions with n/2 − k variables which are attained by using [ n/2 − k, m, d] disjoint linear codes. The second class (linear part) includes some linear subfunctions with n/2 variables which are attained by using [ n/2, m, d] disjoint linear codes. It is illustrated that these resilient functions have high nonlinearity and high algebraic degree. In particular, It is different from previous well-known resilient S-boxes, these new S-boxes cannot be directly decomposed into some affine subfunctions with n/2 variables by fixing at most n/2 variables. It means that the S-boxes (vectorial Boolean functions) which use these resilient functions as component functions have more favourable cryptography properties against the guess and determine attack or algebraic attacks.     

Research on affine equivalence enumeration of the three families vectorial function

In recent years,Qu-Tan-Tan-Li function,Zha-Hu-Sun function and Tang-Carlet-Tang function have been proposed with differential uniformity 4 and many good cryptographic properties.the counting problem of affine equivalent to the three families cryptographic functions was investigated.By using some properties of finite fields,the upper and lower bound of the number of affine equivalent to the Zha-Hu-Sun function,and the upper bound of the number of affine equivalent to the Qu-Tan-Tan-Li function and Tang-Carlet-Tang function were computed,respectively.Moreover,a conjecture was given about the exact number of affine equivalent to the Zha-Hu-Sun function.Results show that there are at least$2^{53}{\left[{\displaystyle \prod _{i=1}^8(2^i-1)}\right]}^2$cryptographic functions of affine equivalent to the Zha-Hu-Sun function over finite field GF(2⁸),which can be chosen as S-boxes of block ciphers.     

基于双向相关扩散与非线性混沌S盒的图像加密算法

目的 当前混沌加密方案主要采用存在迭代周期性的序列与单向扩散机制来实现像素的混淆,设计一种加密算法以解决其抗破译性能较弱的问题。方法 设计了基于双向相关扩散与非线性S盒的图像加密算法。借助哈希方案,形成一个与初始图像内容相关的密钥;基于2D混合混沌函数,利用子密钥来设计位置交叉规则,实现明文的像素置乱;基于线性分阶变换,联合混沌随机数组,构建一个16×16的非线性S盒;定义S盒的循环向前移位机制和向前扩散机制,对置乱图像完成正向加密;再更新混合混沌系统的初始条件,构建逆向扩散机制,对正向密文完成反向加密。结果 测试数据显示,与已有混沌加密方案相比,在安全性和效率方面,所提方案的优势更大,其时耗时仅为0.59 s,且稳定的NPCR和UACI值分别达到了99.74%,33.69%。结论 所提加密方案可以抵御网络中外来攻击,可充分保证图像内容的真实性。     

11轮3D分组密码算法的中间相遇攻击

针对3D分组密码算法的安全性分析,对该算法抵抗中间相遇攻击的能力进行了评估。基于3D算法的基本结构及S盒的差分性质,减少了在构造多重集时所需的猜测字节数,从而构建了新的6轮3D算法中间相遇区分器。然后,将区分器向前扩展2轮,向后扩展3轮,得到11轮3D算法中间相遇攻击。实验结果表明:构建区分器时所需猜测的字节数为42 B,攻击时所需的数据复杂度约为2⁴⁹⁷个选择明文,时间复杂度约为2^325.3次11轮3D算法加密,存储复杂度约为2³⁴² B。新攻击表明11轮3D算法对中间相遇攻击是不免疫的。     

遗传算法在信息安全中的应用研究

遗传算法作为一种高效、并行、全局搜索的现代仿生智能优化算法,被广泛应用于计算机、自动控制等领域。探讨了遗传算法与S盒的基本原理,构造出基于遗传算法的S盒密码学模型,同时对该模型的理论基础、收敛性等进行了系统的分析;通过仿真实验对该模型效果和性能进行了分析与验证,结果表明该模型具有良好的密码学性能。     

几类高强度密码S盒的安全性新分析

针对几类高强度密码S盒是否存在新的安全性漏洞问题,提出了一种求解S盒非线性不变函数的算法。该算法主要基于密码S盒输入和输出的代数关系来设计。利用该算法对这几类密码S盒进行测试,发现其中几类存在相同的非线性不变函数;此外,如果将这些S盒使用于分组密码Midori-64的非线性部件上,将会得到一个新的变体算法。利用非线性不变攻击对其进行安全性分析,结果表明：该Midori-64变体算法存在严重的安全漏洞,即在非线性不变攻击下,存在2⁶⁴个弱密钥,并且攻击所需的数据、时间及存储复杂度可忽略不计,因此这几类高强度密码S盒存在新的安全缺陷。     

Constructing Differentially 4 Uniform Permutations from Known Ones

Low differential uniformity functions provide good resistance to differential attacks. The AES （Advanced encryption standard） uses a differentially 4 uniform function （the inverse function） as its S-box. We give a further study of the inverse function in this paper. It is observed that after exchanging two values of a low differential uniformity function, its differential property still keeps good. Especially, for the inverse function over F2^n （n even）, various possible differential uniformities are completely determined after its two values are exchanged. As a consequence, we get some highly nonlinear permutations with differential uniformity 4 which are not CCZ-equivalent （Carlet Charpin-Zinoviev equivalent） to the inverse function on F2^n.     

基于AHB总线的AES密码协处理器实现

AES加密算法是一种的常规加密算法,其被广泛应用在商业和政府部门。本文研究了AES(Advanced Encryption Standard)算法,包括AES的具体加密、解密过程以及基于AMBA(高级微控制器总线架构)总线的硬件实现方法。本文还介绍了一种用仿真与采用Xilinx公司的Virtex-4 LX100 FPGA器件来快速验证AES算法硬件IP核的方法。