查询词典 elliptic modular function

This dissertation investigates the construction of pseudo-random sequences (pseudo-random numbers) from elliptic curves and mainly analyzes their cryptographic properties by using exponential sums over rational points along elliptic curves. The main results are as follows:(1) The uniform distribution of the elliptic curve linear congruential generator is discussed and the lower bound of its nonlinear complexity is given.(2) Two large families of binary sequences are constructed from elliptic curves. The well distribution measure and the correlation measure of order k of the resulting sequences are studied. The results indicate that they are "good" binary sequences which give a positive answer to a conjecture proposed by Goubin et al.(3) A kind of binary sequences from an elliptic curve and its twisted curves over a prime field F_p. The length of the sequences is 4p. The "1" and "0" occur almost the same times. The linear complexity is at least one-fourth the period.(4) The exponential sums over rational points along elliptic curves over ring Z_ are estimated and are used to estimate the well distribution measure and the correlation measure of order k of a family of binary sequences from elliptic curves over ring Z_.(5) The correlation of the elliptic curve power number generator is given. It is proved that the sequences produced by the elliptic curve quadratic generator are asymptotically uniformly distributed.(6) The uniform distribution of the elliptic curve subset sum generator is considered.(7) We apply the linear feedback shift register over elliptic curves to produce sequences with long periods. The distribution and the linear complexity of the resulting sequences are also considered.

本文研究利用椭圆曲线构造的伪随机序列，主要利用有限域上椭圆曲线有理点群的指数和估计讨论椭圆曲线序列的密码性质——分布、相关性、线性复杂度等，得到如下主要结果：(1)系统讨论椭圆曲线-线性同余序列的一致分布性质，即该类序列是渐近一致分布的，并给出了它的非线性复杂度下界；(2)讨论两类由椭圆曲线构造的二元序列的"良性"分布与高阶相关性(correlation of order κ)，这两类序列具有"优"的密码性质，也正面回答了Goubin等提出的公开问题；(3)利用椭圆曲线及其挠曲线构造一类二元序列，其周期为4p(其中椭圆曲线定义在有限域F_p上)，0-1分布基本平衡，线性复杂度至少为周期的四分之一；(4)讨论了剩余类环Z_上的椭圆曲线的有理点的分布估计，并用于分析一类由剩余类环Z_上椭圆曲线构造的二元序列的伪随机性；(5)讨论椭圆曲线-幂生成器序列的相关性及椭圆曲线-二次生成器序列的一致分布；(6)讨论椭圆曲线-子集和序列的一致分布；(7)讨论椭圆曲线上的线性反馈移位寄存器序列的分布，线性复杂度等性质。

This dissertation investigates the construction of pseudo-random sequences (pseudo-random numbers) from elliptic curves and mainly analyzes their cryptographic properties by using exponential sums over rational points along elliptic curves. The main results are as follows:(1) The uniform distribution of the elliptic curve linear congruential generator is discussed and the lower bound of its nonlinear complexity is given.(2) Two large families of binary sequences are constructed from elliptic curves. The well distribution measure and the correlation measure of order k of the resulting sequences are studied. The results indicate that they are "good" binary sequences which give a positive answer to a conjecture proposed by Goubin et al.(3) A kind of binary sequences from an elliptic curve and its twisted curves over a prime field F_p. The length of the sequences is 4p. The "1" and "0" occur almost the same times. The linear complexity is at least one-fourth the period.(4) The exponential sums over rational points along elliptic curves over ring Z_ are estimated and are used to estimate the well distribution measure and the correlation measure of order k of a family of binary sequences from elliptic curves over ring Z_.(5) The correlation of the elliptic curve power number generator is given. It is proved that the sequences produced by the elliptic curve quadratic generator are asymptotically uniformly distributed.(6) The uniform distribution of the elliptic curve subset sum generator is considered.(7) We apply the linear feedback shift register over elliptic curves to produce sequences with long periods. The distribution and the linear complexity of the resulting sequences are also considered.

