查询词典 elliptic geometry

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)讨论椭圆曲线上的线性反馈移位寄存器序列的分布，线性复杂度等性质。

On the base of these, and the ideas of mathematical curriculum reform and the course of the reform of solid geometry, combining with educational reality and students" psychology, put forward some thoughts about solid geometry of middle school in future:(1) The arrangement of curriculum content should. give consideration to both the logical sequence of knowledge and the development of students" psychology, and make them united;(2) Paying great attention to the analogy of plane geometry and solid geometry;(3) Some respects remained to be strengthened about solid geometry in senior middle school;(4) Emphasizing the importance of conversion in solid geometry;(5) Stressing on the combination of solid geometry and algebra and other subjects;(6) The design of the content of solid geometry should have certain elasticity, and make solid geometry and modern education technology well combined.

在此基础上，又植根于近年来我国数学课程改革的理念和立体几何课程改革的进展，并结合我国的教育实际与学生心理，对未来中学立体几何课程的设胃提出若干思考：(1)课程内容的编排，要兼顾知识的逻辑顺序和学尘的心理发展相统一；(2)重视平面几何和立体几何的类比；(3)高中阶段立体几何有待加强的几个方面；(4)强调变换在立体几何中的重要性；(5)注意将立体几何和代数及其他学科相结合；(6)立体几何内容的设计要有一定的弹性，并注意与现代教育技术相结合。

As we all known, with the founding of Euclidean geometry in ancient Greece, with the development of analytic geometry and other kinds of geometries, with F.Kline" s Erlanger program in 1872 and the new developments of geometry in 20th century such as topology and so on, man has developed their understand of geometry. On the other hand, Euclid formed geometry as a deductive system by using axiomatic theory for the first time. The content and method of geometry have dramatically changed, but the geometry curriculum has not changed correspondingly until the first strike from Kline and Perry" s appealing.

纵观几何学发展的历史，可以称得上波澜壮阔：一方面，从古希腊时代的欧氏综合几何，到近代解析几何等多种几何的发展，以及用变换的方法处理几何的埃尔朗根纲领，到20世纪拓扑学、高维空间理论等几何学的新发展，这一切都在不断丰富人们对几何学的认识；另一方面，从欧几里得第一次使用公理化方法把几何学组织成一个逻辑演绎体系，到罗巴切夫斯基非欧几何的发现，以及希尔伯特形式公理体系的建立，极大地发展了公理化思想方法，不管是几何学的内容还是方法都发生了质的飞跃。

During the course of the well-known "new mathematics" campaign, the status of Euclidean geometry was completely overthrown in I960" s. After deeply thought of "new mathematics", the standpoint that geometry curriculum should reflect the content and method of modern geometry and be in touch with the student" s real life was agreed on. Other countries have tried some significant attempts. We can find from some geometry textbooks that the methods of transform and vector have appeared as a normal part. Simultaneous, not only the new developments of geometry such as Topology have been referred , but also the connection between geometry and practice has been strengthened.In China, geometry curriculum is also in the during of innovation.

而学校几何课程在二千年的时间里一直没有多大的变化，直到二十世纪初"克莱因—培利运动"的第一次冲击，到60年代"新数学"运动的全盘改革，以及之后的深入反思，中学几何课程要反映现代几何学的内容和方法以及紧密联系于实践的观点已经受到普遍的重视，国外的几何课程已经在这方面做了不少有意义的尝试，从国外的一些几何教材中可以发现：变换、向量等工具已经作为正式的内容进入几何教学，拓扑学等几何的新发展也开始在教材中有所体现；几何课程与实践之间的联系更是在很大程度上得以加强。

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的加密系统，包括系统的安全需求分析，域参数选择，域元、椭圆曲线、点的表示，原语和方案的选择，及整个系统的模块功能划分；第四，在设计的基础上，研究如何开发一个基于椭圆曲线的加密系统；第五，描述了一个我们已经设计与开发的基于椭圆曲线的加密系统，并给出了相应的测试结果。

The book is structured so that the reader may choose parts of the text to read and still take away a completed picture of some area of differential geometry Beginning at the introductory level with curves in Euclidean space, the sections become more challenging, arriving finally at the advanced topics which form the greatest part of the book:transformation groups, the geometry of differential equations,geometric structures, the equivalence problem the geometry of elliptic operators, G-structures and contact geometry.

这本书是结构，以便读者可以选择部分文本阅读，还带了一个完整的画面，有些地区的微分几何开始入门级和曲线的部分，在欧氏空间变得更有挑战性，终于到达了高级的主题，形成了最大的一部分书：变换团体、几何的微分方程、几何结构、等价问题的几何形状，G-structures椭圆算子和接触几何。

The main task of this article contains:compares algorithm and encryption and decryption between the widely-used public key encryption system RSA and ECC;(2) directing against present elliptic curve attack algorithm, uses SEA algorithm to perform choosing of safe elliptic curve and to achieve based on prime field elliptic curve"s ELGamal encryption and decryption and digital signature;(3) discusses elliptic curve"s application on smart card and proposes two identification plans based on EEC.

2针对目前已有的椭圆曲线攻击算法，使用SEA算法实现了安全椭圆曲线的选取，实现了基于大素数域上的椭圆曲线的ELGamal加解密和数字签名。(3)讨论了椭圆曲线在智能卡上的应用，并提出了两种基于ECC的身份认证方案。

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.

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

The United Kingdom has pledged to provide technical assistance to the peacekeeping effort in Darfur, including airlifting supplies and equipment to assist the African peacekeepers.

英国承诺为达佛的維和努力提供技术帮助，包括提供非洲的維和部队空运补給和裝备。

Results: The level of ET-1mRNA in placental villus was significantly higher in pre-eclamptic women than that in control group.

结果：妊高征组患者胎盘绒毛组织ET-1 mRNA的表达较正常妊娠组明显增高。