An Approach for Ensuring Security and its Verification

In this paper a new symmetric key cryptographic algorithm has been designed. The algorithm is enriched with various calculations through which the ciphertext becomes unpredictable and breaking the security by eavesdropper becomes harder. In terms of properties of Petri net and the analysis technique of reachability tree, the protocol was proved to be boundedness, deadlock free and liveness. KeywordsCryptography, Symmetric key, Petri Net, Reachability Tree, Compression

[1]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[2]  Jiacun Wang,et al.  Charging Information Collection Modeling and Analysis of GPRS Networks , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[3]  Alessandro Giua,et al.  Modeling and Supervisory Control of Railway Networks Using Petri Nets , 2008, IEEE Transactions on Automation Science and Engineering.

[4]  Behrouz A. Forouzan,et al.  Cryptography and network security , 1998 .

[5]  Ranjan Dasgupta,et al.  A Petri Net Representation of a Web-Service- Based Emergency Management System in Railway Station , 2011 .

[6]  Lars Michael Kristensen,et al.  Coloured Petri Nets and CPN Tools for modelling and validation of concurrent systems , 2007, International Journal on Software Tools for Technology Transfer.

[7]  Asoke Nath,et al.  Symmetric Key Cryptography Using Random Key Generator , 2010, Security and Management.