Institutional Repository
| Linearization Method and Linear Complexity | |
| Hidema Tanaka | |
| 2008 | |
| Source | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
 |
| Volume | E91-AIssue:1Pages:22-29 |
| English Abstract | We focus on the relationship between the linearization method and linear complexity and show that the linearization method is another effective technique for calculating linear complexity. We analyze its effectiveness by comparing with the logic circuit method. We compare the relevant conditions and necessary computational cost with those of the Berlekamp-Massey algorithm and the Games-Chan algorithm. The significant property of a linearization method is that it needs no output sequence from a pseudo-random number generator (PRNG) because it calculates linear complexity using the algebraic expression of its algorithm. When a PRNG has n [bit] stages (registers or internal states), the necessary computational cost is smaller than O(2n). On the other hand, the Berlekamp-Massey algorithm needs O(N2) where N ( 2n) denotes period. Since existing methods calculate using the output sequence, an initial value of PRNG influences a resultant value of linear complexity. Therefore, a linear complexity is generally given as an estimate value. On the other hand, a linearization method calculates from an algorithm of PRNG, it can determine the lower bound of linear complexity. |
| Indexed Type | 其他 |
| Cooperation Status | 其它 |
| Keyword | Algebraic Cryptanalysis Linear Complexity Linearization Method Pseudo-random Number Generator Stream Cipher |
| Language | 英语 |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/1367 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Hidema Tanaka. Linearization Method and Linear Complexity[J]. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences,2008,E91-A(1):22-29. |
| APA | Hidema Tanaka.(2008).Linearization Method and Linear Complexity.IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences,E91-A(1),22-29. |
| MLA | Hidema Tanaka."Linearization Method and Linear Complexity".IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E91-A.1(2008):22-29. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| bj01151891.pdf（673KB） | 开放获取 | License | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment