Product Subset Problem : Applications to number theory and cryptography
Number Theory
2022-11-17 v3 Discrete Mathematics
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.
Cite
@article{arxiv.2002.07095,
title = {Product Subset Problem : Applications to number theory and cryptography},
author = {K. A. Draziotis and V. Martidis and S. Tiganourias},
journal= {arXiv preprint arXiv:2002.07095},
year = {2022}
}
Comments
18 pages, 2 figures, LaTeX; references added, minor improvements