chinese remainder theorem 中文意思是什麼
chinese remainder theorem
解釋
孫子剩餘定理-
The author mainly realized the method of generating the large random numbers and judging the prime number using lehmann means, then three pairs of secure key with different lengths ( 256 bits, 512 bits, 1024 bits ) was generated to meet the demand of different security grade. in encryption module, modular multiplication arithmetic of large number was realized adopting addition chaining. in decryption module, extended euclid was used to get inverse, and the chinese remainder theorem was used to realize decryption, which increased the speed of decryption greatly
作者主要實現了大隨機數的生成、採用整除小素數和勒曼測試法判定素數，可以生成三種不同長度的密鑰對（ 256位、 512位、 1024位）來滿足不同的加密安全等級的需求；加密模塊中，選用了二進制序列的乘法方法，實現了大數模冪乘運算；解密模塊中，引用了擴展的歐幾里德法求逆元，並採用中國剩餘定理實現解密過程，大大提高了解密速度。 -
Asymmetric - key cryptography, which we will discuss in chapter 10, is based on some topics in number theory, including theories related to primes, factorization of composites into primes, modular exponentiation and logarithm, quadratic residues, and the chinese remainder theorem
我們將在第十章中討論非對稱密鑰密碼學，非對稱密鑰密碼學基於一些數論的論題，這些論題與素數、把復合數分解為素數的因數分解、模指數與模對數、二次剩餘和中國剩餘定理有關。 -
If the sharing secret algorithm based on chinese remainder theorem is expanded by database watermark, full watermark information can not only be recovered only with a part of watermark, but also the data for watermark can be reduced, moreover the performance can be improved significantly
通過研究發現，如果將基於中國剩餘定理的秘密共享思想加以擴展后應用於數據庫水印演算法，不僅能夠基於部分數據恢復水印信息，而且水印數據的擴張大量減少，演算法性能有更進一步的提高。 -
New public - key traitor tracing schemes using chinese remainder theorem
一種抗共謀的公鑰叛逆者追蹤方案 -
On the chinese remainder theorem
關于中國剩餘定理 -
Based on a one - dimensional cellular automata and the chinese remainder theorem, a new multi - secret sharing scheme was proposed in this paper
摘要基於一維細胞自動機和中國剩餘定理提出了一個新的多秘密共享方案。 -
The chinese remainder theorem technique increases the decryption data rate by a factor of four. two redundant blocks are added to adapt to the online partition of the multiplier and the variation of the length of
中國剩餘定理crt的採用，將解密速度提高了近4倍，作者提出一種冗餘結構，使得在採用crt時乘法器可以有效的進行動態分割。 -
Using a multiplexer - based method, the datapath of the multiplier is reconfigurable to perform either one 1024 - bit - multiplication or two 512 - bit multiplications in parallel. the chinese remainder theorem increases the decryption data rate by a factor of 3. 8
數據通路的設計採用一種基於多選器的動態重構方法，其模乘法器可以執行一個1024位的模乘冪運算，也可以并行執行2個512位的模乘冪運算，從而支持基於中國剩餘定理的加速策略。
分享友人