Presentation | 2007-03-16 Linearization method and linear complexity Hidema TANAKA, |
---|---|
PDF Download Page | PDF download Page Link |
Abstract(in Japanese) | (See Japanese page) |
Abstract(in English) | We show that linearization method is an effective technique to calculate linear complexity. We compare the condition and necessary computational cost with Berlekamp-Massey algorithm and Games-Chan algorithm. The significant property of linearization method is that it needs no output sequence from PRNG because it calculates linear complexity by using algebraic expression of algorithm of PRNG. |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | linearization method / linear complexity / pseudo random number generator / stream cipher / LFSR |
Paper # | IT2006-101,ISEC2006-156,WBS2006-98 |
Date of Issue |
Conference Information | |
Committee | ISEC |
---|---|
Conference Date | 2007/3/9(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 | ENG |
Title (in Japanese) | (See Japanese page) |
Sub Title (in Japanese) | (See Japanese page) |
Title (in English) | Linearization method and linear complexity |
Sub Title (in English) | |
Keyword(1) | linearization method |
Keyword(2) | linear complexity |
Keyword(3) | pseudo random number generator |
Keyword(4) | stream cipher |
Keyword(5) | LFSR |
1st Author's Name | Hidema TANAKA |
1st Author's Affiliation | National Institute of Information and Communications Technology() |
Date | 2007-03-16 |
Paper # | IT2006-101,ISEC2006-156,WBS2006-98 |
Volume (vol) | vol.106 |
Number (no) | 597 |
Page | pp.pp.- |
#Pages | 6 |
Date of Issue |