这些体制的安全性依赖于求解丢番图方程中的一些NP完全问题和大数的素因子分解的困难性。
The security of these new cryptosystems depends on some NP-complete problems in the theory of Diophantine equations and on the difficulty of large number decomposition.
主要讨论了二次整环的单位、素元、因子分解、二次整环的剩余类环的性质等问题。
It mainly discusses units, prime elements, factorization, the properties of residue class ring of quadratic domain in the paper.
主要讨论了二次整环的单位、素元、因子分解、二次整环的剩余类环的性质等问题。
It mainly discusses units, prime elements, factorization, the properties of residue class ring of quadratic domain in the paper.
应用推荐