Presentation 1996/7/22
Provable Security of DES-like Ciphers Depending on its Rounds
Yasuyoshi KANEKO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This paper gives a new result, about the provable security of DES-like ciphers. We derive formulas for an estimation which gives an upper bound to the key average differential probability and the key average linear probability. These formulas have these parameters : the number of round N and the muximum 1-round differential probability p (or the 1-round linear probability q). In case of 3-round and 4-round, these formulas give good agreement with the well known Nyberg's and Aoki's results. When the probability p and the probability q are less than 1/2 these formulas become decrease functions of the number of round N. So we can get the formulas which are more secure than old ones.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Provable security / DES-like ciphers / N-round differential estimated formula / N-round linear estimated formula
Paper # ISEC96-8
Date of Issue

Conference Information
Committee ISEC
Conference Date 1996/7/22(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Vice Chair

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) Provable Security of DES-like Ciphers Depending on its Rounds
Sub Title (in English)
Keyword(1) Provable security
Keyword(2) DES-like ciphers
Keyword(3) N-round differential estimated formula
Keyword(4) N-round linear estimated formula
1st Author's Name Yasuyoshi KANEKO
1st Author's Affiliation Yokohama Research Center, Telecommunications Advancement Organization of Japan()
Date 1996/7/22
Paper # ISEC96-8
Volume (vol) vol.96
Number (no) 167
Page pp.pp.-
#Pages 11
Date of Issue