Presentation 2004-07-20
An Attack against the Traveling Salesman Cryptosystem
Akira HAYASHI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We propose a method for breaking one of the traveling-salesman cryptosystems invented by K. Kobayashi and his students. The target system is different from their previous ones in the following two ways. First, each path has a length of Gaussian integer. Secondly, mixed arithmetic operations of addition and multiplication are used in encipherment. In the present attack multiplied keys are first found, and then the remaining summed part is analyzed by the Lagarias-Odlyzko method. The success rate of atttacks obtained from computer experiments was more than 40% in the case of 5-15 cities.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) public-key cryptography / traveling-salesman cryptosystems / cryptanalysis / Lagaris-Odlyzko attack
Paper # ISEC2004-20
Date of Issue

Conference Information
Committee ISEC
Conference Date 2004/7/13(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) An Attack against the Traveling Salesman Cryptosystem
Sub Title (in English)
Keyword(1) public-key cryptography
Keyword(2) traveling-salesman cryptosystems
Keyword(3) cryptanalysis
Keyword(4) Lagaris-Odlyzko attack
1st Author's Name Akira HAYASHI
1st Author's Affiliation Kanazawa Institute of Technology()
Date 2004-07-20
Paper # ISEC2004-20
Volume (vol) vol.104
Number (no) 199
Page pp.pp.-
#Pages 4
Date of Issue