ISCAS OpenIR
Linearization Method and Linear Complexity
Hidema Tanaka
2008
发表期刊IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
卷号E91-A期号:1页码:22-29
摘要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.
收录类别其他
合作性质其它
关键词Algebraic Cryptanalysis Linear Complexity Linearization Method Pseudo-random Number Generator Stream Cipher
语种英语
内容类型期刊论文
URI标识http://ir.iscas.ac.cn/handle/311060/1367
专题中国科学院软件研究所
推荐引用方式
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.
条目包含的文件
文件名称/大小 文献类型 版本类型 开放类型 使用许可
bj01151891.pdf(673KB) 开放获取使用许可请求全文
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Hidema Tanaka]的文章
百度学术
百度学术中相似的文章
[Hidema Tanaka]的文章
必应学术
必应学术中相似的文章
[Hidema Tanaka]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。