... 莫质数 queen of negative 大质数 large prime number teeth ; big prime number 质数对 prime pair ...
基于6个网页-相关网页
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) .
一般而言,该问题归结为模大素数的二次剩余问题,但这种归结不能用于最优扩域OEF。
参考来源 - 基于椭圆曲线离散对数问题的公钥密码及其算法研究·2,447,543篇论文数据,部分数据来源于NoteExpress
Maximum number of connections allowed. (Use a big prime number.)
允许最大的连接数。(使用较大的数。)
And the generation of big prime number and the googol computation are also solved in this system.
在系统的实现过程中,还主要解决了大素数的生成以及大数运算等问题。
This paper gives a fast arithmetic for the RSA which includes finding the big prime number and the fast Euclid.
本文给出了实现RSA的快速算法,包括寻找大素数和欧几里德的快速实现。
应用推荐