e/Strong RSA assumption

Information
has gloss	eng: In cryptography, the strong RSA assumption states that the RSA problem is intractable even when the solver is allowed to choose the public exponent e (for e ≥ 3). More specifically, given a modulus N of unknown factorization, and a ciphertext C, it is infeasible to find any pair (M, e) such that C ≡ M e mod N.
lexicalization	eng: strong RSA assumption
instance of	c/Computational hardness assumptions

Meaning
Japanese
has gloss	jpn: 強RSA仮定（きょうRSAかてい）とは、暗号技術において、RSA暗号やRSA類似の暗号方式の安全性研究に使用される仮定の一つである。
lexicalization	jpn: 強RSA仮定