Skip to content

Popular repositories

  1. 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.

    Ruby 3 2

  2. Attacks against plain RSA (When RSA does not padding) and it is able to send arbitrary cipher for server to decrypt.

    Ruby 3

  3. Some CTF wirteup

    Ruby 3 2

  4. When there exist shared prime in modulus of RSA. We can factorize by GCD method efficiently

    C 3 1

  5. When using same (N, e) Modulus and public Exponent in rsa and the plaintext are the same and does not padding

    Ruby 1 2

0 contributions in the last year

Sep Oct Nov Dec Jan Feb Mar Apr May Jun Jul Aug Sep Mon Wed Fri

Contribution activity

January - September 2020

zongyuwu has no activity yet for this period.

Seeing something unexpected? Take a look at the GitHub profile guide.

You can’t perform that action at this time.