New answers tagged security-definition
1
vote
Accepted
If RSA uses $e$ with $\gcd(e,\phi(N))\ne1$ but $e$ is hard to factorize has an adversary still an advantage in finding $d$ for $m^{ed}\equiv m\mod N$?
One obvious factorization method be to do:
...
Top 50 recent answers are included
Related Tags
security-definition × 271provable-security × 65
encryption × 22
terminology × 20
cryptanalysis × 12
chosen-plaintext-attack × 12
semantic-security × 12
hash × 11
rsa × 10
signature × 10
zero-knowledge-proofs × 10
symmetric × 10
protocol-design × 10
perfect-secrecy × 10
adversarial-model × 10
public-key × 9
multiparty-computation × 9
homomorphic-encryption × 8
collision-resistance × 8
chosen-ciphertext-attack × 8
protocol-analysis × 8
block-cipher × 7
pseudo-random-generator × 7
post-quantum-cryptography × 6
authenticated-encryption × 6