Presentation 1996/7/22
Linear Approximation Probability of Addition upon the Addend Dependency
Hiroshi MIYANO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This report gives a study of addition Y=X+K, which is used in the algorithm of some cryptosystems such as RC5. Our result enables to express the linear approximation probability of addition as a function of addend K. To detect a good linear approximation of a function using an addition or additions whose addend is a fixed value (usually that is the expanded key), we need to consider the probablility that the approximation is correct depending upon the value of addend, which is clarified by our result.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Common key cryptosystem / Linear cryptanalysis / RC5 / Addition
Paper # ISEC96-10
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)
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) Linear Approximation Probability of Addition upon the Addend Dependency
Sub Title (in English)
Keyword(1) Common key cryptosystem
Keyword(2) Linear cryptanalysis
Keyword(3) RC5
Keyword(4) Addition
1st Author's Name Hiroshi MIYANO
1st Author's Affiliation Yokohama Research Center, Telecommunications Advancement Organization of Japan()
Date 1996/7/22
Paper # ISEC96-10
Volume (vol) vol.96
Number (no) 167
Page pp.pp.-
#Pages 12
Date of Issue