Presentation 2005-11-15
Efficient Algorithm for Computing Linear Probability of constant addition II
Kazunori SUMIKAWA, Hirotaka ITTOGI, Toshinobu KANEKO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This paper presents an efficient algorithm for computing linear probability of constant addition modulo 2^n. Ittogi et al. gave an efficient algorihtm for computing linear probability of addition moodulo 2^n in which one of the two input values is a constant. This paper presents an improved algorihtm of Ittogi et al. The number of multiplication of 4×4 matrix is reduced from a width of output mask to its Hamming weight.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) linear probability / constant addition
Paper # ISEC2005-105,OIS2005-68
Date of Issue

Conference Information
Committee ISEC
Conference Date 2005/11/8(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) Efficient Algorithm for Computing Linear Probability of constant addition II
Sub Title (in English)
Keyword(1) linear probability
Keyword(2) constant addition
1st Author's Name Kazunori SUMIKAWA
1st Author's Affiliation Faculty of Science and Technology, Tokyo University of Science()
2nd Author's Name Hirotaka ITTOGI
2nd Author's Affiliation Fuji susono research park, Canon Inc.
3rd Author's Name Toshinobu KANEKO
3rd Author's Affiliation Faculty of Science and Technology, Tokyo University of Science
Date 2005-11-15
Paper # ISEC2005-105,OIS2005-68
Volume (vol) vol.105
Number (no) 396
Page pp.pp.-
#Pages 7
Date of Issue