这些体制的安全性依赖于求解丢番图方程中的一些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.
特别是图的因子分解研究是一个引人注目的课题，它在网络设计和计算机科学中有着广泛的应用。
In particular, the study of factorizations in graphs is very noticeable and very useful in design of networks and computer science.
完全图的因子分解问题。
Firstly, some problems on factorizations in complete graphs are studied.
应用推荐