The search functionality is under construction.

The search functionality is under construction.

This paper proposes a public-key cryptography by applying RSA and Petri nets. We introduce RSA and a Petri net based private-key cryptography and then taking the advantages of these two cryptography, we propose a new public-key cryptography, PNPKC. To compare with RSA on security as well as computation order, we do simulation experiments. As the results, the security of PNPKC is as strong as RSA cryptography, and the encryption and decryption of PNPKC are in average 239 times as fast as RSA cryptography from our experiments. Besides, to see if our current PNPKC program can be practically used, we do comparative experiment with PGP, which shows PNPKC takes computation time in average as much as 36 times of PGP cryptography. That means our PNPKC program still needs to be technically improved.

- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E84-A No.6 pp.1532-1535

- Publication Date
- 2001/06/01

- Publicized

- Online ISSN

- DOI

- Type of Manuscript
- Special Section LETTER (Special Section on Papers Selected from 2000 International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC 2000))

- Category

The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.

Copy

Qi-Wei GE, Takako OKAMOTO, "A Petri Net Based Public-Key Cryptography: PNPKC" in IEICE TRANSACTIONS on Fundamentals,
vol. E84-A, no. 6, pp. 1532-1535, June 2001, doi: .

Abstract: This paper proposes a public-key cryptography by applying RSA and Petri nets. We introduce RSA and a Petri net based private-key cryptography and then taking the advantages of these two cryptography, we propose a new public-key cryptography, PNPKC. To compare with RSA on security as well as computation order, we do simulation experiments. As the results, the security of PNPKC is as strong as RSA cryptography, and the encryption and decryption of PNPKC are in average 239 times as fast as RSA cryptography from our experiments. Besides, to see if our current PNPKC program can be practically used, we do comparative experiment with PGP, which shows PNPKC takes computation time in average as much as 36 times of PGP cryptography. That means our PNPKC program still needs to be technically improved.

URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_6_1532/_p

Copy

@ARTICLE{e84-a_6_1532,

author={Qi-Wei GE, Takako OKAMOTO, },

journal={IEICE TRANSACTIONS on Fundamentals},

title={A Petri Net Based Public-Key Cryptography: PNPKC},

year={2001},

volume={E84-A},

number={6},

pages={1532-1535},

abstract={This paper proposes a public-key cryptography by applying RSA and Petri nets. We introduce RSA and a Petri net based private-key cryptography and then taking the advantages of these two cryptography, we propose a new public-key cryptography, PNPKC. To compare with RSA on security as well as computation order, we do simulation experiments. As the results, the security of PNPKC is as strong as RSA cryptography, and the encryption and decryption of PNPKC are in average 239 times as fast as RSA cryptography from our experiments. Besides, to see if our current PNPKC program can be practically used, we do comparative experiment with PGP, which shows PNPKC takes computation time in average as much as 36 times of PGP cryptography. That means our PNPKC program still needs to be technically improved.},

keywords={},

doi={},

ISSN={},

month={June},}

Copy

TY - JOUR

TI - A Petri Net Based Public-Key Cryptography: PNPKC

T2 - IEICE TRANSACTIONS on Fundamentals

SP - 1532

EP - 1535

AU - Qi-Wei GE

AU - Takako OKAMOTO

PY - 2001

DO -

JO - IEICE TRANSACTIONS on Fundamentals

SN -

VL - E84-A

IS - 6

JA - IEICE TRANSACTIONS on Fundamentals

Y1 - June 2001

AB - This paper proposes a public-key cryptography by applying RSA and Petri nets. We introduce RSA and a Petri net based private-key cryptography and then taking the advantages of these two cryptography, we propose a new public-key cryptography, PNPKC. To compare with RSA on security as well as computation order, we do simulation experiments. As the results, the security of PNPKC is as strong as RSA cryptography, and the encryption and decryption of PNPKC are in average 239 times as fast as RSA cryptography from our experiments. Besides, to see if our current PNPKC program can be practically used, we do comparative experiment with PGP, which shows PNPKC takes computation time in average as much as 36 times of PGP cryptography. That means our PNPKC program still needs to be technically improved.

ER -