ZYWU's repositories
CoppersmithAttack
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.
BatchGCDFactorization
When there exist shared prime in modulus of RSA. We can factorize by GCD method efficiently
CTFWriteUp
Some CTF wirteup
RSA_ChosenCiphertextAttack
Attacks against plain RSA (When RSA does not padding) and it is able to send arbitrary cipher for server to decrypt.
CommonModulusAttack
When using same (N, e) Modulus and public Exponent in rsa and the plaintext are the same and does not padding
WienerAttack
The Wiener's attack, named after cryptologist Michael J. Wiener, is a type of cryptographic attack against RSA. The attack uses the continued fraction method to expose the private key d when d is small.
Baby-Step_Gaint-Step
An algorithm to find dislogrithm problem in O(sqrt(n))
chchao
beeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeep
DNSSECLoadTesting
Project of DNSSEC Load Testing
FermatFactorization
Factor N = p*q when p is too close to p
MersenneFactorization
Factorize two product of mersenne primes
PollarFactorization
If either p − 1 or q − 1 has only small prime factors, n can be factored quickly by Pollard's p − 1 algorithm