* rachid baih: > tanks > Take any number c ( rsa encrypted message) You can continue encrypting > process (with rsa function ) > no matter what number c you start with, you will always eventually > reach c the encrypt message. > then m = c-1 > function is periodic
I think this is sometimes called "superencryption" in the literature. I cannot find the original paper from Simmons and Norris, but here is Rivest's rebuttal: <http://people.csail.mit.edu/rivest/Rivest-RemarksOnAProposedCryptanalyticAttackOnTheMITPublicKeyCryptosystem.pdf> -- You received this message because you are subscribed to the "Crypto++ Users" Google Group. To unsubscribe, send an email to [email protected]. More information about Crypto++ and this group is available at http://www.cryptopp.com.
