点椭圆

词组短语

point ellipse · null ellipse

与点椭圆相关的网络例句 [注：此内容来源于网络，仅供参考]

Firstly, some basic concepts about ECC are introduced;then the scalar multiplication under affine coordinate is discussed, we make a research and analysis of the side channel attack of scalar multiplication used in portable device, give out a new scalar multiplication algorithm which has the advantage of efficiency over other protected algorithm; and an improvement of the standard scalar multiplication algorithm proposed by IEEE1363 is made with the efficiency increasing by about 10%; at last, we deal with the using of complex multiplication in scalar multiplication algorithm, we generalize the methods and deduce a complete computing procedure, with proposing a new method which used several different fast endomorphism ,we give out an approach to boost the scalar multiplication with fast endomorphism.

本文首先介绍了椭圆曲线密码的有关基本概念；其次介绍了椭圆曲线上点的标量乘法在仿射坐标下的计算，对一般便携设备上的椭圆曲线点的标量乘法的边信道攻击做了研究与分析，给出了一种在效率上优于其它可抵抗边信道攻击的标量乘法的新算法，并对IEEE P1363 标准给出的标量乘法做了改进，使得标量乘法的运算效率提高了近10%；最后介绍了利用复乘计算标量乘法的方法，对已有的方法进行总结归纳，得出完整的计算过程，并针对两类超奇异椭圆曲线给出了一种利用多个可快速计算的复乘的标量乘法，得出一类普遍的结果，并给出了进一步用复乘加快标量乘法的思路。

A new method of finding the points on an elliptic curve by Maple is supplied; Maple is applied to the addition operation, the scalar product operation and the method of seeking the order of a basic point on the elliptic curve are proposed; the applications of Maple on ECC including encryption and decryption are supplied.

利用Maple编程求出椭圆曲线上有理点，用Maple实现椭圆曲线上两点的加法、点的数乘运算及求某个基点阶数的算法，利用Maple实现椭圆曲线密码体制的加密及解密。相比C语言，Maple语言更接近于平时说话的语法。同时，Maple语言可以方便地转化成C语言。

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

For a monotone twist map the well-known Birkhoff fixed point theoremsays that the circles with rational rotation number will break up whence a finitenumber of pairs of periodic points arise,half of which are elliptic and the othershyperbolic.Moreover,around each elliptic periodic point a few of new invariantcurves will appear and make a picture of phase space with a self-similar structure.Again one may ask is there a similar picture for higher dimensional Hamiltoniansystems?

对于单调扭转映射，著名的Birkhoff不动点定理指出，在通有情况下旋转数为有理数的不变曲线一般会破裂，在原来的不变曲线附近会产生有限多对周期点，其中一半是双曲的，一半是椭圆的，而在椭圆型周期点的周围又会产生一圈圈的不变曲线，使得椭圆周期点附近的动力学行为和整个相空间的动力学行为十分相象，换句话说，整个相空间具有无限嵌套的自相似结构，自然又产生了一个问题：对于自由度数目大于2的高维哈密顿系统，其相空间是否有类似的图象？

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

As to ellipses, a new method using RHT is proposed for ellipse detection, which uses two randomly picked points and one searched point to calculate the ellipse parameters via the polar and pole definition of ellipses.

对于椭圆，论文提出一种新的基于RHT的三点椭圆检测法，它从椭圆的极和极线定义出发，利用随机采样到的两点和搜索获得的一点来确定椭圆参数。

The curve begins at the point where the ellipse intersects the first radial and extends counterclockwise to the point where the ellipse intersects the second radial. A radial is a line segment drawn from the center of the ellipse to a specified endpoint on the ellipse.

曲线由椭圆与第一个径向线相交的点开始逆时针延伸到椭圆与第二个径向线相交的点（径向线是指从椭圆的中心向椭圆上给定的终点之间的一段连线）。

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中设计的点加和点乘运算进行了深入分析。

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

Based on moving least squares surface, the differential properties of each sample point on PSO are first evaluated. In terms of covariance analysis, the elliptical splat of sample point is then determined on its tangent plane. Finally, the splats are rendered from far to near by using elliptical weighted average filtering. According to the differential properties, moreover, the suggestive contours of PSG are attained so that non-photorealistic rendering of PSG is realized.

首先根据构造的移动最小二乘曲面计算采样点的表面几何属性，然后根据协方差分析确定点元在其切平面上的椭圆表示，最后采用椭圆加权平均滤波从远到近单遍绘制各点元，此外，根据表面几何属性确定点模型的轮廓线，实现了点模型的非真实感绘制。

与点椭圆相关的网络解释 [注：此内容来源于网络，仅供参考]

apocenter：卫星在椭圆轨迹上离主星最远点

aplhanumericvisualdisplay 字母数字显示器 | apocenter 卫星在椭圆轨迹上离主星最远点 | apogeanrange 远地点潮潮差

apocenter altitude：远心点高度

apocenosis | 排液, 排脓 | apocenter altitude | 远心点高度 | apocenter | 远心点 卫星在椭圆轨迹上离主星的最远点

EL：椭圆

云线(revcloud)用来做标记(不重要) 样条曲线(SPL)全称: (pline) 用左键确定各点后,三次回车:第一次断开,第二次起点切线方向,第三次终点切线方向 椭圆(EL)全称(ellipse) 不常用.先给长轴的总长,再给短轴的一半.或者以中心画:长短轴各给一半.

elliptic quartic curve：椭圆四次曲线

elliptic point 椭圆点 | elliptic quartic curve 椭圆四次曲线 | elliptic space 椭圆空间

Nearest：最近点

最近点(nearest) 最靠近由标点取处,在像素上之不固定点. 关键点(key point) 圆的四象限点,圆心点或等分点. 中点(mid point) 线段或多边型之一边的中间点. 中心点(center) 圆、椭圆、矩形四边形即多边形的中心点. 原点(origin) 零件的原点.

null ellipse：点椭圆;零椭圆

零元[素] null element | 点椭圆;零椭圆 null ellipse | 点椭面;零椭面 null ellipsoid

null ellipse：零椭圆,点椭圆

null electrode 零位电极 | null ellipse 零椭圆,点椭圆 | null event 零事件,空事件

point ellipse：点椭圆

concatenation character 链接字符 | point ellipse 点椭圆 | external contribution 外来捐赠

point ellipse：零椭圆

point diagram 点图表 | point ellipse 零椭圆 | point equation 点方程

weierstrass elliptic functions：维尔斯特拉斯椭圆函数

weierstrass approximation theorem 维尔斯特拉斯逼近定理 | weierstrass elliptic functions 维尔斯特拉斯椭圆函数 | weierstrass point 维尔斯特拉斯点