2000 character limit reached
Product Subset Problem : Applications to number theory and cryptography (2002.07095v3)
Published 10 Feb 2020 in math.NT and cs.DM
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
