Create your own GitHub profile
Sign up for your own profile on GitHub, the best place to host code, manage projects, and build software alongside 28 million developers.Sign up
- Hsinchu, Taiwan
- Sign in to view email
Coppersmith's theorem has many applications in attacking RSA specifically if the public exponent e is small or if partial knowledge of the secret key is available.
Attacks against plain RSA (When RSA does not padding) and it is able to send arbitrary cipher for server to decrypt.
Some CTF wirteup
When there exist shared prime in modulus of RSA. We can factorize by GCD method efficiently
When using same (N, e) Modulus and public Exponent in rsa and the plaintext are the same and does not padding