In this article we discuss some questions with respect to number theory in the works of Euclid and diophantus.
2
这些体制的安全性依赖于求解丢番图方程中的一些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.
点击反馈