Cryptology ePrint Archive: Report 2008/482
Available versions in chronological order
20081119:050304 (posted 19-Nov-2008 05:03:04 UTC)
The Quadratic Residuosity Problem May Be Equivalent to Factoring
Tibor Jager and Jörg Schwenk
20090219:122851 (posted 19-Feb-2009 12:28:51 UTC)
The Generic Hardness of Subset Membership Problems under the Factoring Assumption
Tibor Jager and Jörg Schwenk
[
Cryptology ePrint archive
]