对Rijndael-256算法新的积分攻击

本文对Rijndael-256密码进行分析,从比特的层面上寻找平衡性,得到了一个新的3轮积分区分器,该区分器仅需32个明文就可将3轮Rijndael-256与随机置换区分开来,并且所得密文的每一比特都是平衡的.该区分器在已知的mjndael-256积分区分器中所需明文量最少.基于新的区分器,对4至7轮Riindael-...     

基于准正交空时分组码的高速率码字设计

为了适应通信系统对高速率大容量的需求,设计了码率为2及1.5的非正交空时分组码。在此基础上,采用简化了的条件最大似然译码方法,可以大大降低译码复杂度。仿真结果表明,该编码设计具有接近实际信道容量的特点,并且其误比特率性能优于正交及准正交编码设计。     

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

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

A Low Complexity Decoding Algorithm for STBC under Non-Constant Module Modulation

This paper presents a low complexity algorithm for the decoding of space-time block codes （STBC） under non-constant module modulation. Simulation results show that in most cases of non-constant module modulation the new algorithm results in more than 50% reduction in computation complexity comparing to the original maximum likelihood algorithm without any loss of BER performance.     

Secrecy sum rate optimization in MISO nonorthogonal multiple access systems with orthogonal space‐time block coding

In this paper, we investigate the secrecy sum rate optimization problem for a multiple‐input single‐output (MISO) nonorthogonal multiple access (NOMA) system with orthogonal space‐time block codes (OSTBC). This system consists of a transmitter, two users, and a potential eavesdropper. The transmitter sends information by orthogonal space‐time block codes. The transmitter's precoder and the power allocation scheme are designed to maximize achievable secrecy sum rate subject to the power constraint at the transmitter and the minimum transmission rate requirement of the weak user. We consider two cases of the eavesdropper's channel condition to obtain positive secrecy sum rate. The first case is the eavesdropper's equivalent channel is the weakest, and the other is the eavesdropper's equivalent channel between the strong user and weak user. For the former case, we employ the constrained concave convex procedure (CCCP)‐based iterative algorithm with one‐dimensional search. While for the latter, we adopt the method of alternating optimization (AO) between precoder and power allocation. We solve a semidefinite programming to optimize the precoder and drive a closed‐form expression of power allocation. The simulation results obtained by our method demonstrate the superiority of our proposed scheme.     

An innovative two-stage data compression scheme using adaptive block merging technique

Test data has increased enormously owing to the rising on-chip complexity of integrated circuits. It further increases the test data transportation time and tester memory. The non-correlated test bits increase the issue of the test power. This paper presents a two-stage block merging based test data minimization scheme which reduces the test bits, test time and test power. A test data is partitioned into blocks of fixed sizes which are compressed using two-stage encoding technique. In stage one, successive blocks are merged to retain a representative block. In stage two, the retained pattern block is further encoding based on the existence of ten different subcases between the sub-block formed by splitting the retained pattern block into two halves. Non-compatible blocks are also split into two sub-blocks and tried for encoded using lesser bits. Decompression architecture to retrieve the original test data is presented. Simulation results obtained corresponding to different ISCAS′89 benchmarks circuits reflect its effectiveness in achieving better compression.     

大容量NAND Flash K9T1G08UOM在网络存储中的应用

针对嵌入式系统对存储的需求，提出了基于大容量NAND Flash的存储方案。简要介绍NAND Flash器件K9T1G08UOM及其编程特点，并讨论了网络存储应用的存储策略和数据可靠性方面的考虑，设计并实现了网络数据流的NAND Flash存储。     

一种基于HVS的空域分块数字水印技术

数字水印作为一种防护技术,在数字产品的保护认证方面越发显得重要,成为当前计算机领域研究的热点问题之一。提出了一种在空域采用分块重复嵌入水印信息和HVS相结合的水印技术。实验结果说明,分块技术在空域的使用提高了水印的嵌入强度和降低计算复杂度,该算法在抵抗旋转、裁剪、缩放方面等有较强能力;水印算法与HVS技术的有效性相结合,数字水印具有很好的掩蔽性。     

系统可靠性模型综述

可靠性模型是指为预计或估算产品的可靠性所建立的可靠性框图和数学模型。介绍了几种系统可靠性模型及其相应的可靠性计算方法。     

基于S盒优化的轻量级加密算法设计

分组密码一直是解决信息系统安全问题的常用加密方法。分组密码的典型代表数据加密标准DES（Data Encryption Standard）被广泛应用于软件加密和硬件加密,其中所体现的设计思想和设计原则依然值得研究和借鉴。S盒作为DES算法的一个关键环节,它的设计好坏直接影响DES的加密性能。通过对分组密码安全性设计的分析,立足于DES算法框架,提出了一种轻量级安全加密算法LEA（Light weight Encryption Algorithm）,通过增加位选逻辑陷阱来对S盒中的元素进行选取和重新优化设计,最后从S盒统计特性角度对其安全性进行分析。该算法能有效解决低成本系统的安全问题。