An implementation for a fast public-key cryptosystem

In this paper we examine the development of a high-speed implementation of a system to perform exponentiation in fields of the form GF(2 ⁿ ). For sufficiently large n, this device has applications in public-key cryptography. The selection of representation and observations on the structure of multiplication have led to the development of an architecture which is of low complexity and high speed. A VLSI implementation has being fabricated with measured throughput for exponentiation for cryptographic purposes of approximately 300 kilobits per second.     

一种基于加法链的快速标量乘算法

给出一种标量的串长加法链算法来提高椭圆曲线标量乘法的效率。新的标量乘算法结合底层域直接计算2Q+P、2^nR+S算法,使用大小窗口法将串长算法和滑动窗口算法结合,加法链长度、存储空间和预计算都减少,其效率比二元法提高53%,比NAF法提高47.5%,比串长算法提高46.2%,比Windows法提高42.2%。     

矩阵乘并行算法的仿真与性能分析

为了优化矩阵乘法的并行运算效率,提高流水线的性能,采用了基于Strassen算法的矩阵来运算,并通过缟码在DLX模拟的并行流水线环境中仿真运行.实验结果表明,优化后的矩阵秉算法降低了时间复杂度,减少了指令条数和运算周期,显著地提高了流水线上矩阵秉法的并行运算效率.     

Shallow circuits and concise formulae for multiple addition and multiplication

A theory is developed for the construction of carry-save networks with minimal delay, using a given collection of carry-save adders each of which may receive inputs and produce outputs using several different representation standards.The construction of some new carry-save adders is described. Using these carry-save adders optimally, as prescribed by the above theory, we get {, , }-circuits of depth 3.48 log₂ n and {, , }-circuits of depth 4.95 log₂ n for the carry-save addition ofn numbers of arbitrary length. As a consequence we get multiplication circuits of the same depth. These circuits put out two numbers whose sum is the result of the multiplication. If a single output number is required then the depth of the multiplication circuits increases respectively to 4.48 log₂ n and 5.95 log₂ n.We also get {, , }-formulae of sizeO (n ^3.13) and {, }-formulae of sizeO (n ^4.57) for all the output bits of a carry-save addition ofn numbers. As a consequence we get formulae of the same size for the majority function and many other symmetric Boolean functions.     

有限素整数域椭圆曲线密码体制基于代数几何快速算法设计

椭圆曲线公钥密码体制(ECC)具有最高的位安全强度,将是对现有公钥密码体制的替代。文章描述了代数几何与ECC的数学基础,讨论了椭圆曲线离散对数困难性问题及ECC在电子商务中的安全应用。利用仿射坐标与射影坐标的映射关系,设计了一种有限素整数域上ECC快速算法,使得ECC在电子商务中实际安全应用成为可能。     

The modulo-lattice channel: the key feature in precoding schemes

Precoding for transmission over channels with interference known at the transmitter is reviewed. In contrast to what is usually discussed in literature, precoding employing higher-dimensional lattice quantization for generating the transmit signal is assessed. It is shown that thereby the gap between low-complexity schemes using scalar modulo reductions and theoretical asymptotic results assuming hypothetical optimum quantization operations can be bridged. In this paper, capacity curves obtained from numerical calculations, and approximations to the capacity are provided for various lattices. Moreover, the role of appropriate scaling at transmitter and receiver is discussed in detail.     

综合交通枢纽地下空间开发利用探究

该文通过探讨综合交通枢纽地下空间的开发利用优势及重要性,并对国内外综合交通枢纽典型实例进行解析,提出综合交通枢纽设计应重视功能的多元复合化、空间的立体集约化,使之形成地上地下共同高效运转的节点型综合体。同时注重交通枢纽与城市公共空间的融合,体现城市、建筑一体化发展。     

Fast Multiplication on Elliptic Curves over Small Fields of Characteristic Two

We discuss new algorithms for multiplying points on elliptic curves defined over small finite fields of characteristic two. This algorithm is an extension of previous results by Koblitz, Meier, and Staffelbach. Experimental results show that the new methods can give a running time improvement of up to 50 % compared with the ordinary binary algorithm for multiplication. Finally, we present a table of elliptic curves, which are well suited for elliptic curve public key cryptosystems, and for which the new algorithm can be used. Received 14 January 1997 and revised 4 September 1997     

雪崩光电管偏压控制电路的研制

本文分析了雪崩光电管内倍增因子与偏压的关系，介绍了偏压的虚警控制原理，所述电路适用于温度和背景光强大幅度变化的连续探测的光电系统。     

多用户电度表的设计

此多用户电度表采用电压，电流采样电路、模拟乘法器、滤波器，A／D转换器，LED显示器和单片机等部分组成，其主要功能是：可以实现在一个电度表上计量多个用户的电能使用量，其经济效益及可靠性都比较高。