michael/blog
1
0
Fork 0
Code Issues 2 Pull requests Releases Packages 1 Wiki Activity

waht

Browse source
This commit is contained in:
Michael Zhang 2021-07-06 18:04:42 -05:00
parent 098d5014a5
commit ccd16a2648
Signed by: michael
GPG key ID: BDA47A31A3C8EE6B
1 changed files with 1 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
content/posts/2018-10-26-twenty-years-of-rsa-attacks.md
View file

@ -12,7 +12,7 @@ There's [a great paper][1] I found by Dan Boneh from 1998 highlighting the weakn
That being said, I _am_ going to skip over the primer of how the RSA cryptosystem works, since there's already a great number of resources on how to do that. That being said, I _am_ going to skip over the primer of how the RSA cryptosystem works, since there's already a great number of resources on how to do that.
### factoring large integers ## factoring large integers
Obviously this is a pretty bruteforce-ish way to crack the cryptosystem, and probably won't work in time for you to see the result, but can still be considered an attack vector. This trick works by just factoring the modulus, N. With N, finding the private exponent d from the public exponent e is a piece of cake. Obviously this is a pretty bruteforce-ish way to crack the cryptosystem, and probably won't work in time for you to see the result, but can still be considered an attack vector. This trick works by just factoring the modulus, N. With N, finding the private exponent d from the public exponent e is a piece of cake.