This follows the same idea as the decimal multiplication algorithm.
它使用的思想和十进制乘法算法的思想相同。
This paper presents a new fast scalar multiplication algorithm on elliptic curve cryptography.
基于椭圆曲线密码，提出了一种快速标量乘算法。
To resist the side channel attacks of elliptic curve cryptography, a new fast and secure point multiplication algorithm is proposed.
为了抵抗椭圆曲线密码的边信道攻击，提出了一种新型快速安全的标量乘算法。
With the help of word-based modular multiplication algorithm, the proposed multiplier is able to work with any precision of the input operands.
设计中采用了按字运算的模乘算法，使本设计具有很好的可扩展性，它可以完成任意位数的模乘运算。
Secondly, it analyzed ECC and how to improve the algorithm efficiency from the point of Times-dot algorithm and scalar multiplication algorithm.
其次文章详细论述了ECC的相关知识及从倍点乘算法和标量乘运算两方面来提高该算法的运算效率。
In this paper, based on the analyzing and comparing some modular multiplication algorithms, we present a new modular multiplication algorithm on sliding window.
本文在分析比较现有快速模乘算法的基础上，提出了一个基于滑动窗口的快速模乘算法。
We propose a new conception: Index Distribution Chart, which makes it possible for us to construct a new fast multiplication algorithm for matrix pairs of arbitrary dimensions.
我们提出了“指标分布图”的新概念，从而构造出一个估计任意维数矩阵乘法的新算法。
Through the finite domain multiplier design based on the polynomial multiplication theory in finite domain, a new simple multiplication algorithm in finite domain is introduced.
采用基于有限域中多项式乘法理论的快速有限域乘法器的设计，得到了简单的有限域上乘积运算算法。
This algorithm greatly reduces times of addition operation which takes time for scalar multiplication algorithm by introducing signed and unsigned sliding window coding methods.
此算法通过引入有符号和无符号滑动窗口编码方法，大大减少了标量乘算法中费时的加法运算次数。
To avoid any division by zero or overflow, transform all division into multiplication and check for the sign (horizontal lines with Y2=Y1 do not count in the algorithm)
要避免任何数与0 相除或溢出，将所有除法转换为乘法并检查运算符号（Y2=Y1的水平线不会计入算法）
Presented in this paper is a mixed algorithm (MD algorithm), which carries out multiplication and division at the same time without increasing the number of recursive operation.
本文提出了一种同时进行乘法和除法而不增加迭代次数的复合算法(乘除算法)。
A commonly used microcomputer algorithm for multiplication.
微型计算机一种常用的乘法算法。
Montgomery algorithm is the most popular method for modular multiplication in RSA systems.
蒙哥马利算法是在RSA密码系统中广泛应用的模乘法算法。
This paper presents an algorithm to edge detection by scale multiplication based on Gaussian filter.
论文提出一种基于高斯滤波器的尺度相乘边缘检测算法。
Compute shortest paths with matrix multiplication and the Floyd-Warshall algorithm for the following graph.
计算最短路径与矩阵乘法和弗洛伊德·沃肖尔算法对以下图。
At the same time, it makes on line distinguishing of the model parameters by recursion minimum quadratic multiplication real time correction algorithm with changeable forget factor.
并用具有可变遗忘因子的递推最小二乘实时校正算法对模型参数进行在线识别。
In this algorithm, the morphological operations are non-dual and the contrast stretching operations are addition instead of multiplication.
新算法主要特点是形态运算采用非对偶运算，对比度拉伸运算采用加法代替乘法运算。
A parallel algorithm for matrix multiplication based on optical transpose interconnection system (OTIS) network is proposed, and the time complexity is analyzed.
提出基于光交换互连系统(otis)网络结构的矩阵乘并行算法，分析它的时间复杂性。
To accelerate point multiplication operation of elliptic curve cryptography(ECC), a fast reduction algorithm for modular operation was introduced.
为了提高椭圆曲线密码（ECC）的点乘运算速度，提出了一种快速约简求模算法。
The author proposes an algorithm for computing the multiplication table of the normal basis over the finite fields.
作者给出计算有限域上正规基乘法表的一个算法。
The authors propose an algorithm for computing multiplication tables of optimal normal bases over finite fields, which is better than those corresponding results of Sun.
本文给出了有限域上最优正规基乘法表的一个计算方法，改进了孙琦的相应结果。
This paper introduces the basic idea and algorithm of sparse Matrix multiplication by using incompact storage method.
介绍了对稀疏矩阵进行压缩存储时，稀疏矩阵相乘运算的基本思想和算法。
RSA algorithm is considered as one of the relatively safe crypto-system, and the multiplication of large integer is the key operation in fact.
RSA算法是目前被认为可以实现安全通信的理想的公钥密码体制之一，其主要操作实际上是一系列基本的大整数模乘运算。
Design an multiplication based on parallel LUT (Look up Table). The problem of time parallel is resolved with pipeline optimization algorithm, the speed of DCT is accelerated.
改进了DCT变换算法，设计了并行查找表结构的乘法器，采用了流水线优化算法来解决时间并行性问题，提高了DCT模块的运算速度。
The algorithm can greatly reduce the number of elliptic point addition, so the efficiency of scalar multiplication in elliptic curves is improved.
该算法比经典算法减少了点的加法的计算次数，从而加快了椭圆曲线上点的数乘的运算速度。
Using the improved algorithm, we present the attack on elliptic curve cryptosystems with binary scalar multiplication, and verify it through software simulation.
采用改进的算法针对二进制方法点乘的椭圆曲线密码进行了符号变换故障攻击，利用仿真实验进行了验证。
The methods to speed up the scalar multiplication computation are mainly discussed in two ways: one is the number system, another is parallel algorithm.
主要从两个方面来研究快速算法，一是研究数域系统以加快标量乘法运算，二是研究标量乘法运算的并行算法。
First summarizes the differences on principle between two kinds of parallel algorithm of matrix-vector multiplication, namely, divided by row and divided by column.
文中首先总结按行划分和按列划分的并行矩阵向量乘法在原理上的异同。
In the general ellipse - generating algorithm for raster - pixel, there are always multiplication and square root operating in the main iteration loop, so the calculating cost is more expensive.
在一般光栅象素的椭圆生成算法中，其主循环中均带有乘法和开方等运算，因而其计算量较大。
To improve the efficiency of the algorithm of point multiplication on elliptic curves is a key problem.
提高椭圆曲线点积运算的效率是椭圆曲线研究的一个核心问题。
应用推荐