求模运算符的作用远不止如此。
所有的余数都可以使用取模运算得到。
Any remainder can be obtained by using the modulus (%) operator.
SQL不支持对浮点数字使用取模运算符。
SQL does not support the modulus operator on floating-point Numbers.
求模运算是数字信号处理中一种基本的处理步骤。
Magnitude calculation is a basic function in digital signal processing.
在公钥密码体制中，模运算是直接影响其它运算的关键运算。
Modular operation is a key one that affects other operations directly in the public key cryptosystem.
蒙哥马利算法对幂模运算的改进大大的提高了RSA的加解密效率。
The advancing of Montgomery algorithm for the computation power module greatly improves the RSA encryption efficiency.
本文介绍了密码学的基本概念，包括数论的基础知识和模运算的概念。
In this thesis, the basic concepts of cryptogram including number theory and modular arithmetic are introduced.
通过分析几种常用的公钥密码算法，归纳了一组最常用的基本模运算指令。
Based on the analysis of public-key algorithms, a set of the most frequently used modular operations, called basic operations, is abstracted.
嵌入水印时，先对水印信息进行扩频，再利用基于模运算的方法嵌入水印。
Spread spectrum was conducted first, and then it was embedded into watermark by means of integer modulo.
另外一个方法就是使用求模运算符了，百分号%就是了，求模运算就是求余数，会把两个数相除然后返回余数。
An alternative is to use the modulus operator, %, which divides two Numbers and returns the remainder.
原先是简单的使用取模运算符（%）的实现，它非常低效，它自己检查从2到目标数的每个数字，确定是否是因子。
The original naive implementation used the modulus (%) operator, which is wildly inefficient, to check every number from 2 up to the target number itself to determine if it is a factor.
文中采用牛顿迭代法，通过对牛顿迭代初始值的优化及除法器的优化设计，在保证计算精度的前提下有效地降低了求模运算量，并已应用于实际雷达系统中。
In this paper, the calculations are decreased efficiently and the result has the same precision in calculation by optimizing the initial number of Newton method and design of divider.
为以较小的面积代价实现RSA公钥密码算法及其他一些算法所需的求模、模加、模乘、模幂等运算，该文设计了一种可作为协处理器使用的模运算处理器。
An area efficient modular arithmetic processor was developed that is capable of performing RSA public-key cryptography and other modular arithmetic operations as a coprocessor.
美国空军正在设计的系统，则能在卫星的5个部分，同时执行一模一样的“备份”运算。
Systems being designed by the us Air Force simultaneously perform identical "backup" calculations in five parts of the satellite.
本文提出了一种可以证明安全性的身份识别方案，只包含一次模指数运算，其在线计算只需要一次乘法和一次加法。
There is only one exponent calculation in our scheme and the on-line computing is just a one multiplication together with one addition.
并将模加、模乘、模平方运算集中设计成了一个多功能运算器，使控制电路更加简单。
The modular addition, modular multiple and modular square are placed in the ALU to simplify the controller.
同时为进一步提高服务器的运算速度，在服务器端利用中国剩余定理(CRT)对RSA解密算法中的模指数进行降幂处理。
Meanwhile, in order to improve the computation speed of the server, the Chinese Remainder Theorem (CRT) is used in RSA decryption algorithm.
练习4 - 3在有了基本框架后，对计算器程序进行扩充就比较简单了。在该程序中加入取模(%)运算符，并注意考虑负数的情况。
Exercise 4-3. Given the basic framework, it's straightforward to extend the calculator. Add the modulus (%) operator and provisions for negative Numbers.
算法的硬件结构由模乘控制器、模幂控制器、数据寄存器和模乘运算单元构成。
The hardware architecture is made up of modular controller, modular exponentiation controller, data register, and modular multiplication operation units.
电路见图5，这种电路在运算电路中相当有用，比如差分对单端的转换，抑制共模信号。
This circuit is shown in Figure 5 and is useful as a computational amplifier, in making a differential to single-ended conversion or in rejecting a common mode signal.
这种模系运算包含通常的概率运算。
This modular operation includes the usual probability operation.
设计了一种采用增益增强技术并带有共模反馈的全差分运算放大器。
This paper discusses a fully differential operational amplifier with gain-boosting and CMFB techniques.
为了提高椭圆曲线密码（ECC）的点乘运算速度，提出了一种快速约简求模算法。
To accelerate point multiplication operation of elliptic curve cryptography(ECC), a fast reduction algorithm for modular operation was introduced.
更换了运算放大调理电路增强了系统的共模抑制能力，改善微弱信号传输中的问题；
The MCU replaces the operational amplifier circuit so as to strengthen the system of common-mode rejection, improve the problems of weak signal transmission.
该算法需在原奇数模模逆算法的基础上，增加一次乘法、一次除法和两次减法运算。
This algorithm needs additionally one times addition, one times division and two times subtraction than original modular inversion algorithm.
模幂算法采用从右到左扫描指数的方法，可以使得两次模乘运算同时进行。
Modul ar exponentiation algorithm scans encryption from right to sot, so t wo modular multiplications can be processed parallelly.
在公钥密码运算中，存在较多的取模操作。
Public key cryptographic arithmetic consists of many modular reduction operations.
设计中采用了按字运算的模乘算法，使本设计具有很好的可扩展性，它可以完成任意位数的模乘运算。
With the help of word-based modular multiplication algorithm, the proposed multiplier is able to work with any precision of the input operands.
有限域上的模逆运算是许多公钥密码系统使用的算法中的核心域运算之一。
Modular inversion is a part of the kernel for computations in the Galois field GF (p) used by many public key cryptosystems.
根据平行并行乘法器，设计了适用于模乘运算的一维阵列组合乘法器。
The one-array combinative multiplication was designed on the basis of the parallel multiplication.
应用推荐