Presentation 2008-11-14
On lattice bases for the Lagarias-Odlyzko attack against TSP cryptosystems
Takeshi TANIGUCHI, Akira HAYASHI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The Lagarias-Odlyzko (LO) method is a tool for attacks against many variants of knapsack cryptosystems. Specifically it is known to be powerful for low density systems. We try to break a knapsack system with density greater than 1. Our target system is the TSP cryptosystem proposed by Kobayashi and Kokubu. In this system any plaintext corresponds to a Hamilton path. This fact introduces some constraints on the summation of public key elements in encryption. Our idea is to use these constraints to augment the lattice basis for LO attack. In this report we show that augmented basis leads to higher success rate of attacks.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) knapsack cryptosystem / Kobayashi-Kokubu TSP cryptosystem / lattice basis for Lagarias-Odlyzko attack
Paper # ISEC2008-85,OIS2008-61
Date of Issue

Conference Information
Committee ISEC
Conference Date 2008/11/6(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) On lattice bases for the Lagarias-Odlyzko attack against TSP cryptosystems
Sub Title (in English)
Keyword(1) knapsack cryptosystem
Keyword(2) Kobayashi-Kokubu TSP cryptosystem
Keyword(3) lattice basis for Lagarias-Odlyzko attack
1st Author's Name Takeshi TANIGUCHI
1st Author's Affiliation Knazawa Institute of Technology()
2nd Author's Name Akira HAYASHI
2nd Author's Affiliation Knazawa Institute of Technology
Date 2008-11-14
Paper # ISEC2008-85,OIS2008-61
Volume (vol) vol.108
Number (no) 284
Page pp.pp.-
#Pages 4
Date of Issue