论文标题
产品子集问题：数字理论和密码学的应用
Product Subset Problem : Applications to number theory and cryptography
论文作者
论文摘要
我们考虑子集产品问题（SPP）在数字理论和密码学中的应用。我们获得了一种攻击SPP的概率算法，并以尊重时间/空间的复杂性和成功概率进行分析。实际上，我们为查找Carmichael号码和对Naccache-sern-stern Knapsack Cryptosystem的攻击的问题提供了一个应用程序，我们在此更新了先前的结果。
We consider applications of Subset Product Problem (SPP) in number theory and cryptography. We obtain a probabilistic algorithm that attack SPP and we analyze it with respect time/space complexity and success probability. In fact we provide an application to the problem of finding Carmichael numbers and an attack to Naccache-Stern knapsack cryptosystem, where we update previous results.
