VERIFICATION OF KEY MANAGEMENT CRYPTOGRAPHIC PROTOCOLS WITH COLORED PETRI NETS

Abstract

The possibility of using colored Petri nets for the analysis of key distribution cryptographic protocols as an example of symmetric Needham—Schroeder protocol is reviewed and evaluated.

Keywords

• protocol verification
• formal analysis
• key management
• needham—schroeder protocol
• colored petri nets
• cpn tools.