Can RSA Be Cracked? Well, Yes!
Well, if Bob sends out the same message to Alice, Carol, Dave and Trent
There’s a feeling that RSA is a 100% secure method, but it is in no way a perfect method, and it sometimes needs to be treating with care when implementing with it. Dan Shumow, for example, recently found a major problem in the way that the keys are created [here]:
and the Bleichenbacker vulnerability was published over two decades ago, and is still causing problems [here]:
Most people know, too, that RSA is in great danger of being deprecated around its robustness against quantum computers. There, too, several theoretic attacks on RSA, and one of its long term enemies is the Chinese Remainder Theorem (CRT). So, as academic exercise, let’s take a very simple example to illustrate how we crack RSA with CRT.
RSA and CRT
With CRT we might want to find the value of x and when divided by 11, 13, 19 and 81 gives the division remainder of…
