Presentation	2012-07-20 How to purge imaginary path in truncate analysis Toshinobu KANEKO,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	Truncate path search is an effective method to evaluate an upper bound of the maximum characteristic probability of the cipher. If connection rule for a truncate path based on truncate difference (mask) addition is simply used, an imaginary path, which cannot be connected as a real one, will be included in the resultant optimum path. The upper bound of the maximum characteristic probability will be a loose one. In this paper, we propose a decision rule for a truncate path with real connectivity by applying elementary operations for the transfer matrix without using truncate difference (mask) addition rule.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	truncate path search / max-DCP/LCP / common-key cipher / truncate DCP/LCP analysis
Paper #	ISEC2012-32,SITE2012-28,ICSS2012-34,EMM2012-24
Date of Issue

Conference Information
Committee	ICSS
Conference Date	2012/7/12(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 and Communication System Security (ICSS)
Language	JPN
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	How to purge imaginary path in truncate analysis
Sub Title (in English)
Keyword(1)	truncate path search
Keyword(2)	max-DCP/LCP
Keyword(3)	common-key cipher
Keyword(4)	truncate DCP/LCP analysis
1st Author's Name	Toshinobu KANEKO
1st Author's Affiliation	Faculty of Science and Technology, Tokyo University of Science()
Date	2012-07-20
Paper #	ISEC2012-32,SITE2012-28,ICSS2012-34,EMM2012-24
Volume (vol)	vol.112
Number (no)	128
Page	pp.pp.-
#Pages	7
Date of Issue