OK, in school, some of the lecturers always say "if you compound the crypto, it may make the cipher weaker".
So, which combinations of algorithms would do this? Why? Can anyone show the mathematical proof?
For example, would RSAk1(AESk2[AESk3[x]])
make the encrypted x weaker? Assuming all keys used are different and randomly generated using a SecureRandom function.
RSAk1(AESk2[AESk3[x]]) = DESk4[x]
. $\endgroup$RSAk1(AESk2[AESk3[x]]) = DESk4[x]
thing was just an example, I could writeRSAk1(AESk2[AESk3[x]]) = 1+1
, but that looks ridiculous. $\endgroup$