| 1. | An integer used for division in modular arithmetic
模运算中用作除数的整数。 |
| 2. | A blended transform domain watermarking based on multi - value sequence modal operator
基于多值序列模运算的混合变换域水印 |
| 3. | Steganography using dual - modulo arithmetic without introducing histogram abnormality
采用两次模运算的无直方图异常安全密写法 |
| 4. | To ensure normalized values inches 12 . 0 , the constructor performs modulo 12 arithmetic
为了确保使用标准形式的值（英寸< 12 . 0 ） ，构造函数执行对12的求模运算。 |
| 5. | Raac - rsa adopts improved systolic array to realize montgomery arithmetic and , in this way , finishes the cardinal arithmetic of rsa , i . e . multiple module
其中raac - rsa方案采用改进后的systolic阵列来实现变种的蒙哥马力算法,进而完成rsa的核心运算? ?乘模运算。 |
| 6. | Roughly , the thesis could be divided into two parts - the algorithms analyzing for fast modular computation and the software implementation of the basic algorithms
算法实现的目标是实现一个用于ia - 32的pc机windows98或windows2000环境下的进行快速模运算的软件包。 |
| 7. | The optimal combinations of 5 spectral intervals among 40 intervals that selected by ipls yielded a good result . ipls model could diminish runtime and select the optimal intervals
结果表明，该方法可以减小建模运算时间，剔除噪声过大的谱区，使最终建立的农产品品质检测近红外光谱模型的预测能力和精度更高。 |
| 8. | Firstly , a natural number chaotic sequence is created with the key . then the image matrix is transformed with this chaotic sequence , using the magic cube transformation . the results indicate that the proposed algorithm can get a satisfying effect
提出了一种在小波域内的基于混沌序列的模运算数字图像加密解密算法和基于混沌序列的魔方变换数字图象加密解密算法。 |
| 9. | This thesis , focused on the large integer modular computations , studies the two ways to reduce the time consumed by modular exponentiation - - - algorithms for fast modular multiplication and algorithms for computing powers with the least numbers of modular multiplication
本文对数据加密体制用到的大整数模运算进行研究。我们的工作分为两个部分：一部分是对大整数快速模运算算法的分析、研究；另一部分是大整数快速模运算算法的实现。 |
| 10. | The modular exponentiation , are the core and the most time consuming steps in public key crytographic schemes such as ras and elgammal schemes , in those the security is guaranteed by the assumption that the integers is large enough , say 1024 or 2048 bits long
在rsa和elgammal等一类公钥密码体制中，计算形如的运算是最耗时的运算步骤，大整数模运算是其核心运算。提高这种运算的运算速度方法分为加快模乘法的运算速度和减少模乘法的次数两个方面。 |
