椭圆曲线密码系统在GF(p)上的基点选择方法

椭圆曲线密码系统是现在主流的公钥密码系统之一。椭圆曲线密码系统的安全性是建立在椭圆曲线上离散对数问题（ECDLP)的难解性基础上的，但其系统参数的正确选择对系统的安全性也有着至关重要的影响。基点是重要的系统参数之一，在大多数有关公钥密码系统的国际标准中要求基点的阶是曲线的阶中的大素数因子以保证安全性。     

一种新的高效XML树编码方案

在深入分析现有XML编码方案基础上,提出了一种新的编码方案—PSB,该方案能够快速准确地判断出XML文档结构树中任意两个结点之间的父子、祖先-后代以及兄弟关系。由于采用素数和序列编码,可有效支持XML文档更新,降低XML文档的二次编码率。实验表明PSB是一种高效的动态编码方法。     

基于Vega Prime的视景仿真驱动技术研究

概要介绍了Vega Prime的开发环境及系统结构.运用面向时象方法和软件工程相关原理,结合MFC应用程序框架,深入分析了基于MFC的Vega Prime程序中视景驱动技术所遇到的问题,在此基础之上,给出了一种灵活实用的视景仿真驱动方法.     

Structural learning for Bayesian networks by testing complete separators in prime blocks

In this paper, we consider how to recover the structure of a Bayesian network from a moral graph. We present a more accurate characterization of moral edges, based on which a complete subset (i.e., a separator) contained in the neighbor set of one vertex of the putative moral edge in some prime block of the moral graph can be chosen. This results in a set of separators needing to be searched generally smaller than the sets required by some existing algorithms. A so-called structure-finder algorithm is proposed for structural learning. The complexity analysis of the proposed algorithm is discussed and compared with those for several existing algorithms. We also demonstrate how to construct the moral graph locally from, separately, the Markov blanket, domain knowledge and d-separation trees. Simulation studies are used to evaluate the performances of various strategies for structural learning. We also analyze a gene expression data set by using the structure-finder algorithm.     

Low temperature electrochemical cells with sodium β″-alumina solid electrolyte (BASE)

Cells of Daniell-type with copper–zinc electrochemical couples and sodium β″-alumina solid electrolyte (BASE) were constructed. The cathode consisted of copper in contact with its ions (Cu/Cu²⁺) while zinc in contact with its ions (Zn/Zn²⁺) constituted the anode. Dimethyl sulfoxide (DMSO) containing 1 M NaBF₄ was used as the liquid electrolyte. The configuration of the cell constructed can be written as follows:

Zn(s)/ZnCl₂(DMSO)(0.1 M), NaBF₄(1 M)/BASE/NaBF₄(1 M), CuCl₂(DMSO)(0.1 M)/Cu(s)

A GENERAL IN-PLACE AND IN-ORDER PRIME FACTOR FFT ALGORITHM

Starting from an index mapping for one to multi-dimensions, a general in-placeand in-order prime factor FFT algorithm is proposed in this paper. In comparing with existingprime factor FFT algorithms, this algorithm saves about half of the required storage capacityand possesses a higher efficiency. In addition, this algorithm can easily implement the DFT andIDFT in a single subroutine,     

智能卡RSA密钥生成的VLSI实现

目前，智能卡中的RSA密钥生成通常由软件实现，速度较慢。文章给出了一种RSA密钥生成的VLSI实现方案，在RSA协处理器基础上增加若干运算单元，来完成RSA密钥生成和加解密操作。采用这种方式，密钥生成速度快，而且面积增加不多，适合于智能卡应用。     

Fast generation of prime numbers and secure public-key cryptographic parameters

A very efficient recursive algorithm for generating nearly random provable primes is presented. The expected time for generating a prime is only slightly greater than the expected time required for generating a pseudoprime of the same size that passes the Miller-Rabin test for only one base. Therefore our algorithm is even faster than algorithms presently used for generating only pseudoprimes because several Miller-Rabin tests with independent bases must be applied for achieving a sufficient confidence level. Heuristic arguments suggest that the generated primes are close to uniformly distributed over the set of primes in the specified interval.Security constraints on the prime parameters of certain cryptographic systems are discussed, and in particular a detailed analysis of the iterated encryption attack on the RSA public-key cryptosystem is presented. The prime-generation algorithm can easily be modified to generate nearly random primes or RSA-moduli that satisfy these security constraints. Further results described in this paper include an analysis of the optimal upper bound for trial division in the Miller-Rabin test as well as an analysis of the distribution of the number of bits of the smaller prime factor of a random k-bit RSA-modulus, given a security bound on the size of the two primes.Some results of this paper were presented at EUROCRYPT '89, Houthalen, Belgium, April 10–13, 1989 [55].     

基于素域构造的准循环低密度校验码

该文提出一种基于素域构造准循环低密度校验码的方法。该方法是Lan等所提出基于有限域构造准循环低密度校验码的方法在素域上的推广,给出了一类更广泛的基于素域构造的准循环低密度校验码。通过仿真结果证实：所构造的这一类准循环低密度校验码在高斯白噪声信道上采用迭代译码时具有优良的纠错性能。     

双群结合环的强诣零根

本文继文献[1]进一步讨论双群结合环的诣零性,并得到:(1)每个强诣零单侧理想必包含于某强诣零理想内;(2)每个双群结合环必有强Koethe根,且此根包含它的所有强诣零单侧理想;(3)每个强Koethe半单环是一些强Koethe半单、素环的亚直和。