Trapdoor-free security from multiple nearby RSA moduli
Statement
For nearby moduli and maps , prove the conjecture that with sufficiently many components at least one is not polynomial-time invertible, thereby validating the proposed trapdoor-free RSA-like probabilistic function.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.