模运算

Decimal reproduces mathematics as done by hand and avoids issues that can arise when binary floating point cannot exactly represent decimal quantities.

高精度使 Decimal 可以执行二进制浮点数无法进行的模运算和等值测试。

In this thesis, the basic concepts of cryptogram including number theory and modular arithmetic are introduced.

本文介绍了密码学的基本概念，包括数论的基础知识和模运算的概念。

The algorithm RSA is complicated and difficult in implementing, because it has to do modular exponentiation on largenumbers more than 512 bits.

分析了RSA算法的软件实现难点为大数的幂模运算，提出了将大数的幂模运算转换为小数幂模运算乘积的高效方法，并实现了RSA算法，该方法在理论分析和试验方面都具有较好的效果。

Computation of modular exponentiation is very low because of big plain-text group and cipher-text group,so this algorithm is of great significance to design fast algorithm of RSA and select public-key and private-key of RSA.

RSA算法中明文分组和密文分组都较大，方幂模运算消耗大量的运算时间。因此，简化方幂模计算减少计算次数对设计RSA快速算法和选择密钥具有重要的指导意义。

The algorithms of basic operations for large integer,addition,subtraction and comparison,are presented based on mixed radix representation,the algorithms of multiplication,division, modulo ,and greatest common divisor are conveyed from addition machins.

将大数采用混合基表示，对大数的加法、减法与比较运算给出相应的算法，并对加法机器上的乘法、除法、模运算以及求最大公因子的算法进行了移

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.

为以较小的面积代价实现RSA公钥密码算法及其他一些算法所需的求模、模加、模乘、模幂等运算，该文设计了一种可作为协处理器使用的模运算处理器。

By replacing pseudo-Mersenne numbers with generalized Mersenne numbers, we propose a new notion-Generalized Optimal Extension Fields, and study the fast arithmetic about multiplication and modular arithmetic in GOEFs.

利用广义Mersenne数代替伪Mersenne数，提出了广义最优扩域的概念，并研究其上的快速乘法运算和取模运算，为乘法运算给出了通用的复杂度公式，为取模运算给出了具体的运算公式，推广了Bailey，Mihailescu和Woodbury等在最优扩域上的相应结果。

To the moduli with special forms (such as Mersenne numbers, pseudo-Mersenne numbers, generalized Mersenne numbers), we analysis and study modular arithmetic laws, and obtain the conclusions as follows: for Mersenne numbers and pseudo-Mersenne numbers, we get modular arithmetic formulas, and determine exact expressions of the number of modular addition to generalized Mersenne numbers generated by irreducible monic trinomials and pentanomials.

针对具有特殊形式的模数(如Mersenne数，伪Mersenne数，广义Mersenne数等)，深入分析了其取模运算规律，得到如下结果：对Mersenne数和伪Mersenne数，给出了取模运算转换为模加或模减运算的公式；对模数为任意首一三项式和五项式产生的广义Mersenne数，推导了相应取模运算的复杂度计算解析表达式。

Fundamentally, modulo is the same operation as division, except that you take a

从本质上来说，模运算就是除法运算，不过是取结果的不同部分罢了。

Depending on the coefficient of the polynomial, we can easily compute the number of modular addition of A mod p by the formulas for any given irreducible monic trinomial and monic pentanomial.

根据该表达式，对任意给定的不可约首一三项式和首一五项式，可以根据该多项式的系数分别得出以广义Mersenne数为模数的取模运算所需要的模加法的次数。

As she looked at Warrington's manly face, and dark, melancholy eyes, she had settled in her mind that he must have been the victim of an unhappy attachment.

每逢看到沃林顿那刚毅的脸，那乌黑、忧郁的眼睛，她便会相信，他一定作过不幸的爱情的受害者。

Maybe they'll disappear into a pothole.

也许他们将在壶穴里消失