multiplications
英 [ˌmʌltɪplɪˈkeɪʃənz]
美 [ˌmʌltəpləˈkeɪʃənz]
n. 乘; 相乘; 增加
multiplication的复数
双语例句
- The optimum paths for multiplications of 7 and 8 are depicted in Figure 6.17.
图6.17中描绘了倍增7倍和8倍的最优路径。 - The paper discussed the algorithm for computing Scalar Multiplications on none-supersingular elliptic curves defined over GF ( 2~ m).
标量乘法的快速运算是椭圆曲线密码学中研究的一个焦点。 - The window method is used to significantly reduce the number of modular multiplications needed for completing the modular exponentiation.
在设计中还采用了窗口法减少模幂运算过程中所需进行的模乘运算次数，大大提高了处理速度。 - All of these algorithms avoid calculating functions which need much more time, and usually, only 4 additions and 4 multiplications are needed to accurately calculate the coordinates of the Points on the arcs.
这些算法避免了需要较长时间的函数值计算，一般只需进行4次乘法和4次加法运算，就可以由曲线弧上前一点的坐标值精确地计算出下一点的坐标值。 - The alias effects caused by complex-conjugate multiplications on IP quality are analyzed.
研究了干涉图形成过程出现的混叠效应对干涉相位质量的影响。 - At the same time, the duality result has been proved: two multiplications of loop space Y of pointed space Y obtained by two different ways are homotopic.
同时，也证明了对偶结果：通过两种途径得到点标拓扑空间Y的回路空间ΩY上的两个乘法也是同伦的。 - It requires about n 2 multiplications and additions for each iteration where n is the number of variables.
此算法每次迭代约需n2次乘法和加法，其中n是模型中变量的数目。 - This paper discusses the software implementation of the elliptic curve digital signature algorithm ( ECDSA) over GF ( 2m), and gives a new way to compute point multiplications based Fixed-Point which improve the speed of digital signature generation and signature checking.
本文讨论了椭圆曲线数字签名算法（ECD-SA）在GF（2~m）域上的软件实现，提出了一种基于固定基的核心点乘运算的快速算法，提高了数字签名和签名验证的速度。 - This multiplier has two working modes, normal mode and SIMD mode which support 16-bit multiplication or two 8-bit multiplications respectively.
该乘法器有两种工作模式，普通模式和SIMD模式，可以支持16位整数乘法或2个8位乘法。 - Compared with the existing schemes without suffering from key escrow, ours achieves higher efficiency since the signing algorithm needs only one scalar multiplication in the additive group while the reverse operation requires only three scalar multiplications. 4.
与已有的无密钥托管的签名方案相比，我们的方案实施效率高：签名算法只需要1个加法群上的标量乘运算，而验证算法仅需3个标量乘运算。