The algorithm can greatly reduce the number of elliptic point addition, so the efficiency of scalar multiplication in elliptic curves is improved.
该算法比经典算法减少了点的加法的计算次数，从而加快了椭圆曲线上点的数乘的运算速度。
To accelerate point multiplication operation of elliptic curve cryptography(ECC), a fast reduction algorithm for modular operation was introduced.
为了提高椭圆曲线密码（ECC）的点乘运算速度，提出了一种快速约简求模算法。
Point out that the secure elliptic curve is the master key of constructing the elliptic curve cryptosystem.
安全的椭圆曲线构造和基点的选取，是椭圆曲线密码体制实现的的关键。
The singularly perturbed elliptic equation boundary value problem with turning point is considered.
本文讨论了具有转向点的奇摄动椭圆型方程边值问题。
Then, this paper introduces the math foundation required by ECC, including the addition rule for elliptic curve point defined over finite field.
其次介绍了ECC的数学基础，对有限域上椭圆曲线点的运算规则进行了详细描述。
This paper, firstly introduces the elliptic curve in finite field and algebraic law of its point group, gives the order of the group.
该文首先介绍有限域上定义的椭圆曲线及点群运算规则，给出椭圆曲线点群的阶。
Based on the theory of elliptic trajectory, an algorithm of predicting trajectory and detecting impact point of TBM is given, which can be used in anti TBM battle.
根据椭圆弹道理论，提出了一种可以用于反战术弹道导弹作战的预测弹道及预报落点的方法。
The realization of the main part contains the implementation of point addition and multiplication based on elliptic curves and the achievement the process of functional blocks.
主要的实现部分包括椭圆曲线上点加与点乘运算的实现和各个功能模块算法流程的实现。
In the implementation of elliptic curve cryptosystem, one of the key steps is to design and implement the base-point choice algorithm of elliptic curve finite group.
实现椭圆曲线密码体制还有一个关键的步骤，就是椭圆曲线有限群基点选取算法的设计与实现。
According to the critical point theory, a class of problems of elliptic boundary value with an asymptotically linear term and singular term is studied.
利用临界点理论，研究了一类含有渐近线性项和奇异项的半线性椭圆方程的边值问题。
To improve the efficiency of the algorithm of point multiplication on elliptic curves is a key problem.
提高椭圆曲线点积运算的效率是椭圆曲线研究的一个核心问题。
The implementation speed of elliptic curve Cryptography (ECC) depends on the implementation speed of elliptic curve point multiplication.
椭圆曲线点乘的实现速度决定了椭圆曲线密码算法(ECC)的实现速度。
To resist the side channel attacks of elliptic curve cryptography, a new fast and secure point multiplication algorithm is proposed.
为了抵抗椭圆曲线密码的边信道攻击，提出了一种新型快速安全的标量乘算法。
Therefore, the key of the efficient executing elliptic curve cryptogram is the efficient computing of multiple point.
因此倍点运算的快速计算是椭圆曲线密码快速实现的关键。
In chapter 3, we study the influence point mining of linear model under elliptic restriction, and show the corresponding statistical function and the outlier mining algorithm.
第三章研究了椭球约束下线性模型的影响点挖掘，给出了相应的统计量，并设计异常挖掘算法。
The operation consume most time is multiplication of a point on the elliptic curve with an integer in the system, which was called multiple point operation.
椭圆曲线密码体制中，最耗时的运算是倍点运算也就是椭圆曲线上的点与一个整数的乘法运算。
We have studied the KS entropy of a 2-dimensional measure-preserving mapping with an elliptic or hyperbolic fixed point respectively, as well as that of its 3-dimensional extension.
我们已经研究了分别具椭圆和双曲不动点的二维保测度映射及其受摄三维扩张的KS熵。
The existence of multiple solutions is obtained for Neumann problem of sublinear elliptic equations by the minimax methods in the critical point theory.
用临界点理论中的极小极大方法得到了次线性椭圆方程Neumann问题多重解的存在性。
The existence of multiple solutions is obtained for Neumann problem of sublinear elliptic equations by the minimax methods in the critical point theory.
用临界点理论中的极小极大方法得到了次线性椭圆方程Neumann问题多重解的存在性。
应用推荐