Presentation 2004-11-04
On Obtaining All the Elementary T-invariants Using Linear Programming
Tomiyuki FUKUNAGA, Qi-Wei GE, Mitsuru NAKATA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) A concept of Petri net based Multi-stage-Encryptions Public-Key Cryptography, MEPKC, has been proposed in order to guarantee stronger network communication security. Differ from an ordinary public-key cryptography, MEPKC opens a key-generator to the public, from which multiple encryption keys are generated and used in encrypting plaintexts to ciphertext stage by stage. Ih MEPKC, Petri nets are used as the key-generators and elementary T-invariants are used as the encryption keys. In this paper, we discuss how to effectively compute all the elementary T-invariants in order to develop a method of generating encryption keys of MEPKC.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) public-key cryptography / Petri net / elementary T-invariant / Linear Programming / MEPKC
Paper # CAS2004-52,CST2004-31
Date of Issue

Conference Information
Committee CAS
Conference Date 2004/10/28(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Circuits and Systems (CAS)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) On Obtaining All the Elementary T-invariants Using Linear Programming
Sub Title (in English)
Keyword(1) public-key cryptography
Keyword(2) Petri net
Keyword(3) elementary T-invariant
Keyword(4) Linear Programming
Keyword(5) MEPKC
1st Author's Name Tomiyuki FUKUNAGA
1st Author's Affiliation Graduate School of Education, Yamaguchi University()
2nd Author's Name Qi-Wei GE
2nd Author's Affiliation Faculty of Education, Yamaguchi University
3rd Author's Name Mitsuru NAKATA
3rd Author's Affiliation Faculty of Education, Yamaguchi University
Date 2004-11-04
Paper # CAS2004-52,CST2004-31
Volume (vol) vol.104
Number (no) 402
Page pp.pp.-
#Pages 6
Date of Issue