Welcome to the resource topic for 2008/482
Title:
The Generic Hardness of Subset Membership Problems under the Factoring Assumption
Authors: Tibor Jager, Jörg Schwenk
Abstract:We analyze a large class of subset membership problems related to integer factorization. We show that there is no algorithm solving these problems efficiently without exploiting properties of the given representation of ring elements, unless factoring integers is easy. Our results imply that problems with high relevance for a large number of cryptographic applications, such as the quadratic residuosity and the subgroup decision problems, are generically equivalent to factoring.
ePrint: https://eprint.iacr.org/2008/482
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .