Break (Reduced) RSA Using Factorization

preview_player
Показать описание
#cryptology, #cryptography, #cryptanalysis

In this video, we attack a "reduced" version of RSA, meaning, a short RSA key (256 bit) using the Quadratic Sieve component of CrypTool 2. This should demonstrate, why using short RSA keys today is not a good idea.

Рекомендации по теме
Комментарии
Автор

Thank you, now I understood how encryption and decryption works with RSA. So the weakpoint isn’t diffie Hellman but rather their generation of RSA keys. I wonder if diffie Hellman can be attacked by itself or am I a little confused now? :3

RAPEVERMRC
Автор

The primes you used dont look safe. Will this program work with the RSA challenge numbers?

animalliberation
Автор

I have value of 'N' but how to find out the value of 'P' & 'Q'? Shall I use cryptool 2 to find out the same?

sumedhkadam
Автор

Thank you for the amazing vídeo. Ok but what is the alternative use for RSA?

creonte
Автор

Thank you very much it was very useful

tyswamy
Автор

Elliptic Curves has a standard known, RSA is not a good idea, we have few options. Usability, compatibility and in some cases of hardwares the size has need to be short. A paradox isn't ?

creonte