Presentation 2003/3/19
Traveling salesman Cryptosystem using Gaussian Integer
Teruyuki SUZUKI, Kunikatsu KOBAYASHI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We propose a public key cryptosystem using the traveling salesman problem that is a NP complete problem. Gaussian integers are assigned to edges of the graph. The cipher text is obtained by using the mixed sum and product operations of Gaussian integers. This cryptosystem is secure against the attacks using LLL algorithm and Shamir algorithm.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Traveling salesman problem / Gaussian integer / Public key cryptosystem / LLL algorithm
Paper # IT2002-59,ISEC2002-117,SST2002-165,ITS2002-142
Date of Issue

Conference Information
Committee ISEC
Conference Date 2003/3/19(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 Information Security (ISEC)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Traveling salesman Cryptosystem using Gaussian Integer
Sub Title (in English)
Keyword(1) Traveling salesman problem
Keyword(2) Gaussian integer
Keyword(3) Public key cryptosystem
Keyword(4) LLL algorithm
1st Author's Name Teruyuki SUZUKI
1st Author's Affiliation Faculty of Engineering, Yamagata University()
2nd Author's Name Kunikatsu KOBAYASHI
2nd Author's Affiliation Faculty of Engineering, Yamagata University
Date 2003/3/19
Paper # IT2002-59,ISEC2002-117,SST2002-165,ITS2002-142
Volume (vol) vol.102
Number (no) 743
Page pp.pp.-
#Pages 3
Date of Issue