Construction of Petri nets and Calculation of Elementary T-invariants for Multi-stage-Encryptions Public-Key Cryptography: MEPKC

This paper aims at automatically generating Petri nets that are used as key generator of a public-key cryptography MEPKC. MEPKC is different from general public-key cryptography, which opens a key-generator to the public and uses the elementary T-invariants as the encryption keys to repeatedly encrypt a plain text stage by stage, and so that the its security can be as strong as expected. The Petri net used as a key generator must include a lot of elementary T-invariants, and the creator of the Petri net must be able to grasp all the elementary T-invariants. In this paper, we propose a method of generating Petri nets whose complexity is enough to be a key generator and obtaining all its the elementary T-invariants.