Computational Rationality of Formal Analysis on Cryptographic Protocols

This paper describes and discusses the computational rationality of formal analysis on cryptographic protocols, which is based on the computational rationality theorem of formal encrypt on Abadi-Rowgaway. Analysis of group key distribution protocol shows that the theorem has strong analytical ability to the protocols alternative attacks. The paper presents formal methods on group key distribution protocols, and the formal definition of security in the computational method. Finally, it proves its rationality.