0
$\begingroup$

In this paper Maurer and Aggarwal showed that in generic model of computation breaking RSA is equivalent to factoring. It is also known that the LSB of an encrypted message is as hard as breaking RSA.(i.e If there is an algorithm that find the lsb of the message m from the ciphertext c, then we can recover m). So I was wondering, does it follow that the LSB of RSA is a hard as factoring in the generic model of computation?

$\endgroup$
  • 1
    $\begingroup$ Do you have a Reference for: "It is also known that the LSB of an encrypted message is as hard as breaking RSA."? $\endgroup$ – kodlu Jan 26 at 2:28
  • $\begingroup$ @kodlu, have a look at this post crypto.stackexchange.com/questions/11053/… $\endgroup$ – Marc Ilunga Jan 26 at 11:39

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.