Strong RSA assumption
id:
strong-rsa-assumption-305-13492073
title:
Strong RSA assumption
text:
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.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Strong_RSA_assumption
date created:
date modified:
2024-01-13T09:25:04Z
main entity:
{"identifier":"Q7624514","url":"https://www.wikidata.org/entity/Q7624514"}
image:
fields total:
13
integrity:
13