版权说明 操作指南
首页 > 成果 > 详情

A New Simple Matrix Representation Method of the BM Algorithm Using in Flowing Cipher Field (PDF)

认领
导出
Link by DOI
反馈
分享
QQ微信 微博
成果类型:
期刊论文
作者:
Yin, Qian*;Guo, Ping;Wei, Zukuan;He, Zhiyong
通讯作者:
Yin, Qian
作者机构:
[Guo, Ping; Yin, Qian] Beijing Normal Univ, Coll Informat Sci & Technol, Beijing 100875, Peoples R China.
[Wei, Zukuan] Univ Elect Sci & Technol China, Sch Comp Sci & Engn, Chengdu 610054, Peoples R China.
[He, Zhiyong] Hunan Agr Univ, Sch Informat Sci & Technol, Hunan 410128, Peoples R China.
通讯机构:
[Yin, Qian] B
Beijing Normal Univ, Coll Informat Sci & Technol, Beijing 100875, Peoples R China.
语种:
英文
期刊:
CIS WORKSHOPS 2007: INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY WORKSHOPS
年:
2007
页码:
765-768
机构署名:
本校为其他机构
院系归属:
信息科学技术学院
摘要:
In this paper, a new simple representation of the Berlekamp-Massey algorithm was proposed, which resolves the problem of the length of the shortest linear recurrence in the flowing cipher study. In the process of investigating the Berlekamp-Massey algorithm, using matrix-method can help to simplify the representation of the Berlekamp-Massey algorithm and easily calculate the distributing regulation of the shortest linear rec...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com