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.
这些体制的安全性依赖于求解丢番图方程中的一些NP完全问题和大数的素因子分解的困难性。
Diophantine equation is an important subject in number theory and closely connected with algebraic number theory, combinatorics, algebraic geometry and computer science etc.
丢番图方程是数论中一个十分重要的研究课题，与代数数论、组合数学、代数几何等有密切联系。
应用推荐