Strong RSA assumption
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. The strong RSA assumption was first used for constructing signature schemes provably secure against existential forgery without resorting to the random oracle model.
Link from a Wikipage to another Wikipage
primaryTopic
Strong RSA assumption
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. The strong RSA assumption was first used for constructing signature schemes provably secure against existential forgery without resorting to the random oracle model.
has abstract
In cryptography, the strong RS ...... ng to the random oracle model.
@en
強RSA仮定(きょうRSAかてい)とは、暗号技術において、RSA暗号やRSA類似の暗号方式の安全性研究に使用される仮定の一つである。
@ja
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
952,866,322
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
comment
In cryptography, the strong RS ...... ng to the random oracle model.
@en
強RSA仮定(きょうRSAかてい)とは、暗号技術において、RSA暗号やRSA類似の暗号方式の安全性研究に使用される仮定の一つである。
@ja
label
Strong RSA assumption
@en
強RSA仮定
@ja