RSA small-private-exponent problem
Statement
Determine the supremum of the exponents for which the following holds: for every fixed , there is a deterministic polynomial-time algorithm that, given a balanced RSA public key with for primes and of comparable size, , and private exponent satisfying and , recovers or factors .
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.