Presentation | 2005-05-18 Efficient Algorithm for Computing Linear Probability of constant addition 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. Park et al. and Moriai et al. gave an efficient algorithm for computing linear probability of addition modulo 2^n. However, an efficient algorithm for computing linear probability of addition modulo 2^n which one of the two input values is constant is unknown. This paper presents an efficient algorithm for computing linear probability of constant addition modulo 2^n. The algorithm requires computational complexity proportional to bit width n. |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | addition / linear probability / comprising probability |
Paper # | ISEC2005-8 |
Date of Issue |
Conference Information | |
Committee | ISEC |
---|---|
Conference Date | 2005/5/11(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 |
Sub Title (in English) | |
Keyword(1) | addition |
Keyword(2) | linear probability |
Keyword(3) | comprising probability |
1st Author's Name | Hirotaka ITTOGI |
1st Author's Affiliation | Fuji susono research park, Canon Inc.() |
2nd Author's Name | Toshinobu KANEKO |
2nd Author's Affiliation | Faculty of Science and Technology, Tokyo University of Science |
Date | 2005-05-18 |
Paper # | ISEC2005-8 |
Volume (vol) | vol.105 |
Number (no) | 51 |
Page | pp.pp.- |
#Pages | 6 |
Date of Issue |