Editing Strong RSA assumption (section)

In [[cryptography]],  the '''strong [[RSA (algorithm)|RSA]] assumption''' states that the [[RSA problem]] is intractable even when the solver is allowed to choose the public exponent ''e'' (for ''e''&nbsp;≥&nbsp;3).  More specifically, given a modulus ''N'' of unknown factorization, and a ciphertext ''C'', it is infeasible to find any pair (''M'',&nbsp;''e'') such that&nbsp;''C''&nbsp;≡&nbsp;''M''<sup>&nbsp;''e''</sup>&nbsp;mod&nbsp;''N''.

The strong RSA assumption was first used for constructing [[digital signature|signature]] schemes [[provable security|provably secure]] against [[existential forgery]] without resorting to the [[random oracle model]].