本文研究利用椭圆曲线构造的伪随机序列，主要利用有限域上椭圆曲线有理点群的指数和估计讨论椭圆曲线序列的密码性质——分布、相关性、线性复杂度等，得到如下主要结果：(1)系统讨论椭圆曲线-线性同余序列的一致分布性质，即该类序列是渐近一致分布的，并给出了它的非线性复杂度下界；(2)讨论两类由椭圆曲线构造的二元序列的&良性&分布与高阶相关性(correlation of order κ)，这两类序列具有&优&的密码性质，也正面回答了Goubin等提出的公开问题；(3)利用椭圆曲线及其挠曲线构造一类二元序列，其周期为4p(其中椭圆曲线定义在有限域F_p上)，0-1分布基本平衡，线性复杂度至少为周期的四分之一；(4)讨论了剩余类环Z_上的椭圆曲线的有理点的分布估计，并用于分析一类由剩余类环Z_上椭圆曲线构造的二元序列的伪随机性；(5)讨论椭圆曲线-幂生成器序列的相关性及椭圆曲线-二次生成器序列的一致分布；(6)讨论椭圆曲线-子集和序列的一致分布；(7)讨论椭圆曲线上的线性反馈移位寄存器序列的分布，线性复杂度等性质。

Device driver includes hardward modular, interrupt modular, function modular, initializtion/finalization modular, character device interface modular and network device interface modular. User processes includes link scan task, layer 3 unicast task , layer 3 multicast task, management interface and network protocols.

设备驱动程序主要包括硬件模块、中断处理模块、功能模块、初始化/卸载模块、字符设备接口模块和网络设备接口模块；用户进程主要包括链路状态扫描任务、三层单播任务、三层组播任务、管理界面和网络协议。

A high-performance modular exponentiation coprocessor, SEA, is presented here, and three novel ways are employed. First, a parallel binary modular exponentiation algorithm is used to decrease cycles, and a high radix Montgomery modular multiplication algorithm is modified to the radix based high radix Montgomery modular multiplication algorithm to increase the frequency; second when mapping algorithms to a systolic array, modular square and modular multiplication are alternatively computed to cover up the dependencies between iterations in the RBHRMMM algorithm and the bypass is used to eliminate the dependencies in the PBME algorithm; third, multipliers are split first, and then accumulations are compressed as partial products to decrease carry propagation delay in the critical path.

SEA是一种针对大数模幂的高性能协处理器，其主要采用如下3种加速方法：①采用二进位并行模幂算法和以基数长度为处理字长的高基数Montgomery算法；②将算法映射到脉动阵列处理结构，并交替计算平方和乘以掩盖RBHRMMM算法中的相关，同时应用定向技术消除PBME算法中的相关；③基於"先拆分乘法、后将累加压缩"的思想优化关键路径。

Garments fast quotation system is composed of costing modular, material database modular, reference price modular, form modular and system intro modular.

服装快速报价系统由成本计算模块、面辅料数据库模块、参考价格模块、报表模块和系统简介模块构成，分别为用户提供服装各项成本的计算、面辅料的参考价格、整件服装。

A new technique is presented for maximizing the band-edge selectivity of elliptic filters, and then the equal ripple parameter of the quasi-elliptic function can be calculated when the band-edge selectivities of the elliptic function and quasi-elliptic function are the same.

提出了标准椭圆函数的边带优化方法，在此基础上使标准椭圆函数与修正后的准椭圆函数在边带上的衰减相等，得到准椭圆函数的等波纹系数。

In this paper, we introduce the algorithm of Schoof-Elkies-Atkin to compute the order of elliptic curves over finite fields. We give out a fast algorithm to compute the division polynomial f〓 and a primitive point of order 2〓. This paper also gives an improved algorithm in computing elliptic curve scalar multiplication. Using the method of complex multiplication, we find good elliptic curves for use in cryptosystems, and implemented ElGamal public-key scheme based on elliptic curves. As a co-product, we also realized the algorithm to determine primes using Goldwasser-Kilian's theorem. Lastly, the elliptic curve method of integer factorization is discussed. By making some improvement and through properly selected parameters, we successfully factored an integer of 55 digits, which is the product of two 28-digit primes.

本文介绍了计算有限域上椭圆曲线群的阶的Schoof-Elkies-Atkin算法，在具体处理算法过程中，我们给出了计算除多项式f〓的快速算法和寻找2〓阶本原点的快速算法；标量乘法是有关椭圆曲线算法中的最基本运算，本文对[Koe96]中的椭圆曲线标量乘法作了改进，提高了其运算速度；椭圆曲线的参数的选择直接影向到椭圆曲线密码体的安全性，文中利用复乘方法构造了具有良好密码特性的椭圆曲线，并实现了椭圆曲线上ElGamal公钥体制；文中还给出了利用Goldwasser-Kilian定理和椭圆曲线的复乘方法进行素数的确定判别算法；最后讨论了利用椭圆曲线分解整数的方法并进行了某些改进，在PC机上分解了两个28位素数之积的55位整数。

