arXiv · 2002.07095
Product Subset Problem : Applications to number theory and cryptography
Abstract
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.
Explore related subjects
Keep this discovery
K. A. Draziotis, V. Martidis, S. Tiganourias. 2020-02-10. Product Subset Problem : Applications to number theory and cryptography. https://arxiv.org/abs/2002.07095
Cite the original work for its findings. Save a collection to share your selection of sources.