運算 [數學] operation; arithmetic; operating 四則運算 the four fundamental operations of arithmetic; 每秒鐘運算一千萬次 capable of 10,000,000 calculations per second; 運算器 arithmetic unit; arithmetic device; arithmetical unit; arithmetic-logic unit; logic unit; logic-arithmetic unit
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的核心運算? ?乘模運算。
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環境下的進行快速模運算的軟件包。
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 結果表明,該方法可以減小建模運算時間,剔除噪聲過大的譜區,使最終建立的農產品品質檢測近紅外光譜模型的預測能力和精度更高。
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 提出了一種在小波域內的基于混沌序列的模運算數字圖像加密解密算法和基于混沌序列的魔方變換數字圖象加密解密算法。
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 本文對數據加密體制用到的大整數模運算進行研究。我們的工作分為兩個部分:一部分是對大整數快速模運算算法的分析、研究;另一部分是大整數快速模運算算法的實現。
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等一類公鑰密碼體制中,計算形如的運算是最耗時的運算步驟,大整數模運算是其核心運算。提高這種運算的運算速度方法分為加快模乘法的運算速度和減少模乘法的次數兩個方面。