This article first introduces the math foundation required by ECC,including the addition rule for elliptic curve point defined over finite field.Then , the principle of ECC is discussed and its security and efficiency of ECC are analyzed.Third, a cryptosystem is designed through analyzing the security requiration, choosing the elliptic curve domain parameters,denoting field element,elliptic curve and elliptic curve point,choosing associate primitves and schemes andpartitioning functional module.Forth, how to develop a crytosystem based on elliptic curve encryption algorithm is investigated.Fifth, a cryptosystem we have developed by us and the testing result is described.

本文首先介绍了ECC的数学基础，对有限域上椭圆曲线点的运算规则进行了详细描述；其次探讨了ECC的原理，分析了ECC的安全性和有效性；第三，设计了一个基于ECC的加密系统，包括系统的安全需求分析，域参数选择，域元、椭圆曲线、点的表示，原语和方案的选择，及整个系统的模块功能划分；第四，在设计的基础上，研究如何开发一个基于椭圆曲线的加密系统；第五，描述了一个我们已经设计与开发的基于椭圆曲线的加密系统，并给出了相应的测试结果。

This paper analyzes the characters of modularization industry organization, studies Chinese electronics and information industry modularization, analyzes the problems of the core company harmonizing modular form from the competition advantage of Chinese modular manufacturing company, core modular technology overflow and core modular root.

从4个层面分析了模块化产业结构的特征，具体研究了中国电子信息产业以跨国公司为核心的模块组织模式，从中资模块制造商的竞争优势、核心模块的技术溢出、核心模块的根植性3个方面分析了这种核心企业协调下的模块化组织模式；进而从制造模块的发展和产业升级两个角度提出中国电子信息产业的发展战略。

This paper first analyses and summarizes the ststus quo and evolution trend of encryption, some common used cryptograph are introduced, including the algorithms used in symmetric cryptosystem and asymmetirc cryptosystem. We describe the theory of each algorithms and compare the elliptic curve cryptosystem with the other two asymmetric cryptosystems to show the advantages of this algorithm. Second, the principle of ECC is discussed, including the math foundation of ECC, basic conception of elliptic curves, constructiong idea of ECC, operation on the elliptic curve and so on. Third, the current attacks of ECC were analyzed deeply, and an algorithm based on limited prime number field was constructed. We analyzed its realizability in theory, and implement it by using certain function of MIRACL software package. Latter half in this paper, the implementation model of a simple elliptic curve encryption system which based on GF has been introduced. The paper also put a deep analysis on the algorithm of point addition and point multiplication.

本文首先对密码技术的发展现状及其发展趋势进行了分析和综述，详细的介绍了私钥密码系统和公钥密码系统的发展，说明各种算法的原理和优缺点，并给出了一些典型的密码体制的简要分析，重点将椭圆曲线算法与其它几种公钥密码算法比较，说明椭圆曲线算法的优势；其次，探讨了椭圆曲线密码体制的原理，包括椭圆曲线密码的数学基础、基本概念、椭圆曲线密码体制的构造思想等问题；第三作者对椭圆曲线的攻击现状作了详细的分析，针对所使用的大素数域F_p，设计了素数域上安全椭圆曲线产生的算法，从理论上做了可实施性分析，从软件上做了具体实现；在本文的后半部分，提出了一个简单的基于有限素数域上的椭圆曲线加密方按算实现模型，并对SECES中设计的点加和点乘运算进行了深入分析。

Summary In copyright infringement cases,if the alleged infringer uses or even plagiarizes the copyrighted works or parts thereof,which causes no substantially adverse effect on the normal exploitation of the work,nor does it inflict any substantial damages to the right owner,the de minis doctrine should be applied to exempt the liabilities of the defendant and seek the balance of interests between the right owner and the general public embodied by the copyright law.

在侵犯著作权案件中，如果被控侵权行为人虽未经著作权人的同意，使用甚至抄袭了受著作权保护的作品或作品的片段，但若情节轻微，未对该作品的正常使用产生任何实质不利的影响，亦未对权利人的权利造成实质性的损害，则应适用&不计琐细原则&，免除行为人的责任，以寻求在权利人利益与著作权法所体现的社会公共利益之间的平衡。

This new product will become our best seller.

这个新产品会成为我们最畅销的产品。