基于m序列统计特性的序列密码攻击

主要论述对序列密码的攻击方法:对于线性反馈移位寄存器序列,利用m序列的游程特性以及序列本身的递推关系,彻底还原产生该m序列的线性反馈移位寄存器。对于非线性组合序列,利用m序列的采样特性,降低其攻击难度,从而易于求取非线性组合生成器中各个线性反馈移位寄存器的极小多项式和初始密钥。     

2阶相关免疫函数的构造与计数

本文讨论２阶相关免疫函数的构造与计数问题，构造出了一大类重量为２的方幂的２阶相关免疫函数，首次给出了２阶相关免疫函数个数的下界。     

A Software-Optimized Encryption Algorithm

We describe the software-efficient encryption algorithm SEAL 3.0. Computational cost on a modern 32-bit processor is about 4 clock cycles per byte of text. The cipher is a pseudorandom function family: under control of a key (first preprocessed into an internal table) it stretches a 32-bit position index into a long, pseudorandom string. This string can be used as the keystream of a Vernam cipher. Received 3 May 1996 and revised 17 September 1997     

An Approximate Distribution for the Maximum Order Complexity

In this paper we give an approximate probability distribution for the maximum order complexity of a random binary sequence. This enables the development of statistical tests based on maximum order complexity for the testing of a binary sequence generator. These tests are analogous to those based on linear complexity.     

An Analysis of SAFER

We investigate some of the algebraic properties of the SAFER block cipher when the message space is considered as a Z -module. In particular, we consider the invariant Z -submodules of the PHT layer and show how these invariant Z -submodules give potential cryptographic weaknesses. Received 12 June 1995 and revised 22 July 1997     

Two-Dimensional Cellular Automata for Pseudo-Random Pattern Generators and for Highly Secure Stream Ciphers

Pseudo-random properties of a class of two-dimensional (2-D) 5-neighborhood cellular automata (CA), built around nonlinear (OR, AND) and linear (XOR) Boolean functions are studied. The site values at each step of the 2-D CA evolution are taken in parallel and form pseudo-random sequences, which satisfy the criteria established for pseudo random number generator (PRNG): long period, excellent random qualities, single bit error propagation (avalanche criteria), easy and fast generation of the random bits. A block-scheme for secure Stream Cipher based on 2-D CA is proposed. The 2-D CA based PRNG algorithm has simple structure, use space-invariant and local interconnections and can be easily realized in very large scale integration or parallel optoelectronic architectures.     

Adaptive sampling for geometric problems over data streams

Geometric coordinates are an integral part of many data streams. Examples include sensor locations in environmental monitoring, vehicle locations in traffic monitoring or battlefield simulations, scientific measurements of earth or atmospheric phenomena, etc. This paper focuses on the problem of summarizing such geometric data streams using limited storage so that many natural geometric queries can be answered faithfully. Some examples of such queries are: report the smallest convex region in which a chemical leak has been sensed, or track the diameter of the dataset, or track the extent of the dataset in any given direction. One can also pose queries over multiple streams: for instance, track the minimum distance between the convex hulls of two data streams, report when datasets A and B are no longer linearly separable, or report when points of data stream A become completely surrounded by points of data stream B, etc. These queries are easily extended to more than two streams.

In this paper, we propose an adaptive sampling scheme that gives provably optimal error bounds for extremal problems of this nature. All our results follow from a single technique for computing the approximate convex hull of a point stream in a single pass. Our main result is this: given a stream of two-dimensional points and an integer r, we can maintain an adaptive sample of at most 2r+1 points such that the distance between the true convex hull and the convex hull of the sample points is O(D/r²), where D is the diameter of the sample set. The amortized time for processing each point in the stream is O(logr). Using the sample convex hull, all the queries mentioned above can be answered approximately in either O(logr) or O(r) time.     

手机电视的实现技术研究

本文介绍了“手机电视”业务的两种主要技术实现方式，包括基于移动通信网络的方式和基于数字电视地面广播的方式。然后对这两种实现方式的特点进行了分析和对比，最后提出了在应用层面进行融合的方式。     

Stream function finite element solution of Stokes flow with penalties

A finite element method for solution of the stream function formulation of Stokes flow is developed. The method involves complete cubic non-conforming (C⁰) triangular Hermite elements. This element fails the patch test. To correct the element and produce a convergent method we employ a penalty method to weakly enforce the desired continuity constraint on the normal derivative across the inter-element boundaries. Successful use of the method is demonstrated to require reduced integration of the inter-element penalty with a 1-point Gauss rule. Error estimates relate the optimal choice of penalty parameter to mesh size and are corroborated by numerical convergence studies. The need for reduced integration is interpreted using rank relations for an associated hybrid method.     

信源平衡编码及其在流密码中的应用

本文对离散无记忆信源给出了一种编码方法，它使编码后信源输出有着最好的平衡性，即0与1的数目最大程度地接近．对等长编码，本文给出的方法是步优的；对基于Huffman码的平衡编码，在保持平均码长不变的情况下，本文给出的方法使0与1的平衡性达到最优．因为一般信源字符的频率是一个统计数字．这里的平衡性也是从统计角度来说的．最后我们还讨论了这种平衡编码对流密码中的非线性组合器在防止相关攻击方面的防护作用．