Deciding the Security of Protocols with Commuting Public Key Encryption
Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani · Electronic Notes in Theoretical Computer Science · 2005
Many cryptographic protocols and attacks on these protocols make use of the fact that the order in which encryption is performed does not affect the result of the encryption, i.e., encryption is commutative. However, most models for the automatic analysis of cryptographic protocols can not handle such encryption functions since in these models the message space is considered a free term algebra. In this paper, we present an NP decision procedure for the insecurity of protocols that employ RSA encryption, which is one of the most important instances of commuting public key encryption.