| 释义 |
Big primes
基本例句
大素数
This paper gives a fast arithmetic for the RSA which includes finding the big prime number and th e fast Euclid.本文给出了实现 RSA的快速算法 ,包括寻找大素数和欧几里德的快速实现。
RSA algorithm is a algorithm for Public Key Instrument. Its security based on the difficulty of dividing big prime number.RSA算法是一种公开密钥算法，它的安全系数取决于大素数分解的难度。
The private key and public key are the function of a pair of big prime number .其公开密钥和私人密钥是一对大素数的函数。
Generally, this problem is reduced to quadratic residue problem of modulo a big prime number. But this reduction is not applicable to Optimal Extension Fields .一般而言，该问题归结为模大素数的二次剩余问题，但这种归结不能用于最优扩域OEF。
Generally, this problem is reduced to quadratic residue problem of modulo a big prime number.But this reduction is not applicable to Optimal Extension Fields .一般而言，该问题归结为模大素数的二次剩余问题，但这种归结不能用于最优扩域OEF。
Its security is based on the difficulty of dividing big prime number. The private key and public key are the function of a pair of big prime number.其公开密钥和私人密钥是一对大素数的函数。 从一个公开密钥和密文中恢复出明文的难度等价于分解两个大素数之积。 |